English
Related papers

Related papers: Lattice simplices of maximal dimension with a give…

200 papers

In this article, we will show the existence of lattice packings in a sparse family of dimensions. This construction will be a generalisation of Venkatesh's lattice packing result. In our construction, we replace the appearance of the…

Number Theory · Mathematics 2021-09-28 Nihar Prakash Gargava

For a class of nonnegative, range-1 pair potentials in one dimensional continuous space we prove that any classical ground state of lower density >=1 is a tower-lattice, i.e., a lattice formed by towers of particles the heights of which can…

Mathematical Physics · Physics 2011-07-21 Andras Suto

We show how to derive Catterall's supersymmetric lattice gauge theories directly from the general principle of orbifolding followed by a variant of the usual deconstruction. These theories are forced to be complexified due to a clash…

High Energy Physics - Lattice · Physics 2008-11-26 Poul H. Damgaard , So Matsuura

We introduce a pointfree theory of convergence on lattices and coframes. A convergence lattice is a lattice $L$ with a monotonic map $\lim_L$ from the lattice of filters on $L$ to $L$, meant to be an abstract version of the map sending…

General Topology · Mathematics 2021-01-13 Jean Goubault-Larrecq , Frédéric Mynard

A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…

Optimization and Control · Mathematics 2011-03-28 Gennadiy Averkov , Christian Wagner , Robert Weismantel

Let S be a distributive {∨, 0}-semilattice. In a previous paper, the second author proved the following result: Suppose that S is a lattice. Let K be a lattice, let $\phi$: Con K $\to$ S be a {∨, 0}-homomorphism. Then $\phi$ is,…

General Mathematics · Mathematics 2007-05-23 Jiri Tuma , Friedrich Wehrung

Lattice scalar field theories encounter a sign problem when the coupling constant is complex. This is a close cousin of the real-time sign problems that afflict the lattice Schwinger-Keldysh formalism, and a more distant relative of the…

High Energy Physics - Lattice · Physics 2022-12-28 Scott Lawrence , Hyunwoo Oh , Yukari Yamauchi

We propose a lattice action for two dimensional super Yang-Mills theory with a twisted N=2 supersymmetry. The extended supersymmetry is fully and exactly realized on the lattice. The method employed is quite general and its extension to the…

High Energy Physics - Lattice · Physics 2009-11-11 Alessandro D'Adda , Issaku Kanamori , Noboru Kawamoto , Kazuhiro Nagata

A lattice model for four dimensional Euclidean quantum general relativity is proposed for a simplicial spacetime. It is shown how this model can be expressed in terms of a sum over worldsheets of spin networks, and an interpretation of…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Michael P. Reisenberger

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

In this paper we study Zimmer's conjecture for $C^1$ actions of lattice subgroup of a higher-rank simple Lie group with finite center on compact manifolds. We show that when the rank of an uniform lattice is larger than the dimension of the…

Dynamical Systems · Mathematics 2022-06-10 Aaron Brown , Danijela Damjanovic , Zhiyuan Zhang

Supersymmetry plays prominent roles in the study of quantum field theory and in many proposals for potential new physics beyond the standard model. Lattice field theory provides a non-perturbative regularization suitable for strongly…

High Energy Physics - Lattice · Physics 2023-07-17 David Schaich

The so-called min-sum algorithm has been applied for decoding lattices constructed by Construction D'. We generalize this iterative decoding algorithm to decode lattices constructed by Construction D. An upper bound on the decoding…

Cryptography and Security · Computer Science 2012-01-20 Hassan Mehri

New series of $2^{2m}$-dimensional universally strongly perfect lattices $\Lambda_I $ and $\Gamma_J $ are constructed with $$2BW_{2m} ^{\#} \subseteq \Gamma _J \subseteq BW_{2m} \subseteq \Lambda _I \subseteq BW _{2m}^{\#} .$$ The lattices…

Number Theory · Mathematics 2021-11-15 Sihuang Hu , Gabriele Nebe

A method is proposed for latticizing a class of supersymmetric gauge theories, including N=4 super Yang-Mills. The technique is inspired by recent work on ``deconstruction''. Part of the target theory's supersymmetry is realized exactly on…

High Energy Physics - Lattice · Physics 2009-11-07 David B. Kaplan

Lattice discretization of the supersymmetric Yang-Mills quantum mechanics is dis cussed. First results of the quenched Monte Carlo simulations, for D=4 and with higher g auge groups (3 <= N <= 8), are presented. We confirm an earlier (N=2)…

High Energy Physics - Lattice · Physics 2017-08-23 P. Bialas , J. Wosiek

We prove a simplicity criterion for certain twin tree lattices. It applies to all rank two Kac-Moody groups over finite fields with non-trivial commutation relations, thereby yielding examples of simple non-uniform lattices in the product…

Group Theory · Mathematics 2012-09-25 Pierre-Emmanuel Caprace , Bertrand Remy

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

Recollements of derived module categories are investigated, using a new technique, ladders of recollements, which are mutation sequences. The position in the ladder is shown to control whether a recollement restricts from unbounded to…

Representation Theory · Mathematics 2016-09-29 Lidia Angeleri H\" ugel , Steffen Koenig , Qunhua Liu , Dong Yang

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…

Combinatorics · Mathematics 2008-12-16 Jun Ma , Yeong-Nan Yeh