| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Ilmu dan Budaya |
| Volume / Nomor Edisi | : | VIII-9, JUNI (No. 9) |
| Nomor Halaman | : | 673-680 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Curtis Barnhart, Russell Howell, Isaac Jessop & Samuel Tang |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 132 (No. 2) |
| Nomor Halaman | : | 122-133 |
| Abstraksi Narasi | : | A certain class of holomorphic functions in the unit disk can be put into a one-to-one correspondence with a subset of the interval [0,1]. We show that the measure of this subset is either zero or one. We also uncover some symmetry properties of this subset, then exhibit an uncountable collection of numbers belonging to it as well as to its complement. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Ilmu dan Budaya |
| Volume / Nomor Edisi | : | VIII-9, JUNI (No. 9) |
| Nomor Halaman | : | 663-672 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Jineon Baek & Seewoo Lee |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 132 (No. 2) |
| Nomor Halaman | : | 113-121 |
| Abstraksi Narasi | : | John Conway and Alexander Soifer showed that an equilateral triangle T of side slightly longer than n can be covered by ????2+2 unit equilateral triangles. They also conjectured that it is impossible to cover T with ????2+1 unit equilateral triangles, no matter how close the side of T is to n. While the Conway–Soifer conjecture remains open, we prove an important case where the sides of the triangles used for covering are parallel to the sides of T (e.g., ? and ?). That is, we show that if all unit equilateral triangles are required to be homothetic to T, then the minimum number of unit equilateral triangles that can cover T of side slightly longer than n is exactly ????2+2. Our proof generalizes to covering T by (not necessarily equilateral) triangles of base one parallel to the x-axis and height equal to that of a unit equilateral triangle. Using our method, we also determine the largest side length ????+1/(????+1) (resp. ????+1/????) of T such that the equilateral triangle T can be covered by ????2+2 (respectively ????2+3) unit equilateral triangles homothetic to T. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Ilmu dan Budaya |
| Volume / Nomor Edisi | : | VIII-9, JUNI (No. 9) |
| Nomor Halaman | : | 658-662 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Ilmu dan Budaya |
| Volume / Nomor Edisi | : | VIII-9, JUNI (No. 9) |
| Nomor Halaman | : | 651-657 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Raphael Cerf & Carlo Mariconda |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 131 (No. 10) |
| Nomor Halaman | : | 881-898 |
| Abstraksi Narasi | : | The basic problem of the calculus of variations consists of finding a function that minimizes an energy, like finding the fastest trajectory between two points for a point mass in a gravity field or finding the best shape of a wing. The existence of a solution may be established in quite abstract spaces, much larger than the space of smooth functions. An important practical problem is that of being able to approach the value of the infimum of the energy. However, numerical methods work with very “concrete” functions and sometimes they are unable to approximate the infimum: this is the surprising Lavrentiev phenomenon. The papers that ensure the nonoccurrence of the phenomenon form a recent saga, and the most general result formulated in the early ’90s was actually fully proved just recently, more than 30 years later. Our aim here is to introduce the reader to the calculus of variations, to illustrate the Lavrentiev phenomenon with the simplest known example, and to give an elementary proof of the nonoccurrence of the phenomenon. |
| Nama Pengarang | : | Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran & Shlomo Moran |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 131 (No. 10) |
| Nomor Halaman | : | 866-879 |
| Abstraksi Narasi | : | We study several variants of a combinatorial game which is based on Cantor’s diagonal argument. The game is between two players called Kronecker and Cantor. The names of the players are motivated by the known fact that Leopold Kronecker did not appreciate Georg Cantor’s arguments about the infinite, and even referred to him as a “scientific charlatan.” In the game Kronecker maintains a list of m binary vectors, each of length n, and Cantor’s goal is to produce a new binary vector which is different from each of Kronecker’s vectors, or prove that no such vector exists. Cantor does not see Kronecker’s vectors but he is allowed to ask queries of the form What is bit number j of vector number i? What is the minimal number of queries with which Cantor can achieve his goal? How much better can Cantor do if he is allowed to pick his queries adaptively, based on Kronecker’s previous replies? The case when m = n is solved by diagonalization using n (nonadaptive) queries. We study this game more generally, and prove an optimal bound in the adaptive case and nearly tight upper and lower bounds in the nonadaptive case. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Ilmu dan Budaya |
| Volume / Nomor Edisi | : | VIII-9, JUNI (No. 9) |
| Nomor Halaman | : | 646-650 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | M. Suresh Kumar & V. Kamalakannan |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 131 (No. 10) |
| Nomor Halaman | : | 855-865 |
| Abstraksi Narasi | : | A QR code is a two-dimensional bar code that encodes a message into a finite collection of black and white squares which are arranged in a square region with a specific order. Considering a QR code as a compact subset of ?2, we construct an Iterated Function System (IFS) on ?2 whose attractor is the given QR code. |