English
Related papers

Related papers: The cyclicity rank of empty lattice simplices

200 papers

A hyperbolic lattice is called \textit{$1.2$-reflective} if the subgroup of its automorphism group generated by all $1$- and $2$-reflections is of finite index. The main result of this article is a complete classification of…

Algebraic Geometry · Mathematics 2017-06-07 Nikolay V. Bogachev

Algebraic lattices are those obtained from modules in the ring of integers of algebraic number fields through the canonical or twisted embeddings. In turn, well-rounded lattices are those with maximal cardinality of linearly independent…

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

A weaker form of a 1979 conjecture of Goldfeld states that for every elliptic curve $E/\mathbb{Q}$, a positive proportion of its quadratic twists $E^{(d)}$ have rank 1. Using tools from Galois cohomology, we give criteria on E and d which…

Number Theory · Mathematics 2014-02-05 Zane Kun Li

We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…

Computational Geometry · Computer Science 2020-01-28 Salman Parsa

We prove that the dimension of a quartic symmetroid singular along a quadric of codimension 1 is at most 4, if it is not a cone. In the maximal case, the quadric is reducible and consists of rank-3-points. If the quadric is irreducible, it…

Algebraic Geometry · Mathematics 2019-05-06 Martin Helsø

Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…

Probability · Mathematics 2016-09-07 Sreela Gangopadhyay , Rahul Roy , Anish Sarkar

We consider the generating series of special cycles on $\mathcal{A}_1(N)\times \mathcal{A}_g(N)$, with full level $N$ structure, valued in the cohomology of degree $2g$. The modularity theorem of Kudla-Millson for locally symmetric spaces…

Algebraic Geometry · Mathematics 2025-06-24 François Greer , Carl Lian , Naomi Sweeting

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

This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least $2k$ vertices is {\it $k$-linked} if, for every set of $2k$ distinct vertices organised in arbitrary $k$ pairs of vertices, there…

Combinatorics · Mathematics 2020-12-11 Leif K. Jorgensen , Guillermo Pineda-Villavicencio , Julien Ugon

For an integral convex polytope $\Pc \subset \RR^N$ of dimension $d$, we call $\delta(\Pc)=(\delta_0, \delta_1,..., \delta_d)$ the $\delta$-vector of $\Pc$ and $\vol(\Pc)=\sum_{i=0}^d\delta_i$ its normalized volume. In this paper, we will…

Combinatorics · Mathematics 2012-10-12 Akihiro Higashitani

We study certain lattices constructed from finite abelian groups. We show that such a lattice is eutactic, thereby confirming a conjecture by B\"ottcher, Eisenbarth, Fukshansky, Garcia, Maharaj. Our methods also yield simpler proofs of two…

Number Theory · Mathematics 2023-05-04 Frieder Ladisch

One can define a random walk on a hypercubic lattice in a space of integer dimension $D$. For such a process formulas can be derived that express the probability of certain events, such as the chance of returning to the origin after a given…

High Energy Physics - Lattice · Physics 2009-10-22 Carl M. Bender , Stefan Boettcher , Lawrence R. Mead

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

The optimal lattice quantizer is the lattice which minimizes the (dimensionless) second moment $G$. In dimensions $1$ to $8$, it has been proven that the optimal lattice quantizer is one of the classical lattices, or there is good evidence…

Mathematical Physics · Physics 2021-10-27 Bruce Allen , Erik Agrell

We give a short proof of the fact that there are no measurable subsets of Euclidean space (in dimension d > 2), which, no matter how translated and rotated, always contain exactly one integer lattice point. In dimension d=2 (the original…

Classical Analysis and ODEs · Mathematics 2007-05-23 Mihail N. Kolountzakis , Michael Papadimitrakis

D-theory provides an alternative lattice regularization of the (1+1)-d CP(N-1) quantum field theory. In this formulation the continuous classical CP(N-1) fields emerge from the dimensional reduction of discrete SU(N) quantum spins. In…

High Energy Physics - Lattice · Physics 2009-11-10 B. B. Beard , M. Pepe , S. Riederer , U. J. Wiese

We consider the approximate recovery of multivariate periodic functions from a discrete set of function values taken on a rank-$s$ integration lattice. The main result is the fact that any (non-)linear reconstruction algorithm taking…

Numerical Analysis · Mathematics 2016-08-02 Glenn Byrenheid , Lutz Kämmerer , Tino Ullrich , Toni Volkmer

We introduce and study the concept of cyclicity degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be cyclic. Explicit formulas are obtained for some particular classes of finite groups. An…

Group Theory · Mathematics 2015-04-08 Marius Tărnăuceanu , László Tóth

Given a lattice L in Z^m and a subset A of R^m, we say that a point in A is lonely if it is not equivalent modulo L to another point of A. We are interested in identifying lonely points for specific choices of L when A is a dilated standard…

Symbolic Computation · Computer Science 2019-05-22 Maximilian Jaroschek , Manuel Kauers , Laura Kovacs