English
Related papers

Related papers: On Covering Simplices by Dilations in Dimensions 3…

200 papers

A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…

Number Theory · Mathematics 2019-06-25 Michael Baake , Rudolf Scharlau , Peter Zeiner

Let $K$ be a convex body in $\mathbb{R}^n$, let $L$ be a lattice with covolume one, and let $\eta>0$. We say that $K$ and $L$ form an $\eta$-smooth cover if each point $x \in \mathbb{R}^n$ is covered by $(1 \pm \eta) vol(K)$ translates of…

Number Theory · Mathematics 2023-11-09 Or Ordentlich , Oded Regev , Barak Weiss

This paper uses results on the classification of minimal triangulations of 3-manifolds to produce additional results, using covering spaces. Using previous work on minimal triangulations of lens spaces, it is shown that the lens space…

Geometric Topology · Mathematics 2014-10-01 William Jaco , J. Hyam Rubinstein , Stephan Tillmann

We study symplectic geometry of rationally connected $3$-folds. The first result shows that rationally connectedness is a symplectic deformation invariant in dimension $3$. If a rationally connected $3$-fold $X$ is Fano or $b_2(X)=2$, we…

Algebraic Geometry · Mathematics 2019-12-19 Zhiyu Tian

For a large class of tilings, including the Penrose tiling in two dimension as well as the icosahedral ones in 3 dimension, the continuous hull of such a tiling inherits a minimal lamination structure with flat leaves and a transversal…

Dynamical Systems · Mathematics 2007-05-23 Jean Bellissard , Riccardo Benedetti , Jean-Marc Gambaudo

In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…

Optimization and Control · Mathematics 2017-05-01 Arnaud Vandaele , Nicolas Gillis , François Glineur

We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…

Combinatorics · Mathematics 2024-09-25 Volker Kaibel , Kirill Kukharenko

Several results in recent years have shown that the usual generalizations of taut foliations to higher dimensions, based only on topological concepts, lead to a theory that lacks the complexity of its 3-dimensional counterpart. Instead, we…

Symplectic Geometry · Mathematics 2025-01-08 Fabio Gironella , Klaus Niederkrüger , Lauran Toussaint

We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…

Logic · Mathematics 2021-01-20 Christian Herrmann

In this article we conjecture a 4-dimensional characterization of tightness: a contact structure is tight if and only if a slice-Bennequin inequality holds for smoothly embedded surfaces in Yx[0,1]. An affirmative answer to our conjecture…

Geometric Topology · Mathematics 2021-08-10 Matthew Hedden , Katherine Raoux

We study a harmonic triangular lattice, which relaxes in the presence of a weak, short-wavelength periodic potential. Monte Carlo simulations reveal that the elastic lattice has only short-ranged positional correlations, despite the absence…

Condensed Matter · Physics 2007-05-23 Ronald Dickman , Eugene M. Chudnovsky

If $L$ is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex $\Delta(L)$ (definition recalled). Lattice-theoretically, the resulting object is a subdirect…

Rings and Algebras · Mathematics 2017-02-08 George M. Bergman

In this paper we show that the diameter of a d-dimensional lattice polytope in [0,k]^n is at most (k - 1/2) d. This result implies that the diameter of a d-dimensional half-integral polytope is at most 3/2 d. We also show that for…

Computational Geometry · Computer Science 2015-12-25 Alberto Del Pia , Carla Michini

We investigate small covers and quasitoric over the duals of neighborly simplicial polytopes with small number of vertices in dimensions $4$, $5$, $6$ and $7$. In the most of the considered cases we obtain the complete classification of…

Algebraic Topology · Mathematics 2017-04-21 Djordje Baralic , Lazar Milenkovic

A collection of n distinct hyperplanes L_i ={l_i=0} in P^{n-1}, the n-1-dimensional projective space over an algebraically closed field of characteristic not equal to 2, is a polar simplex of a quadric Q={q=0}, if each L_i is the polar…

Algebraic Geometry · Mathematics 2012-04-26 Kristian Ranestad , Frank-Olaf Schreyer

We present a Monte Carlo algorithm that provides efficient and unbiased sampling of polymer melts consisting of two chains of equal length that jointly visit all the sites of a cubic lattice with rod geometry L x L x rL and non-periodic…

Statistical Mechanics · Physics 2010-11-03 Jesper Lykke Jacobsen

In this paper we show that the spectrum of the Q-codegree of a d-dimensional lattice polytope is finite above any positive threshold in the class of lattice polytopes with \alpha-canonical normal fan for any fixed \alpha>0. For \alpha=1/r…

Combinatorics · Mathematics 2013-01-22 Andreas Paffenholz

We study symplectic structures on four-dimensional small covers. Our main result shows that every symplectic four-dimensional small cover is aspherical. We then classify symplectic small covers over products of two polygons, proving that…

Symplectic Geometry · Mathematics 2026-05-06 Suyoung Choi

This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…

Optimization and Control · Mathematics 2026-02-11 Khalil Ghorbal , Christelle Kozaily

We prove that up to automorphisms a line admits a unique embedding into the regular part of of a simplicial toric variety of dimension n>=4 over an algebraically closed field of characteristic zero which is smooth in codimension 2.

Algebraic Geometry · Mathematics 2022-07-20 Shulim Kaliman
‹ Prev 1 3 4 5 6 7 10 Next ›