English
Related papers

Related papers: Lattice Embedding of Heronian Simplices

200 papers

Rational homology ellipsoids are certain Liouville domains diffeomorphic to rational homology balls and having Lagrangian pin-wheels as their skeleta. From the point of view of almost toric fibrations, they are a natural generalisation of…

Symplectic Geometry · Mathematics 2025-12-05 Nikolas Adaloglou , Joé Brendel , Jonny Evans , Johannes Hauber , Felix Schlenk

The family of Euclidean triangles having some fixed perimeter and area can be identified with a subset of points on a nonsingular cubic plane curve, i.e., an elliptic curve; furthermore, if the perimeter and the square of the area are…

Number Theory · Mathematics 2015-05-13 Nicolas Brody , Jordan Schettler

Representing lattices L by equivalence relations amounts to embed them into the lattice Part(V) of all partitions of a set V, and has a long history. Here we are concerned with MODULAR lattices L and aim for sets V as small as possible,…

Combinatorics · Mathematics 2018-10-16 Marcel Wild

A rational triangle $T$ (one whose angles are rational multiples of $\pi$) unfolds to a translation surface $(X_T,\omega_T)$. The lattice triangle problem asks to classify those $T$ for which $(X_T,\omega_T)$ is a Veech (lattice) surface,…

Dynamical Systems · Mathematics 2026-03-26 David Kurniadi Angdinata , Evan Chen , Ken Ono , Jiaxin Zhang , Jujian Zhang

Triangles with integer length sides and integer area are known as Heron triangles. Taking rescaling freedom into account, one can apply the same name when all sides and the area are rational numbers. A perfect triangle is a Heron triangle…

Number Theory · Mathematics 2022-09-20 Andrew N. W. Hone

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…

Combinatorics · Mathematics 2023-06-06 Yixi Liao , Erxiao Wang

In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in $\mathbb{R}^3$ up to similarity…

Metric Geometry · Mathematics 2017-03-10 Maria Hempel

A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…

Optimization and Control · Mathematics 2011-03-28 Gennadiy Averkov , Christian Wagner , Robert Weismantel

This paper investigated the problem of embedding a simple Hamiltonian Cycle with n vertices on n points inside a simple polygon. This problem seeks to embed a straight-line cycle (without bends), which does not intersect either itself or…

Computational Geometry · Computer Science 2022-08-22 Maryam Fadavian , Heidar Fadavian

Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Geometric lattice has widely used in diverse fields, especially search algorithm design which plays important role…

Artificial Intelligence · Computer Science 2012-10-02 Aiping Huang , William Zhu

We consider two-dimensional lattice equations defined on an elementary square of the Cartesian lattice and depending on the variables at the corners of the quadrilateral. For such equations the property often associated with integrability…

Exactly Solvable and Integrable Systems · Physics 2019-03-12 Jarmo Hietarinta

A new approach is presented to explore the singularity structure of lattice QCD at imaginary chemical potential. Our method can be seen as a combination of the Taylor expansion and analytic continuation approaches. Its novelty lies in using…

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

Combinatorics · Mathematics 2020-01-15 James Davies , Carsten Thomassen

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

Combinatorics · Mathematics 2011-11-10 W. M. B. Dukes

Cao & Yuan obtained a Blichfeldt-type result for the vertex set of the edge-to-edge tiling of the plane by regular hexagons. Observing that every Archimedean tiling is the union of translates of a fixed lattice, we take a more general…

Combinatorics · Mathematics 2017-10-10 Matthias Schymura , Liping Yuan

Let $(X,o)$ be a complex analytic normal surface singularity with rational homology sphere link $M$. The `topological' lattice cohomology ${\mathbb H}^*=\oplus_{q\geq 0} {\mathbb H}^q$ associated with $M$ and with any of its spin$^c$…

Algebraic Geometry · Mathematics 2023-08-01 András Némethi

For real projective spaces, (a) the Euclidean immersion dimension, (b) the existence of axial maps, and (c) the topological complexity are known to be three facets of the same problem. But when it comes to embedding dimension, the classical…

Algebraic Topology · Mathematics 2014-10-01 Jesus Gonzalez , Peter Landweber

We review the regular tilings of d-sphere, Euclidean d-space, hyperbolic d-space and Coxeter's regular hyperbolic honeycombs (with infinite or star-shaped cells or vertex figures) with respect of possible embedding, isometric up to a scale,…

Metric Geometry · Mathematics 2007-05-23 M. Deza , M. I. Shtogrin

Using Legendrian immersions and, in particular, Legendre curves in odd dimensional spheres and anti De Sitter spaces, we provide a method of construction of new examples of Hamiltonian-minimal Lagrangian submanifolds in complex projective…

Differential Geometry · Mathematics 2012-12-04 Ildefonso Castro , Haizhong Li , Francisco Urbano

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

Complex Variables · Mathematics 2020-09-29 Purvi Gupta , Rasul Shafikov