Related papers: Solution of Erd\H{o}s Problem 633
We present a concise self-contained inversive geometry solution of the three-circle problem of Steiner of constructing a circle that intersects each of the three given circles at one of the three given angles.
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
Since the thesis of K. Reinhardt in 1918, it is well known that there are exactly three types of convex hexagons that can tile the plane. However, the proof of the fact is far from being complete. We prove this fact, under an assumption…
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
We prove that for any $\mathbb{N}$-graded Gorenstein tiled order $A$, the stable category $\underline{\mathrm{CM}}^{\mathbb{Z}}A$ is triangle equivalent to the perfect derived category of the incidence algebra of a finite poset…
We study the following family of problems: Given a set of $n$ points in convex position, what is the maximum number triangles one can create having these points as vertices while avoiding certain sets of forbidden configurations. As…
The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…
We study objects in triangulated categories which have a two-dimensional graded endomorphism algebra. Given such an object, we show that there is a unique maximal triangulated subcategory, in which the object is spherical. This general…
There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…
Let $\cal T$ be a tiling of the plane with equilateral triangles no two of which share a side. We prove that if the side lengths of the triangles are bounded from below by a positive constant, then $\cal T$ is periodic and it consists of…
We show that the following problem is undecidable: given two polygonal prototiles, determine whether the plane can be tiled with rotated and translated copies of them. This improves a result of Demaine and Langerman [SoCG 2025], who showed…
In this paper, we construct infinitely many quadruples of real quadratic fields whose class numbers are all divisible by $3$. To the best of our knowledge, this is the first result towards the divisibility of the class numbers of certain…
We consider the number of domino tilings of an odd-by-odd rectangle that leave one hole. This problem is equivalent to the number of near-perfect matchings of the odd-by-odd rectangular grid. For any particular position of the vacancy on…
By a simple method we prove the following conjecture on Sharygin triangles: there is only one Sharygin triangle (up to an isometry) whose vertices are chosen from the set of vertices of a regular polygon inscribed in a circle of radius 1.
Erd\H{o}s and Hajnal proposed a problem that: is it true that every $(2n+1)$-vertex graph with $n^2+n+1$ edges contains two vertices of equal degree connected by a path of length three? The edge bound is sharp by the complete bipartite…
We systematically describe and classify 1-dimensional Schr\"odinger equations that can be solved in terms of hypergeometric type functions. Beside the well-known families, we explicitly describe 2 new classes of exactly solvable…
In this article we make the concept of a continuous family of triangles precise and prove the moduli functor classifying oriented triangles admits a fine moduli space but the functor classifying non-oriented triangles only admits a coarse…
We prove the existence of one or more solutions to a singularly perturbed elliptic problema with two potential functions.
Which polyominoes can be folded into a cube, using only creases along edges of the square lattice underlying the polyomino, with fold angles of $\pm 90^\circ$ and $\pm 180^\circ$, and allowing faces of the cube to be covered multiple times?…
We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…