English
Related papers

Related papers: Lattice Embedding of Heronian Simplices

200 papers

Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.

Mathematical Physics · Physics 2007-05-23 M. Lorente

We construct a torsion-free arithmetic lattice in $\mathrm{PGL}_2(\mathbb{F}_2(\!(t)\!))\times\mathrm{PGL}_2(\mathbb{F}_2(\!(t)\!))$ arising from a quaternion algebra over $\mathbb{F}_2(z)$. It is the fundamental group of a square complex…

Group Theory · Mathematics 2019-04-17 Nithi Rungtanapirom

Compactifications of the heterotic string on T^d are the simplest, yet rich enough playgrounds to uncover swampland ideas: the U(1)^{d+16} left-moving gauge symmetry gets enhanced at special points in moduli space only to certain groups. We…

High Energy Physics - Theory · Physics 2020-12-02 Anamaría Font , Bernardo Fraiman , Mariana Graña , Carmen A. Núñez , Héctor Parra De Freitas

The Orlik-Solomon algebra of a matroid can be considered as a quotient ring over the exterior algebra E. At first we study homological properties of E-modules as e.g. complexity, depth and regularity. In particular, we consider modules with…

Combinatorics · Mathematics 2021-05-18 Gesa Kaempf , Tim Roemer

We show that the problem of deciding whether a given Euclidean lattice L has an orthonormal basis is in NP and co-NP. Since this is equivalent to saying that L is isomorphic to the standard integer lattice, this problem is a special form of…

Discrete Mathematics · Computer Science 2019-10-10 Christoph Hunkenschröder

Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementation of geometric algorithms. If the adoption of the --exact…

Computational Geometry · Computer Science 2007-05-23 Olivier Devillers , Philippe Guigue

Hodge classes on the moduli space of admissible covers with monodromy group G are associated to irreducible representations of G. We evaluate all linear Hodge integrals over moduli spaces of admissible covers with abelian monodromy in terms…

Algebraic Geometry · Mathematics 2012-09-28 P. Johnson , R. Pandharipande , H. -H. Tseng

We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…

Information Theory · Computer Science 2020-11-23 Hugues Randriambololona

We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…

Combinatorics · Mathematics 2024-10-23 Martin Bohnert , Justus Springer

We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…

Metric Geometry · Mathematics 2013-02-21 Manuel Joseph C. Loquias , Peter Zeiner

We suggest a way to associate to a rational map of the Riemann sphere a three dimensional object called a hyperbolic orbifold 3-lamination. The relation of this object to the map is analogous to the relation of a hyperbolic 3-manifold to a…

Dynamical Systems · Mathematics 2016-09-06 Mikhail Lyubich , Yair Minsky

We prove that the set of quadratic growths achievable by integer superharmonic functions on the $F$-lattice, a periodic subgraph of the square lattice with oriented edges, has the structure of an overlapping circle packing. The proof…

Analysis of PDEs · Mathematics 2023-11-07 Ahmed Bou-Rabee

A canonical minimal free resolution of an arbitrary co-artinian lattice ideal over the polynomial ring is constructed over any field whose characteristic is 0 or any but finitely many positive primes. The differential has a closed-form…

Commutative Algebra · Mathematics 2024-10-10 Yupeng Li , Ezra Miller , Erika Ordog

In the design and analysis of composite materials based on periodic arrangements of sub-units it is of paramount importance to control the emergent material symmetry in relation to the elastic response. The target material symmetry plays…

Mathematical Physics · Physics 2023-06-27 Giulio G. Giusteri , Raimondo Penta

We study the gauge fixing of lattice QCD in 2+1 dimensions, in the Hamiltonian formulation. The technique easily generalizes to other theories and dimensions. The Hamiltonian is rewritten in terms of variables which are gauge invariant…

High Energy Physics - Lattice · Physics 2009-10-22 J. B. Bronzan , Timothy E. Vaughan

The geodesic complexity of a length space $X$ quantifies the required number of case distinctions to continuously choose a shortest path connecting any given start and end point. We prove a local lower bound for the geodesic complexity of…

Metric Geometry · Mathematics 2025-09-12 Florian Frick , Pranav Rajbhandari

We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…

Functional Analysis · Mathematics 2021-02-05 Albrecht Boettcher , Lenny Fukshansky , Stephan Ramon Garcia , Hiren Maharaj , Deanna Needell

Properties of Hermitian forms are used to investigate several natural questions from CR Geometry. To each Hermitian symmetric polynomial we assign a Hermitian form. We study how the signature pairs of two Hermitian forms behave under the…

Complex Variables · Mathematics 2011-10-20 John P. D'Angelo , Jiri Lebl

The study of embeddings of smooth manifolds into Euclidean and projective spaces has been for a long time an important area in topology. In this paper we obtain improvements of classical results on embeddings of smooth manifolds, focusing…

Algebraic Topology · Mathematics 2015-06-16 Victor Buchstaber , Andrey Kustarev

We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer lattice Z^d.

Data Structures and Algorithms · Computer Science 2007-05-23 David Eppstein