- Research Article
27
- 10.1016/j.jcta.2014.11.006
A Euclid style algorithm for MacMahon's partition analysis
- Dec 05, 2014
- Journal of Combinatorial Theory, Series A
- Guoce Xin
A Euclid style algorithm for MacMahon's partition analysis
Effective lattice point counting in rational convex polytopes
A Euclid style algorithm for MacMahon's partition analysis
A Euclid style algorithm for MacMahon's partition analysis
A Closer Look at Lattice Points in Rational Simplices
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an $n$-dimensional polytope with $n+1$ rational vertices, we use its description as the intersection of $n+1$ halfspaces, which determine the facets of the simplex. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We give an elementary proof that the lattice point counts in the interior and closure of such a vector-dilated simplex are quasipolynomials satisfying an Ehrhart-type reciprocity law. This generalizes the classical reciprocity law for rational polytopes. As an example, we derive a lattice point count formula for a rectangular rational triangle, which enables us to compute the number of lattice points inside any rational polygon.
Read moreComparing and generating Latin Hypercube designs in Kriging models
In Computer Experiments (CE), a careful selection of the design points is essential for predicting the system response at untried points, based on the values observed at tried points. In physical experiments, the protocol is based on Design of Experiments, a methodology whose basic principles are questioned in CE. When the responses of a CE are modeled as jointly Gaussian random variables with their covariance depending on the distance between points, the use of the so called space-filling designs (random designs, stratified designs and Latin Hypercube designs) is a common choice, because it is expected that the nearer the untried point is to the design points, the better is the prediction. In this paper we focus on the class of Latin Hypercube (LH) designs. The behavior of various LH designs is examined according to the Gaussian assumption with exponential correlation, in order to minimize the total prediction error at the points of a regular lattice. In such a special case, the problem is reduced to an algebraic statistical model, which is solved using both symbolic algebraic software and statistical software. We provide closed-form computation of the variance of the Gaussian linear predictor as a function of the design, in order to make a comparison between LH designs. In principle, the method applies to any number of factors and any number of levels, and also to classes of designs other than LHs. In our current implementation, the applicability is limited by the high computational complexity of the algorithms involved.
Read morePrimitive Points in Rational Polygons
Let ${\mathcal{A}}$ be a star-shaped polygon in the plane, with rational vertices, containing the origin. The number of primitive lattice points in the dilate $t{\mathcal{A}}$ is asymptotically $\frac{6}{\unicode[STIX]{x1D70B}^{2}}\text{Area}(t{\mathcal{A}})$ as $t\rightarrow \infty$. We show that the error term is both $\unicode[STIX]{x1D6FA}_{\pm }(t\sqrt{\log \log t})$ and $O(t(\log t)^{2/3}(\log \log t)^{4/3})$. Both bounds extend (to the above class of polygons) known results for the isosceles right triangle, which appear in the literature as bounds for the error term in the summatory function for Euler’s $\unicode[STIX]{x1D719}(n)$.
Read moreMultidimensional Ehrhart Reciprocity
Multidimensional Ehrhart Reciprocity
On Counterexamples to a Conjecture of Wills and Ehrhart Polynomials whose Roots have Equal Real Parts
As a discrete analog to Minkowski's theorem on convex bodies, Wills conjectured that the Ehrhart coefficients of a $0$-symmetric lattice polytope with exactly one interior lattice point are maximized by those of the cube of side length two. We discuss several counterexamples to this conjecture and, on the positive side, we identify a family of lattice polytopes that fulfill the claimed inequalities. This family is related to the recently introduced class of $l$-reflexive polytopes.
Read moreOn the Pseudo-Periodicity of the Integer Hull of Parametric Convex Polygons
Consider a rational convex polygon given by a system of linear inequalities \(A \vec {x} \le \vec {b}\), where A is a matrix over \({{\mathbb Z}}\), with m rows and 2 columns, and \(\vec {b}\) is an integer vector. The coordinates \(b_1, \ldots , b_m\) of \(\vec {b}\) are treated as parameters while the coefficients of A have fixed values. We observe that for every \(1 \le i \le m\), there exists a positive integer \(T_i\) so that, when each \(b_1, \ldots , b_m\) is large enough, the vertex sets V and \(V'\) of the respective integer hulls of \(P := P(b_1,\ldots ,b_{i-1},b_i,b_{i+1}, \ldots , b_m)\) and \(P' := P(b_1,\ldots ,b_{i-1},b_i \,+\,T_i,b_{i+1}, \ldots , b_m)\), respectively, are in a “simple” one-to-one correspondence. We state and prove explicit formulas for the pseudo-period \(T_i\) and that correspondence between V and \(V'\). This result and the ingredients of its proof lead us to propose a new algorithm for computing the integer hull of a rational convex polygon.
Read moreOn posets and polytopes attached to arbors
Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive formulas for various classical invariants of these polytopes and posets, using the tree structure. For linear arbors, we propose a conjecture exchanging the Ehrhart polynomial of the polytope with the Zeta polynomial of the poset for the reverse arbor. The general motivation comes from a transmutation operator acting on $M$-triangles, which should link the posets considered here with some kind of generalized noncrossing partitions and generalized associahedra. We give some evidence for this relationship in several cases, including notably some polytopes, namely halohedra and Hochschild polytopes.
Read moreCharacteristic and Ehrhart Polynomials
Let A be a subspace arrangement and let χ(A,t) be the characteristic polynomial of its intersection lattice L( A). We show that if the subspaces in A are taken from \({\mathcal{L}}({\mathcal{B}}_n)\), where \({\mathcal{B}}_n\) is the type B Weyl arrangement, then χ(A,t) counts a certain set of lattice points. One can use this result to study the partial factorization of χ(A,t) over the integers and the coefficients of its expansion in various bases for the polynomial ring R[t]. Next we prove that the characteristic polynomial of any Weyl hyperplane arrangement can be expressed in terms of an Ehrhart quasi-polynomial for its affine Weyl chamber. Note that our first result deals with all subspace arrangements embedded in \({\mathcal{B}}_n\) while the second deals with all finite Weyl groups but only their hyperplane arrangements.
Read moreSplitting fields of elements in arithmetic groups
We prove that the number of unimodular integral n × n matrices in a norm ball whose characteristic polynomial has Galois group different than the full symmetric group Sn is of strictly lower order of magnitude than the number of all such matrices in the ball, as the radius increases. More generally, we prove a similar result for the Galois groups associated with elements in any connected semisimple linear algebraic group defined and simple over a number field F . Our method is based on the abstract large sieve method developed by Kowalski, and the study of Galois groups via reductions modulo primes developed by Jouve, Kowalski and Zywina. The two key ingredients are a uniform quantitative lattice point counting result, and a non-concentration phenomenon for lattice points in algebraic subvarieties of the group variety, both established previously by the authors. The results answer a question posed by Rivin and by Jouve, Kowalski and Zywina, who have considered Galois groups of random products of elements in algebraic groups.
Read moreOn the mean square of the remainder for the euclidean lattice point counting problem
We give asymptotic formulas for the average and mean square bounds for the remainder in the lattice point counting problem, counting the number of lattice points in a large ball in R d , when averaged over families of shears of the lattice.
Read moreUniform bounds for lattice point counting and partial sums of zeta functions
We prove uniform versions of two classical results in analytic number theory. The first is an asymptotic for the number of points of a complete lattice \(\Lambda \subseteq \mathbb {R}^d\) inside the d-sphere of radius R. In contrast to previous works, we obtain error terms with implied constants depending only on d. Secondly, let \(\phi (s) = \sum _n a(n) n^{-s}\) be a ‘well behaved’ zeta function. A classical method of Landau yields asymptotics for the partial sums \(\sum _{n < X} a(n)\), with power saving error terms. Following an exposition due to Chandrasekharan and Narasimhan, we obtain a version where the implied constants in the error term will depend only on the ‘shape of the functional equation’, implying uniform results for families of zeta functions with the same functional equation.
Read moreThe Tutte polynomial
This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence of randomized approximation schemes. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 210–228, 1999
Read moreA central limit theorem for coefficients of L$L$‐functions in short intervals
Assuming the generalized Lindelöf hypothesis (GLH), a weak version of the generalized Ramanujan conjecture and a Rankin–Selberg type partial sum estimate, we establish the normality of the sum of coefficients of a general ‐function in short intervals of appropriate length. The novelty lies in the degree aspect under GLH. In particular, this generalizes the result of Hughes and Rudnick on lattice point counts in thin annuli.
Read moreCounting Lattice Points and O-Minimal Structures
Let L be a lattice in R^n and Z a parameterized family of subsets Z_T of R^n. Using o-minimal structures we give an estimate for the number of points of L in Z_T for a quite general class of families Z. This is joint work with Martin Widmer.
Read more