arXiv subjects
Publications and source records attributed to Iwan Praton.
A polygon is equable if its area is equal to its perimeter. A pair of polygons is an amicable pair if the area of the first is equal to the perimeter of the second, and vice versa. A polygon is a lattice polygon if its vertices lie on the integer lattice. We show that amicable lattice rhombuses are actually equable.
A convex polygon is Heronian if its side lengths and its area are integers. Two polygons are amicable if the area of one is equal to the perimeter of the other, and vice versa. We show that there are infinitely many pairs of amicable Heronian parallelograms, and we give necessary and sufficient conditions for a Heronian parallelogram to be part of an amicable pair.
Two polygons are amicable if the perimeter of one is equal to the area of the other and vice versa. A polygon is a lattice polygon if its vertices are on the integer lattice $\Z^2$. We show that there is one pair of amicable lattice triangles and five pairs of amicable lattice rectangles.
We define the dart $D(a)$ to be the nonconvex quadrilateral whose vertices are $(0,1), (1,1), (1,0), (a,a)$ (in counterclockwise order), with $a>1$. Such a dart can be dissected into any even number of equal-area triangles. Here we investigate darts that can be dissected into an odd number of equal-area triangle.
A Heron triangle is a triangle whose side lengths and area are integers. Two Heron triangles are amicable if the perimeter of one is the area of the other. We show, using elementary techniques, that there is only one pair of amicable Heron triangles.
A tiling of the unit square is an MTP tiling if the smallest tile can tile all the other tiles. We look at the function $f(n)=\max \sum s_i$, where $s_i$ is the side length of the $i$th tile and the sum is taken over all MTP tilings with $n$ tiles. If $n=k^2+3$, it was conjectured that $f(k^2+3)=k+1/k$. We show that any tiling that violates the conjecture must consist of at least three tile sizes and has exactly one minimal tile.
A square tiling of the unit square is said to have the minimal tile property if the smallest tile can tile all the other tiles. We show that in such a tiling, the smallest tile cannot be too small.
Tile the unit square with $n$ small squares. We determine the minimum of the sum of the side lengths of the $n$ small squares, where the minimum is taken over all tilings of the unit square with $n$ squares.
Put n nonoverlapping squares inside the unit square. Let f(n) and g(n) denote the maximum values of the sum of the edge lengths of the n small squares, where in the case of f(n) the maximum is taken over all arbitrary packings of the unit square, and in the case of g(n) it is taken over all tilings of the unit square (i.e., the total area of the n small squares is 1). Benton and Tyler asked for which values of n we have f(n)=g(n). We show that f(8)>g(8). More precisely, we show that g(8)=13/5; it is known that f(8) is at least 8/3.
We classify the primitive ideals of generalized down-up algebras
Put n open non-overlapping squares inside a unit square, and let f(n) denote the maximum possible value of the sum of the side lengths of the n squares. Campbell and Staton, building on a question of Erdos, conjectured that f(k^2+2c+1)=k+c/k, where c is any integer and k\geq |c|. We show that if this conjecture is true for one value of c, then it is true for all values of c.