English
Related papers

Related papers: Hamiltonian Tetrahedralizations with Steiner Point…

200 papers

Determining if an input undirected graph is Hamiltonian, i.e., if it has a cycle that visits every vertex exactly once, is one of the most famous NP-complete problems. We consider the following generalization of Hamiltonian cycles: for a…

Data Structures and Algorithms · Computer Science 2026-05-06 Antoine Amarilli , Arthur Lombardo , Mikaël Monet

We introduce a family of piecewise isometries $f_s$ parametrized by $s \in [0,1)$ on the surface of a regular tetrahedron, which we call the tetrahedral twists. This family of maps is similar to the PETs constructed by Patrick Hooper. We…

Dynamical Systems · Mathematics 2016-09-13 Ren Yi

Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger uniformity by considering…

Combinatorics · Mathematics 2025-03-27 Hyunwoo Lee

We are interested in the maximum possible number of facets that Dirichlet stereohedra for three-dimensional crystallographic groups can have. The problem for non-cubic groups was studied in previous papers by D. Bochis and the second author…

Combinatorics · Mathematics 2009-07-07 Pilar Sabariego , Francisco Santos

Let $G=(V,E)$ be a bipartite graph embedded in a plane (or $n$-holed torus). Two subgraphs of $G$ differ by a {\it $Z$-transformation} if their symmetric difference consists of the boundary edges of a single face---and if each subgraph…

Combinatorics · Mathematics 2007-05-23 Scott Sheffield

The complex eigenvalues of some non-Hermitian Hamiltonians, e.g. parity-time symmetric Hamiltonians, come in complex-conjugate pairs. We show that for non-Hermitian scattering Hamiltonians (of a structureless particle in one dimension)…

Quantum Physics · Physics 2019-05-22 M. A. Simón , A. Buendía , A. Kiely , Ali Mostafazadeh , J. G. Muga

Let $S$ be a set of $n$ points in the plane. We present several different algorithms for finding a pair of points in $S$ such that any disk that contains that pair must contain at least $cn$ points of $S$, for some constant $c>0$. The first…

Computational Geometry · Computer Science 2026-01-29 Prosenjit Bose , Guillermo Esteban , Tyler Tuttle

Let M be a compact, connected symplectic 2n-dimensional manifold on which an(n-2)-dimensional torus T acts effectively and Hamiltonianly. Under the assumption that there is an effective complementary 2-torus acting on M with symplectic…

Symplectic Geometry · Mathematics 2012-07-06 Yi Lin , Álvaro Pelayo

To construct ternary "quaternions" following Hamilton we must introduce two "imaginary "units, $q_1$ and $q_2$ with propeties $q_1^n=1$ and $q_2^m=1$. The general is enough difficult, and we consider the $m=n=3$. This case gives us the…

Mathematical Physics · Physics 2010-06-30 Gennady Volkov

Extensions of the notions of polynomially and rationally convex hulls are introduced. Using these notions, a generalization of a result of Duval and Levenberg on polynomially convex hulls containing no analytic discs is presented. As a…

Complex Variables · Mathematics 2019-02-26 Alexander J. Izzo

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…

Combinatorics · Mathematics 2023-06-22 Gunnar Brinkmann , Thomas Tucker , Nico Van Cleemput

A binary Steinhaus triangle is a triangle of zeroes and ones that points down and with the same local rule as the Pascal triangle modulo 2. A binary Steinhaus triangle is said to be rotationally symmetric, horizontally symmetric or…

Discrete Mathematics · Computer Science 2022-04-20 Jonathan Chappelon

Suppose S is a planar set. Two points a,b in S 'see each other' via S if [a,b] is included in S . F. Valentine proved in 1957 that if S is closed, and if for every three points of S, at least two see each other via S, then S is a union of…

Combinatorics · Mathematics 2009-01-28 Noa Nitzan

Based on [1], we study the complexity of horizontality in each twistor space $\hat{E}_{\varepsilon}$ associated with an oriented vector bundle $E$ of rank $4$ with a positive-definite metric over the $2$-torus $T^2$, and obtain…

Differential Geometry · Mathematics 2026-01-26 Naoya Ando , Anri Yonezaki

We prove three results conjectured or stated by Chartrand, Fink and Zhang [European J. Combin {\bf 21} (2000) 181--189, Disc. Appl. Math. {\bf 116} (2002) 115--126, and pre-print of ``The hull number of an oriented graph'']. For a digraph…

Combinatorics · Mathematics 2007-05-23 Alastair Farrugia

An important question with a rich history is the extent to which the symplectic category is larger than the Kaehler category. Many interesting examples of non-Kaehler symplectic manifolds have been constructed. However, sufficiently large…

dg-ga · Mathematics 2008-02-03 Susan Tolman

We consider a compact hyperbolic tetrahedron of a general type. It is a convex hull of four points called vertices in the hyperbolic space $\mathbb{H}^3$. It can be determined by the set of six edge lengths up to isometry. For further…

Metric Geometry · Mathematics 2021-07-08 Nikolay Abrosimov , Bao Vuong

We provide a complete classification of six-dimensional symmetric toroidal orbifolds which yield N>=1 supersymmetry in 4D for the heterotic string. Our strategy is based on a classification of crystallographic space groups in six…

High Energy Physics - Theory · Physics 2015-10-19 Maximilian Fischer , Michael Ratz , Jesus Torrado , Patrick K. S. Vaudrevange

We prove that every tetrahedron T has a simple, closed quasigeodesic that passes through three vertices of T. Equivalently, every T has a face whose "exterior angles" are at most pi.

Metric Geometry · Mathematics 2022-02-10 Joseph O'Rourke

Let $D$ be a smooth divisor on a non singular surface $S$. We compute Betti numbers of the relative Hilbert scheme of points of $S$ relative to $D$. In the case of $\PP^2$ and a line in it, we give an explicit set of generators and…

Algebraic Geometry · Mathematics 2018-05-01 Iman Setayesh
‹ Prev 1 8 9 10 Next ›