| Nama Pengarang | : | Lorenzo Fornari, Enrico Laeng & Vittorino Pata |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 6) |
| Nomor Halaman | : | 589-592 |
| Abstraksi Narasi | : | The authors thank the anonymous referees for their valuable comments. |
| Nama Pengarang | : | Jun Ho Lee |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 6) |
| Nomor Halaman | : | 584-588 |
| Abstraksi Narasi | : | Let d be a non-square positive integer. In this paper, we show that if the period length of the continued fraction expansion of √???? is odd, then ????≡1 or 2 (mod?4). This provides a simple classification criterion for d based solely on congruence conditions. Our approach relies only on basic properties of continued fraction expansions, offering an elementary perspective on a classical problem. |
| Nama Pengarang | : | Dana Paquin & Julian Schennach |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 6) |
| Nomor Halaman | : | 578-583 |
| Abstraksi Narasi | : | Minkowski’s celebrated theorem, bounding the area of centrosymmetric convex sets intersecting only one point of a lattice, has broad implications from number theory to geometry. But what about discrete sets generated by symmetries other than translations? Here we explore extensions for all lattices constructed from Archimedean tilings of the Euclidean plane and observe how symmetry constraints and optimality interact in intricate ways. |
| Nama Pengarang | : | Daniel A. Jaume & Kevin Pereyra |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 6) |
| Nomor Halaman | : | 571-576 |
| Abstraksi Narasi | : | We introduce a simple structural property of bipartite graphs—edge-stability—which states that removing an edge whose endpoints lie in a minimum vertex cover does not change the vertex cover number. This property admits an elementary proof and serves as a bridge between several classical theorems in matching theory. We show that edge-stability follows directly from K?nig’s Theorem and, conversely, can be used to rederive it. Moreover, we employ edge-stability to obtain short proofs of Berge’s characterization of maximum independent sets and Hall’s Marriage Theorem. Thus within the framework of Reichmeider’s equivalence of Mengerian theorems, edge-stability, K?nig’s, Berge’s, and Hall’s theorems are all equivalent. The approach highlights new conceptual and pedagogical connections between these cornerstone results in matching theory. |
| Nama Pengarang | : | Hannah Dempsey, Dominic Klyve, Sooie-Hoe Loke & Vincent Nguyen |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 6) |
| Nomor Halaman | : | 560-570 |
| Abstraksi Narasi | : | In this work, we examine rearrangements of the alternating harmonic series, in which terms are grouped into blocks sharing a sign. The work extends and generalizes earlier results on similar rearrangements, including some published in the Monthly. We conclude by demonstrating (conditionally on Schanuel’s conjecture) that the sum of any such rearrangement is a transcendental number. |
| Nama Pengarang | : | Simon Gmeiner & Andreas S. Schulz |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 6) |
| Nomor Halaman | : | 540-559 |
| Abstraksi Narasi | : | How can a stack of identical blocks be arranged to extend beyond the edge of a table as far as possible? We consider a generalization of this classic puzzle to blocks that differ in width and mass. Despite the seemingly simple premise, we demonstrate that it is unlikely that one can efficiently determine a stack configuration of maximum overhang. Formally, we prove that the Block-Stacking Problem is NP-hard, partially answering an open question from the literature. Furthermore, we demonstrate that the restriction to stacks without counterweights has a surprising connection to the Airplane Refueling Problem, another famous puzzle, and to Robust Appointment Scheduling, a problem of practical relevance. In addition to revealing a remarkable relation to the real-world challenge of devising schedules under uncertainty, their equivalence unveils a polynomial-time approximation scheme, that is, a (1+????)-approximation algorithm, for Block Stacking without counterbalancing and a (2+????)-approximation algorithm for the general case. |
| Nama Pengarang | : | Rylan Gajek-Leonard & Uri Tomer |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 6) |
| Nomor Halaman | : | 532-539 |
| Abstraksi Narasi | : | The p-adic Newton polygon is a visual tool that encodes information about the roots and factorization of a polynomial relative to a prime p. In this article, we investigate how the Newton polygon changes under polynomial composition. If f and g are polynomials with rational (or p-adic) coefficients and the Newton polygon of g is pure (has only one segment), we show under some mild conditions that the Newton polygon of ????°???? is the same as that of f, but stretched horizontally by deg?????. When ????=????, this implies that all iterates of certain pure polynomials are irreducible, recovering a classical result of Robert Odoni on the irreducibility of iterated Eisenstein polynomials. |
| Nama Pengarang | : | Vincent E. Coll Jr. & George V. McIlvaine |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 6) |
| Nomor Halaman | : | 511-531 |
| Abstraksi Narasi | : | In mathematics and physics, a catenary is the curve that an idealized hanging chain assumes when hanging under its own weight in a uniform gravitational field when supported only at its ends. However, standard calculations assume a flat Earth. A “true” catenary (“catenaria”) recognizes the inverse-square attractive gravitational forces of a central body (e.g., Earth). While the catenary is unique up to scale, catenaria are not. Following from a characterization of curves that maintain a circular roulette, we show that all catenaria, and their associated arches, have a circular roulette. |
| Nama Pengarang | : | Robert Dougherty-Bliss, Charles Kenney & Doron Zeilberger |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 132 (No. 10) |
| Nomor Halaman | : | 947-959 |
| Abstraksi Narasi | : | Hilbert’s famous 10th problem asked whether an algorithm exists to determine if a given Diophantine equation has a solution—in other words whether Diophantine equations are decidable. Yuri Matiyasevich proved that the answer is no, Diophantine equations are not decidable. However, it turns out that Matiyasevich’s ideas can be turned around and used to construct families of decidable Diophantine equations. All you need (to get started) are the Tribonacci numbers and a bit of calculus. |
| Nama Pengarang | : | Daniel H. Ullman, Daniel J. Velleman, Stan Wagon & Douglas B. West |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 5) |
| Nomor Halaman | : | 492-502 |
| Abstraksi Narasi | : | Deskripsi abstrak ringkas tidak tersedia untuk artikel ini. |