English
Related papers

Related papers: The Shadow Theory of Modular and Unimodular Lattic…

200 papers

The symmetric difference in Boolean lattices can be defined in two different but equivalent forms. However, it can be introduced also in every bounded lattice with complementation where these two forms need not coincide. We study lattices…

Rings and Algebras · Mathematics 2025-06-26 Václav Cenker , Ivan Chajda , Helmut Länger

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

Metric Geometry · Mathematics 2025-03-31 Lenny Fukshansky

In a recent paper, we have reported a universal power law for both site and bond percolation thresholds in any Bravais lattice with q equivalent nearest neighbors in dimension d. We now extend it to three different classes of lattices which…

Disordered Systems and Neural Networks · Physics 2009-10-30 Serge Galam , Alain Mauger

We introduce mutually unbiased complex Hadamard (MUCH) matrices and show that the number of MUCH matrices of order 2n, n odd, is at most 2 and the bound is attained for n = 1,5,9. Furthermore, we prove that certain pairs of mutually…

Combinatorics · Mathematics 2012-09-20 Darcy Best , Hadi Kharaghani

The diameter of the graph of a $d$-dimensional lattice polytope $P \subseteq [0,k]^{n}$ is known to be at most $dk$ due to work by Kleinschmidt and Onn. However, it is an open question whether the monotone diameter, the shortest guaranteed…

Optimization and Control · Mathematics 2022-04-21 Alexander E. Black

We consider minimizing harmonic maps $u$ from $\Omega \subset \mathbb{R}^n$ into a closed Riemannian manifold $\mathcal{N}$ and prove: (1) an extension to $n \geq 4$ of Almgren and Lieb's linear law. That is, if the fundamental group of the…

Analysis of PDEs · Mathematics 2021-02-15 Katarzyna Mazowiecka , Michał Miśkiewicz , Armin Schikorra

We extend Smale's singular bridge principle [Ann. of Math. 130 (1989), 603-642] for $n$-dimensional strictly stable minimal cones in $\mathbb{R}^{n+1}$ $(n \geq 7$) to arbitrary codimension and each $n \geq 3$. We then apply the procedure…

Differential Geometry · Mathematics 2025-03-10 Bryan Dimler

We report recent results and developments from our ongoing lattice studies of $\mathcal N = 4$ supersymmetric Yang--Mills theory. These include a proof that only a single fine-tuning needs to be performed, so long as the moduli space is not…

High Energy Physics - Lattice · Physics 2018-05-16 Simon Catterall , Joel Giedt , David Schaich , Poul H. Damgaard , Thomas DeGrand

Let $c_n = c_n(d)$ denote the number of self-avoiding walks of length $n$ starting at the origin in the Euclidean nearest-neighbour lattice $\mathbb{Z}^d$. Let $\mu = \lim_n c_n^{1/n}$ denote the connective constant of $\mathbb{Z}^d$. In…

Probability · Mathematics 2021-12-17 Hugo Duminil-Copin , Shirshendu Ganguly , Alan Hammond , Ioan Manolescu

We obtain new upper bounds on the minimal density of lattice coverings of Euclidean space by dilates of a convex body K. We also obtain bounds on the probability (with respect to the natural Haar-Siegel measure on the space of lattices)…

Number Theory · Mathematics 2020-06-03 Or Ordentlich , Oded Regev , Barak Weiss

We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we…

Functional Analysis · Mathematics 2007-05-23 Vladimir Nikiforov

Rigid frameworks in some Euclidian space are embedded graphs having a unique local realization (up to Euclidian motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings…

Metric Geometry · Mathematics 2007-05-23 Ciprian Borcea , Ileana Streinu

In this paper we use techniques from convex projective geometry to produce many new examples of thin subgroups of lattices in special linear groups that are isomorphic to the fundamental groups of finite volume hyperbolic manifolds. More…

Geometric Topology · Mathematics 2020-07-29 Samuel Ballas , D. D. Long

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

Combinatorics · Mathematics 2023-10-24 Herbert Edelsbrunner , János Pach

We propose some analogue of the Narain lattice for CHL string. The symmetries of this lattice are the symmetries of the perturbative spectrum. We explain in this language the known results about the possible gauge groups in compactified…

High Energy Physics - Theory · Physics 2009-10-31 Andrei Mikhailov

Function field lattices are an interesting example of algebraically constructed lattices. Their minimum distance is bounded below by a function of the gonality of the underlying function field. Known explicit examples--coming mostly from…

Algebraic Geometry · Mathematics 2025-11-26 Rafael Froner Prando , Pietro Speziali

The existence of unimodular forms with small norms on sequence spaces is crucial in a variety of problems in modern analysis. We prove that the infimum of $\left\Vert A\right\Vert $ over all unimodular $d$-linear (complex or real) forms $A$…

Functional Analysis · Mathematics 2019-12-16 Nacib Gurgel Albuquerque , Lisiane Rezende

The theory of Monotone Comparative Statics (MCS) has traditionally required a lattice structure, excluding certain multidimensional environments such as mixed-strategy games where this property fails. We show that this structure is not…

Theoretical Economics · Economics 2026-03-06 Yeon-Koo Che , Jinwoo Kim , Fuhito Kojima

The moduli space of rank-n commutative algebras equipped with an ordered basis is an affine scheme B_n of finite type over Z, with geometrically connected fibers. It is smooth if and only if n <= 3. It is reducible if n >= 8 (and the…

Algebraic Geometry · Mathematics 2017-04-03 Bjorn Poonen

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…

Computational Complexity · Computer Science 2017-11-29 Makrand Sinha