Related papers: On tight spherical designs

We present an analytical method for determining the designability of protein structures. We apply our method to the case of two-dimensional lattice structures, and give a systematic solution for the spectrum of any structure. Using this…

We introduce two classes of discrete polynomials and construct discrete equations admitting a Lax representation in terms of these polynomials. Also we give an approach which allows to construct lattice integrable hierarchies in its…

In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…

In this paper, we derive simple closed-form expressions for the $n$-queens problem and three related problems in terms of permanents of $(0,1)$ matrices. These formulas are the first of their kind. Moreover, they provide the first method…

We characterize the generating function of the number of representations described in the title in terms of the theory of modular forms. Appealing to this characterization we obtain explicit formulas for the representation numbers as…

Given a non-empty genus in $n$ dimensions with determinant $d$, we give a randomized algorithm that outputs a quadratic form from this genus. The time complexity of the algorithm is poly$(n,\log d)$; assuming Generalized Riemann Hypothesis…

A non-perturbative algebraic theory of lattice Boltzmann method is developed based on a symmetry of a product. It involves three steps: (i) Derivation of admissible lattices in one spatial dimension through a matching condition which…

I derive a formulation of the 2-dimensional critical Ising model on non-uniform simplicial lattices. Surprisingly, the derivation leads to a set of geometric constraints that a lattice must satisfy in order for the model to have a…

In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.

We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…

Let $T(n)$ denote the maximum number of unit distances that a set of $n$ points in the Euclidean plane $\mathbb{R}^2$ can determine with the additional condition that the distinct unit length directions determined by the configuration must…

I review some of the things we have learned about large N gauge theories (and QCD at N=oo) from lattice calculations in recent years. I point to some open problems.

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

We prove sharp upper bounds on the volume and the number of lattice points on edges of higher-dimensional reflexive simplices. These convex-geometric results are derived from new number-theoretic bounds on the denominators of unit fractions…

We study and simulate N=2 supersymmetric Wess-Zumino models in one and two dimensions. For any choice of the lattice derivative, the theories can be made manifestly supersymmetric by adding appropriate improvement terms corresponding to…

We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…

I will review recent progress on addressing large N gauge theories on the lattice. The focus will be put on the use of large N volume independence as an effective tool to compute non-perturbative dynamics at, otherwise unreachable, large…

Let $A$ be an Artin algebra. We investigate subalgebras of $A$ with certain conditions and obtain some classes of algebras whose finitistic dimensions are finite.

We give a deterministic 2^{O(n)} algorithm for computing an M-ellipsoid of a convex body, matching a known lower bound. This has several interesting consequences including improved deterministic algorithms for volume estimation of convex…

Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive…