English
Related papers

Related papers: The complete classification of empty lattice $4$-s…

200 papers

In the present article, we provide examples of fake quadrics, that is, minimal complex surfaces of general type with the same numerical invariants as the smooth quadric in $\PP ^3$ which are quotients of the bidisc by an irreducible lattice…

Algebraic Geometry · Mathematics 2013-05-23 Amir Džambić

The classical monomer-dimer model in two-dimensional lattices has been shown to belong to the \emph{``#P-complete''} class, which indicates the problem is computationally ``intractable''. We use exact computational method to investigate the…

Statistical Mechanics · Physics 2024-05-03 Yong Kong

The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…

Combinatorics · Mathematics 2025-03-24 Yan-Ting Xie , Shou-Jun Xu

We prove that any mapping torus of a closed 3-manifold has zero simplicial volume. When the fiber is a prime 3-manifold, classification results can be applied to show vanishing of the simplicial volume, however the case of reducible fibers…

Geometric Topology · Mathematics 2020-08-04 Michelle Bucher , Christoforos Neofytidis

For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $\sqrt{s}\cdot L$ is isometric to a sublattice of $\mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$…

Number Theory · Mathematics 2021-04-12 Qianqian Yang , Kiyoto Yoshino

We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…

Combinatorics · Mathematics 2024-11-21 Kassahun H Betre , Yan X Zhang , Carter Edmond

In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…

Number Theory · Mathematics 2016-08-23 Nikolai Bliznyakov , Stanislav Kondratyev

We present a geometric approach towards derandomizing the Isolation Lemma by Mulmuley, Vazirani, and Vazirani. In particular, our approach produces a quasi-polynomial family of weights, where each weight is an integer and quasi-polynomially…

Data Structures and Algorithms · Computer Science 2018-05-08 Rohit Gurjar , Thomas Thierauf , Nisheeth K. Vishnoi

In this article, we study the fundamental groups of low-dimensional log canonical singularities, i.e., log canonical singularities of dimension at most $4$. In dimension $2$, we show that the fundamental group of an lc singularity is a…

Algebraic Geometry · Mathematics 2023-02-24 Fernando Figueroa , Joaquín Moraga

We present a non-singular instanton describing the creation of an open universe with a compactified extra dimension. The four dimensional section of this solution is a singular instanton of the type introduced by Hawking and Turok. The…

High Energy Physics - Theory · Physics 2007-05-23 Jaume Garriga

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…

Combinatorics · Mathematics 2009-01-13 Jaron Treutlein

I investigate a discrete model of quantum gravity on a causal null-lattice with \SLC structure group. The description is geometric and foliates in a causal and physically transparent manner. The general observables of this model are…

General Relativity and Quantum Cosmology · Physics 2023-04-04 Martin Schaden

Satisfiability solving has been used to tackle a range of long-standing open math problems in recent years. We add another success by solving a geometry problem that originated a century ago. In the 1930s, Esther Klein's exploration of…

Computational Geometry · Computer Science 2024-03-04 Marijn J. H. Heule , Manfred Scheucher

We study upper bounds on the number of lattice points for convex bodies having their centroid at the origin. For the family of simplices as well as in the planar case we obtain best possible results. For arbitrary convex bodies we provide…

Metric Geometry · Mathematics 2015-05-26 Sören Lennart Berg , Martin Henk

We consider three uniqueness theorems: one from the theory of meromorphic functions, another one from asymptotic combinatorics, and the third one about representations of the infinite symmetric group. The first theorem establishes the…

Functional Analysis · Mathematics 2018-12-18 A. Vershik

We study the local symplectic algebra of the 0-dimensional isolated complete intersection singularities. We use the method of algebraic restrictions to classify these symplectic singularities. We show that there are non-trivial symplectic…

Symplectic Geometry · Mathematics 2012-11-07 Wojciech Domitrz

The investigation of the relation among the distances of an arbitrary point in the Euclidean space $\mathbb{R}^n$ to the vertices of a regular $n$-simplex in that space has led us to the study of simplices having a regular facet. Calling an…

Metric Geometry · Mathematics 2017-02-01 Mowaffaq Hajja , Mostafa Hayajneh , Ismail Hammoudeh

The set of all $\ell$-zero-sumfree subsets of $\mathbb{Z}/n\mathbb{Z}$ is a simplicial complex denoted by $\Delta_{n,\ell}$ We create an algorithm via defining a set of integer partitions we call $(n,\ell)$-congruent partitions in order to…

Combinatorics · Mathematics 2019-06-26 Ashleigh Adams , Carole Hall , Eric Stucky

We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and…

Combinatorics · Mathematics 2025-10-09 Isabella Novik , Hailun Zheng

In this paper we show that if a compact set $E \subset \mathbb{R}^d$, $d \geq 3$, has Hausdorff dimension greater than $\frac{(4k-1)}{4k}d+\frac{1}{4}$ when $3 \leq d<\frac{k(k+3)}{(k-1)}$ or $d- \frac{1}{k-1}$ when $\frac{k(k+3)}{(k-1)}…

Classical Analysis and ODEs · Mathematics 2024-07-24 Eyvindur Ari Palsson , Francisco Romero Acosta