English
Related papers

Related papers: The complete characterization of tangram pentagons

200 papers

A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices. We prove the Conjecture for…

Combinatorics · Mathematics 2023-06-22 Grace Misereh , Yuri Nikolayevsky

We study the puzzle graphs of hexagonal sliding puzzles of various shapes and with various numbers of holes. The puzzle graph is a combinatorial model which captures the solvability and the complexity of sequential mechanical puzzles.…

Combinatorics · Mathematics 2022-01-05 Ray Karpman , Erika Roldan

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of…

Combinatorics · Mathematics 2021-03-09 S. Lawrencenko , T. Sulanke , M. T. Villar , L. V. Zgonnik , M. J. Chávez , J. R. Portillo

We survey literature on all known families and examples of Dehn invariant zero tetrahedra. We also contribute two previously unknown families of Dehn invariant zero tetrahedra. Following a suggestion of Dill and Habegger, we show that there…

Metric Geometry · Mathematics 2023-12-05 A. Anas Chentouf , Yihang Sun

It is well-known since the time of the Greeks that two disjoint circles in the plane have four common tangent lines. Cappell et al. proved a generalization of this fact for properly separated strictly convex bodies in higher dimensions. We…

Metric Geometry · Mathematics 2022-07-14 Federico Castillo , Joseph Doolittle , Jose Alejandro Samper

A regular polyhedron of type {p, q} has at least 2pq flags, and it is called tight if it has exactly 2pq flags. The values of p and q for which there exist tight orientably regular polyhedra were previously known. We determine for which…

Combinatorics · Mathematics 2016-04-12 Gabe Cunningham , Daniel Pellicer

We prove NP-completeness of Yin-Yang / Shiromaru-Kuromaru pencil-and-paper puzzles. Viewed as a graph partitioning problem, we prove NP-completeness of partitioning a rectangular grid graph into two induced trees (normal Yin-Yang), or into…

Computational Complexity · Computer Science 2021-06-30 Erik D. Demaine , Jayson Lynch , Mikhail Rudoy , Yushi Uno

Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…

General Mathematics · Mathematics 2022-08-29 Gabriel Hale , Bjorn Vogen , Matthew Wright

In this paper we derive from arguments of string scattering a set of eight tetrahedron equations, with different index orderings. It is argued that this system of equations is the proper system that represents integrable structures in three…

q-alg · Mathematics 2009-10-30 Jarmo Hietarinta , Frank Nijhoff

We study the class of indecomposable two-dimensional Landau-Ginzburg theories with (2,2) supersymmetry and central charge c < 6 with the aim of classifying all such theories up to marginal deformations. Our results include cases overlooked…

High Energy Physics - Theory · Physics 2017-06-07 Ian C. Davenport , Ilarion V. Melnikov

Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…

Combinatorics · Mathematics 2020-08-19 Ralph Morrison , Ayush Kumar Tewari

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…

Computational Geometry · Computer Science 2010-07-22 Oswin Aichholzer , Franz Aurenhammer , Erik D. Demaine , Ferran Hurtado , Pedro Ramos , Jorge Urrutia

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

Combinatorics · Mathematics 2020-03-11 Chuanqi Xiao , Gyula O. H. Katona

We classify rational solutions of a specific type of the set theoretical version of the pentagon equation. That is, we find all quadrirational maps $R:(x,y)\mapsto (u(x,y),v(x,y)),$ where $u, v$ are two rational functions on two arguments,…

Exactly Solvable and Integrable Systems · Physics 2024-09-27 Charalampos Evripidou , Pavlos Kassotakis , Anastasios Tongas

A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of…

Combinatorics · Mathematics 2017-09-22 Diego Nicodemos , Matěj Stehlík

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…

Combinatorics · Mathematics 2007-10-26 W. R. G. James , I. Jensen , A. J. Guttmann

We systematically investigate properties of various triangle centers (such as orthocenter or incenter) located on the four faces of a tetrahedron. For each of six types of tetrahedra, we examine over 100 centers located on the four faces of…

History and Overview · Mathematics 2021-01-08 Stanley Rabinowitz

Hexagonal circle patterns are introduced, and a subclass thereof is studied in detail. It is characterized by the following property: For every circle the multi-ratio of its six intersection points with neighboring circles is equal to -1.…

Complex Variables · Mathematics 2007-05-23 A. I. Bobenko , T. Hoffmann , Yu. B. Suris

We investigate the geometry of the four qubit systems by means of algebraic geometry and invariant theory, which allows us to interpret certain entangled states as algebraic varieties. More precisely we describe the nullcone, i.e., the set…

Mathematical Physics · Physics 2015-06-16 Frédéric Holweck , Jean-Gabriel Luque , Jean-Yves Thibon

An integral quadratic form is called strictly $n$-regular if it primitively represents all quadratic forms in $n$ variables that are primitively represented by its genus. For any $n \geq 2$, it will be shown that there are only finitely…

Number Theory · Mathematics 2017-06-14 Wai Kiu Chan , Alicia Marino
‹ Prev 1 4 5 6 7 8 10 Next ›