Related papers: Counting flags of primitive lattices

We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…

We prove a variant of Manin's conjecture for Campana points on wonderful compactifications of semi-simple algebraic groups of adjoint type. We use this to provide evidence for a new conjecture on the leading constant in Manin's conjecture…

We investigate in this paper the distribution of the discrepancy of various lattice counting functions. In particular, we prove that the number of lattice points contained in certain domains defined by products of linear forms satisfies a…

Let $F \in \mathbf{Z}[\boldsymbol{x}]$ be a diagonal, non-singular quadratic form in $4$ variables. Let $\lambda(n)$ be the normalised Fourier coefficients of a holomorphic Hecke form of full level. We give an upper bound for the problem of…

For a real $N\ge 1$ and a vector $\xi =(1,\xi_1,...,\xi_n)$ define a matrix $$ {\cal A} (\xi, N) = ({array}{ccccc} N^{-1} & 0& 0& ... &0 \cr N^{\frac{1}{n}} \xi_1 & -N^{\frac{1}{n}} & 0&... & 0 \cr N^{\frac{1}{n}} \xi_2 &0& -N^{\frac{1}{n}}…

In this paper, we study a family of lattice walks which are related to the Hadamard conjecture. There is a bijection between paths of these walks which originate and terminate at the origin and equivalence classes of partial Hadamard…

Given an extension of number fields $E \subset F$ and a projective variety $X$ over $F$, we compare the problem of counting the number of rational points of bounded height on $X$ with that of its Weil restriction over $E$. In particular, we…

In this paper we introduce several quantitative methods for the lambda-calculus based on partial metrics, a well-studied variant of standard metric spaces that have been used to metrize non-Hausdorff topologies, like those arising from…

In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…

In this paper, we first investigate the relationship between the number of primitive representations of $n$ by quadratic forms and the number of non-primitive ones. We hence obtain a theorem to deal with the Eisenstein series part with…

We count the maximal lattices over $p$-adic fields and the rational number field. For this, we use the theory of Hecke series for a reductive group over nonarchimedean local fields, which was developed by Andrianov and Hina-Sugano. By…

We adapt an argument of Tao and Vu to show that if $\lambda_1\le\cdots\le\lambda_d$ are the successive minima of an origin-symmetric convex body $K$ with respect to some lattice $\Lambda<\mathbb{R}^d$, and if we set…

Let $\Gamma$ be an irreducible lattice in a product of n infinite irreducible complete Kac-Moody groups of simply laced type over finite fields. We show that if n is at least 3, then each Kac-Moody groups is in fact a simple algebraic group…

We prove that, under mild assumptions, a lattice in a product of semi-simple Lie group and a totally disconnected locally compact group is, in a certain sense, arithmetic. We do not assume the lattice to be finitely generated or the ambient…

We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…

This paper is an investigation of a procedure for constructing lattices by means of taking the sum of a pair of isometric lattices. We present various general results pertaining to this construction and discuss several examples of it…

We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…

We apply lattice point counting methods to compute the multiplicities in the plethysm of $GL(n)$. Our approach gives insight into the asymptotic growth of the plethysm and makes the problem amenable to computer algebra. We prove an old…

Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes…

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…