Related papers: The Circumbilliard: Any Triangle can be a 3-Period…
We analyze loci of triangle centers over variants of two-well known triangle porisms: the bicentric and confocal families. Specifically, we evoke the general version of Poncelet's closure theorem whereby individual sides can be made tangent…
We study the dynamics of a piecewise map defined on the set of three pairwise nonparallel, nonconcurrent lines in $\mathbb{R}^2$. The geometric map of study may be analogized to the billiard map with a different reflection rule so that each…
A rational triangle is a triangle with rational side lengths. We consider three different families of rational triangles having a fixed side and whose vertices are rational points in the plane. We display a one-to-one correspondence between…
Generic spherical quadrilaterals are classified up to isometry. Condition of genericity consists in the requirement that the images of the sides under the developing map belong to four distinct circles which have no triple intersections.…
A study of triangulations of cycles in the Cayley diagrams of finitely generated groups leads to a new geometric characterization of hyperbolic groups.
A triangular form is defined to be an integer-valued quadratic polynomial of the form $a_1P_3(x_1)+a_2P_3(x_2)+\cdots+a_kP_3(x_k)$ where $a_i's$ are positive integers and $P_3(x)=x(x+1)/2$. A triangular form is called regular if it…
We investigate several topics of triangle geometry in the elliptic and in the extended hyperbolic plane, such as: centers based on orthogonality, centers related to circumcircles and incircles, radical centers and centers of similitude,…
Any periodic trajectory on an isosceles triangle gives rise to a periodic trajectory on a right triangle obtained by identifying the halves of the original triangle. We examine the relationship between periodic trajectories on isosceles…
Using Marden's Theorem from geometric theory of polynomials, we show that for every triangle there is a unique ellipse such that the triangle is a billiard trajectory within that ellipse. Since $3$-periodic trajectories of billiards within…
A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…
In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…
Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…
A triangulated piecewise-linear minimal surface in Euclidean 3-space defined using a variational characterization is critical for area amongst all continuous piecewise-linear variations with compact support that preserve the simplicial…
If there exists a cyclic quadrilateral whose sides go through the given four collinear points, then there are infinitely many such quadrilaterals inscribed in the same circle. We give two proofs of this porism; one based on cross-ratios,…
A topologically minimal surface may be isotoped into a normal form with respect to a fixed triangulation. If the intersection with each tetrahedron is simply connected, then the pieces of this normal form are triangles, quadrilaterals, and…
In this paper we introduce the definition of transitivity for oriented 3-hypergraphs in order to study partial and complete cyclic orders. This definition allow us to give sufficient conditions on a partial cyclic order to be totally…
We introduce a linear algebraic object called a bidiagonal triad. A bidiagonal triad is a modification of the previously studied and similarly defined concept of bidiagonal triple. A bidiagonal triad and a bidiagonal triple both consist of…
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two…
Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent chambers in a certain graphic hyperplane arrangement. Properties of geodesics in the associated flip graph are…
It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…