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

Recently it has been shown how a topologically twisted version of ${\cal N}=4$ super Yang-Mills may be discretized in such a way as to preserve one scalar supersymmetry at nonzero lattice spacing. The remaining fifteen supersymmetries are…

We define supersymmetric Yang-Mills theory on an arbitrary two-dimensional lattice (polygon decomposition) with preserving one supercharge. When a smooth Riemann surface $\Sigma_g$ with genus $g$ emerges as an appropriate continuum limit of…

We give two results concerning the power of the Sum-of-Squares(SoS)/Lasserre hierarchy. For binary polynomial optimization problems of degree $2d$ and an odd number of variables $n$, we prove that $\frac{n+2d-1}{2}$ levels of the…

We show how to construct lattice sigma models in one, two and four dimensions which exhibit an exact fermionic symmetry. These models are discretized and {\it twisted} versions of conventional supersymmetric sigma models with N=2…

For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…

In section 1 we give an improved lower bound on Hermite's constant $\delta_{2g}$ for symplectic lattices in even dimensions ($g=2n$) by applying a mean-value argument from the geometry of numbers to a subset of symmetric lattices. Here we…

We give a sharp upper bound on the multiplicity of a fake weighted projective space with at worst canonical singularities. This is equivalent to giving a sharp upper bound on the index of the sublattice generated by the vertices of a…

This paper develops in detail a lattice definition of QCD based on the chiral defect fermions recently introduced by Kaplan. The revised version provides missing technical details in the proof that non-singlet axial symmetries become exact…

Orders and fractional ideals in number fields provide interesting examples of lattices. We ask: what lattices arise from orders in number fields? We prove that all nontrivial multiplicative constraints on successive minima of orders come…

We give a new unified proof that any simple graph on $n$ vertices with maximum degree at most $\Delta$ has no more than $a\binom{\Delta+1}{t}+\binom{b}{t}$ cliques of size $t \ (t \ge 3)$, where $n = a(\Delta+1)+b \ (0 \le b \le \Delta)$.

We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…

Supersymmetry, like Poincare symmetry, is softly broken at finite lattice spacing provided the gaugino mass term is strongly suppressed. Domain wall fermions provide the mechanism for suppressing this term by approximately imposing chiral…

The Congruence Lattice Problem (CLP), stated by R. P. Dilworth in the forties, asks whether every distributive {∨, 0}-semilatticeS is isomorphic to the semilattice Conc L of compact congruences of a lattice L. While this problem is…

We call a CNF formula linear if any two clauses have at most one variable in common. Let m(k) be the largest integer m such that any linear k-CNF formula with <= m clauses is satisfiable. We show that 4^k / (4e^2k^3) <= m(k) < ln(2) k^4…

Various embedding problems of lattices into complete lattices are solved. We prove that for any join-semilattice S with the minimal join-cover refinement property, the ideal lattice IdS of S is both algebraic and dually algebraic.…

Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study of local testing for membership in lattices. Testing…

I review recent approaches to constructing supersymmetric lattice theories focusing in particular on the concept of topological twisting. The latter technique is shown to expose a nilpotent, scalar supersymmetry which can be implemented…

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…

There exist numerous results in the literature proving that within certain families of totally real number fields, the minimal rank of a universal quadratic lattice over such a field can be arbitrarily large. Kala introduced a technique of…

We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…