Related papers: Recurrent Theme of Pick's Theorem
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine…
By trapping cold polarizable atoms in periodic potentials created by crossed laser beams, it is now possible to experimentally create "clean" lattice systems. Experimentalists have successfully engineered local and nearest-neighbor…
The classical Dirichlet problem for a second-order strongly elliptic system with constant coefficients in a Jordan domain is considered. We show that the solution of the problem can be represented as a functional series in powers of the…
Enumerating polygons on regular lattices is a classic problem in rigorous statistical mechanics. The goal of enumerating polygons on the square lattice via fermionic path integration was achieved using a free-fermion quadratic action in the…
Minkowski's second theorem on successive minima asserts that the volume of a 0-symmetric convex body K over the covolume of a lattice \Lambda can be bounded above by a quantity involving all the successive minima of K with respect to…
A lattice gauge theory with an action polynomial in independent field variables is considered. The link variables are described by unconstrained complex matrices instead of unitary ones. A mechanism which permits to switch off in the…
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…
The search for a mathematical foundation for the path integral of Euclidean quantum gravity calls for the construction of random geometry on the spacetime manifold. Following developments in physics on the two-dimensional theory, random…
Capacities on a finite set are sets functions vanishing on the empty set and being monotonic w.r.t. inclusion. Since the set of capacities is an order polytope, the problem of randomly generating capacities amounts to generating all linear…
A formalism of arithmetic partial differential equations (PDEs) is being developed in which one considers several arithmetic differentiations at one fixed prime. In this theory solutions can be defined in algebraically closed p-adic fields.…
We explore the mathematical consequences of the assumption of a discrete space-time. The fundamental laws of physics have to be translated into the language of discrete mathematics. We find integral transformations that leave the lattice of…
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…
The direct application of the definition of sorting in lattices is impractical because it leads to an algorithm with exponential complexity. In this paper we present for distributive lattices a recursive formulation to compute the sort of a…
We describe a Schubert induction theorem, a tool for analyzing intersections on a Grassmannian over an arbitrary base ring. The key ingredient in the proof is the Geometric Littlewood-Richardson rule, described in a companion paper.…
The Johnson-Lindenstrauss Lemma states that there exist linear maps that project a set of points of a vector space into a space of much lower dimension such that the Euclidean distance between these points is approximately preserved. This…
A unified classification and analysis is presented of two dimensional Dirac operators of QCD-like theories in the continuum as well as in a naive lattice discretization. Thereby we consider the quenched theory in the strong coupling limit.…
For a certain class of two-dimensional lattices, lattice-dual pairs are shown to have the same bond percolation critical exponents. A computational proof is given for the martini lattice and its dual to illustrate the method. The result is…
The concept of cutting is first explicitly introduced. By the concept, a convex expansion for finite distributive lattices is considered. Thus, a more general method for drawing the Hasse diagram is given, and the rank generating function…
A classical result of Dirichlet shows that certain elementary character sums compute class numbers of quadratic imaginary number fields. We obtain analogous relations between class numbers and a weighted character sum associated to a…
We prove the Pierce--Birkhoff conjecture for splines, i.e., continuous piecewise polynomials of degree $d$ in $n$ variables on a hyperplane partition of $\mathbb{R}^n$, can be written as a finite lattice combination of polynomials. We will…