English
Related papers

Related papers: A characterization of regular tetrahedra in Z^3

200 papers

Conjecturally, a knot in the 3-sphere has only finitely many non-integer non-characterizing slopes. We verify this conjecture for all knots with knot Floer homology satisfying certain simplicity conditions. The class of knots satisfying our…

Geometric Topology · Mathematics 2025-02-11 Duncan McCoy

We estimate the number of incidences in a configuration of $m$ lines and $n$ points in dimension 3. The main term is $mn^{1/3}$ if we work over the real or complex numbers but $mn^{2/5}$ over finite fields. Both of these are optimal, aside…

Combinatorics · Mathematics 2014-12-05 János Kollár

In 2018, Sz\"{o}ll\H{o}si and \"{O}sterg\r{a}rd used a computer to enumerate sets of equiangular lines with common angle $\arccos(1/3)$ in dimension $7$. They observed that the numbers $\omega(n)$ of sets of $n$ equiangular lines with…

Combinatorics · Mathematics 2025-06-12 Kiyoto Yoshino

We study several properties of $\ZZ_2^n$-equivariant triangulations of $\RR P^n$. We show that a $\ZZ_2^n$-equivariant triangulation of $\RR P^n$ induces a triangulated subdivision of the orbit space $\bigtriangleup^n$. We show that any…

Geometric Topology · Mathematics 2026-02-18 Soumen Sarkar

A characterization of the symmetry algebra of the $n$th order ordinary differential equations (ODEs) with maximal symmetry and all third order linearizable ODEs is given. This is used to show that such an algebra $\mathfrak{g}$ determines…

Classical Analysis and ODEs · Mathematics 2020-06-25 Sajid Ali , Hassan Azad , Said Waqas Shah , Fazal M. Mahomed

Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…

Computational Geometry · Computer Science 2010-07-02 David Eppstein

We construct a sequence of convex polyhedra on n vertices with the property that, as n -> infinity, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the fraction that overlap approaches 1. Nevertheless, each does…

Computational Geometry · Computer Science 2008-01-28 Alex Benton , Joseph O'Rourke

We continue the work begun in OEIS sequence A332636 which presents recursive sequences that have triangles that appear embedded in them. This paper i) generalizes the main result presented in A332636, ii) provides a complete set of…

Number Theory · Mathematics 2021-01-26 Russell Jay Hendel

With the $[0,1,2]$-family of cyclic triangulations we introduce a rich class of vertex-transitive triangulations of surfaces. In particular, there are infinite series of cyclic $q$-equivelar triangulations of orientable and non-orientable…

Combinatorics · Mathematics 2010-01-19 Frank H. Lutz

A closed connected hyperbolic $n$-manifold bounds geometrically if it is isometric to the geodesic boundary of a compact hyperbolic $(n+1)$-manifold. A. Reid and D. Long have shown by arithmetic methods the existence of infinitely many…

Geometric Topology · Mathematics 2020-06-25 Alexander Kolpakov , Bruno Martelli , Steven T. Tschantz

We consider a Dirichlet series $\sum_{n=1}^{\infty}a_n^{-s}$, where $a_n$ satisfies a linear recurrence of arbitrary degree with integer coefficients. Under suitable hypotheses, we prove that it has a meromorphic continuation to the complex…

Number Theory · Mathematics 2023-01-30 Álvaro Serrano Holgado , Luis Manuel Navas Vicente

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

Combinatorics · Mathematics 2022-10-11 Lewis Stanton , Jeffrey Thompson

The triangle-degree of a vertex v of a simple graph G is the number of triangles in G that contain v. A simple graph is triangle-distinct if all its vertices have distinct triangle-degrees. Berikkyzy et al. [Discrete Math. 347 (2024)…

Let X be a singular affine normal variety with coordinate ring R and assume that there is an R-order admitting a stability structure such that the scheme of relevant semistable representations is smooth, then we construct a partial…

Rings and Algebras · Mathematics 2007-05-23 Lieven Le Bruyn , Stijn Symens

It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.

Computational Geometry · Computer Science 2011-06-09 Joseph O'Rourke

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

Combinatorics · Mathematics 2007-05-23 Jeff Erickson

A normalized holomorphic family (depending on $\boldsymbol \lambda \in \mathbb C^3$) of conformally invariant trilinear forms on the sphere is studied. Its zero set $Z$ is described. For $\boldsymbol \lambda\notin Z$, the multiplicity of…

Representation Theory · Mathematics 2017-10-24 Jean-Louis Clerc

In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…

Combinatorics · Mathematics 2018-11-21 R. Gargouri , H. Najar

The triple point numbers and the triple point spectrum of a closed 3-manifold were defined in (R. Vigara, Representaci\'on de 3-variedades por esferas de Dehn rellenantes, PhD Thesis, UNED 2006). They are topological invariants that give a…

Geometric Topology · Mathematics 2014-12-05 Álvaro Lozano Rojo , Rubén Vigara Benito

We reach beyond the celebrated theorems of Erd\H{o}s-Ko-Rado and Hilton-Milner, and, a recent theorem of Han-Kohayakawa, and determine all maximal intersecting triples systems. It turns out that for each $n\ge7$ there are exactly 15…

Combinatorics · Mathematics 2016-08-23 Joanna Polcyn , Andrzej Rucinski