Related papers: Lattice Size and Generalized Basis Reduction in Di…
A basic closed semialgebraic subset of $\mathbb{R}^{n}$ is defined by simultaneous polynomial inequalities $p_{1}\geq 0,\ldots,p_{m}\geq 0$. We consider Lasserre's relaxation hierarchy to solve the problem of minimizing a polynomial over…
We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…
In this paper, we continue our previous work on the reduction of algebraic lattices over imaginary quadratic fields for the special case when the lattice is spanned over a two dimensional basis. In particular, we show that the…
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…
A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point…
Inspired by natural cellular materials such as trabecular bone, lattice structures have been developed as a new type of lightweight material. In this paper we present a novel method to design lattice structures that conform with both the…
We reprove a theorem of Bunn, Grow, Insall, and Thiem, which asserts that a minimal congruence lattice representation for $\mathbb M_{p+1}$ has size $2p$, and is an expansion of a regular $D_{2p}$-set.
Finite-size criteria have emerged as an effective tool for deriving spectral gaps in higher-dimensional frustration-free quantum spin systems. We quantitatively improve the existing finite-size criteria by introducing a novel subsystem…
A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…
We report on the utility of using Shannons Sampling theorem to solve Quantum Mechanical systems. We show that by extending the logic of Shannons interpolation theorem we can define a Universal Lattice Basis, which has superior interpolating…
We propose a method to construct universal order parameters for quantum phase transitions in many-body lattice systems. The method exploits the $H$-orthogonality of a few near-degenerate lowest states of the Hamiltonian describing a given…
This article investigates phonons and elastic response in randomly diluted lattices constructed by combining (via the addition of next-nearest bonds) a twisted kagome lattice, with bulk modulus $B=0$ and shear modulus $G>0$, with either a…
Predicting protein secondary structure using lattice model is one of the most studied computational problem in bioinformatics. Here secondary structure or three dimensional structure of protein is predicted from its amino acid sequence.…
We propose that the LP-Newton method can be used to solve conic LPs over a conic box, whenever linear optimization over an otherwise unconstrained conic box is easy. In particular, if $\leq_\mathcal{K}$ is the partial order induced by a…
We develop a methodology for the computation of the $K\to \ell\nu_\ell \ell'^+ \ell'^-$ decay width using lattice QCD and present an exploratory study here. We use a scalar function method to account for the momentum dependence of the decay…
We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…
We introduce a framework generalizing lattice reduction algorithms to module lattices in order to practically and efficiently solve the $\gamma$-Hermite Module-SVP problem over arbitrary cyclotomic fields. The core idea is to exploit the…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
We address the problem of the gauge fixing versus Gribov copies in lattice gauge theories. For the Landau gauge, results show that a suitable combination of evolutionary algorithms with traditional steepest descent methods identifies the…
Given a lattice $L$, a basis $B$ of $L$ together with its dual $B^*$, the orthogonality measure $S(B)=\sum_i ||b_i||^2 ||b_i^*||^2$ of $B$ was introduced by M. Seysen in 1993. This measure is at the heart of the Seysen lattice reduction…