Related papers: There are integral heptagons, no three points on a…
Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…
One of the general problems in algebraic geometry is to determine algorithmically whether or not a given geometric object, defined by explicit polynomial equations (e.g. a curve or a surface), satisfies a given property (e.g. has…
A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on…
In this experimental work we study billiard trajectories in triangular pyramids and try to establish conditions that guarantee the existence (or absence) of 4-cycles (there can be not more, than three of them). We formulate conjectures and…
R. Nandakumar asked whether there is a tiling of the plane by pairwise incongruent triangles of equal area and equal perimeter. Recently a negative answer was given by Kupavskii, Pach and Tardos. Still one may ask for weaker versions of the…
We prove that if $P$ is a set of $n$ points in $\mathbb{C}^2$, then either the points in $P$ determine $\Omega(n^{1-\epsilon})$ complex distances, or $P$ is contained in a line with slope $\pm i$. If the latter occurs then each pair of…
We show that there are no edge-to-edge tilings of the sphere by congruent pentagons beyond the minimal dodecahedron tiling, such that there is a tile with all vertices having degree 3 and the edge length combinations are three of the five…
For a given real number $\alpha$, let us place the fractional parts of the points $0, \alpha, 2 \alpha,$ $ \cdots, (N-1) \alpha$ on the unit circle. These points partition the unit circle into intervals having at most three lengths, one…
For every $n$, we construct two curves in the plane that intersect at least $n$ times and do not form spirals. The construction is in three stages: we first exhibit closed curves on the torus that do not form double spirals, then arcs on…
Let $P$ be a finite point set in the plane. A \emph{$c$-ordinary triangle} in $P$ is a subset of $P$ consisting of three non-collinear points such that each of the three lines determined by the three points contains at most $c$ points of…
We study the eleven points in the plane of a given triangle, whose pedal triangles are similar to the given one. We prove that the six points whose pedal triangles are positively oriented, lie on a single circle, while the five points,…
A Tangle is a smooth simple closed curve formed from arcs (or ``links'') of circles with fixed radius. Most previous study of Tangles has dealt with the case where these arcs are quarter-circles, but Tangles comprised of thirds and sixths…
In this paper, we give a Zariski triple of the arrangements for a smooth quartic and its four bitangents. A key criterion to distinguish the topology of such curves is given by a matrix related to the height pairing of rational points…
An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…
We prove that the Pythagoras number of the ring of integers of the compositum of all real quadratic fields is infinite. The same holds for certain infinite totally real cyclotomic fields. In contrast, we construct infinite degree totally…
We study equilibrium configurations of infinitely many identical particles on the real line or finitely many particles on the circle, such that the (repelling) force they exert on each other depends only on their distance. The main question…
A configuration of points and lines is cyclic if it has an automorphism which permutes its points in a full cycle. A closed formula is derived for the number of non-isomorphic connected cyclic configurations of type (v_3), i.e., which have…
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et…
After the introduction, in section 2 we state the well known parametric formulas that describe the entire family of Pythagorean triples. In section 3, we list four well known results from number theory, used later in the paper. in section…
Let $L$ be any integral lattice in the 2-dimensional Euclidean space. Generalizing the earlier works of Hiroshi Maehara and others, we prove that for every integer $n>0$, there is a circle in the plane $\mathbb{R}^{2}$ that passes through…