Related papers: Counting flags of primitive lattices

If $\Gamma$ is an irreducible non-uniform higher-rank characteristic zero arithmetic lattice (for example, $SL_n(\mathbb{Z})$, $n \geq 3$) and $\Lambda$ is a finitely generated group that is elementarily equivalent to $\Gamma$, then…

Split toric stacks over a number field $F$ are natural generalization of split toric varieties over $F$. Notable examples are weighted projective stacks. In our previous work, we defined heights on Deligne-Mumford stacks using so-called…

Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18.…

For every univariate formula $\chi$ we introduce a lattices of intermediate theories: the lattice of $\chi$-logics. The key idea to define chi-logics is to interpret atomic propositions as fixpoints of the formula $\chi^2$, which can be…

We prove a fairly general inequality that estimates the number of lattice points in a ball of positive radius in general position in a Euclidean space. The bound is uniform over lattices induced by a matrix having a bounded operator norm.

Zeros and poles of $k$-tuple zeta functions, that are defined here implicitly, enable localization onto prime-power $k$-tuples in pair-wise coprime $k$-lattices $\mathfrak{N}_k$. As such, the set of all $\mathfrak{N}_k$ along with their…

We give explicit, polynomial-time computable formulas for the number of integer points in any two-dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of…

We investigate similarity classes of arithmetic lattices in the plane. We introduce a natural height function on the set of such similarity classes, and give asymptotic estimates on the number of all arithmetic similarity classes,…

We prove an asymptotic formula conjectured by Manin for the number of $K$-rational points of bounded height with respect to the anticanonical line bundle for arbitrary smooth projective toric varieties over a number field $K$.

Using the circle method, we count integer points on complete intersections in biprojective space in boxes of different side length, provided the number of variables is large enough depending on the degree of the defining equations and…

Let G be a semisimple Lie group without compact factors, \Gamma be an irreducible lattice in G. In the first part of the article we give the necessary and sufficient condition under which a sequence of translates of probability…

With the help of the recently introduced parametric geometry of numbers by W. M. Schmidt and L. Summerer, we prove a strong version of a conjecture of Schmidt concerning the successive minima of a lattice.

A set of natural numbers $A$ is called primitive if no element of $A$ divides any other. Let $\Omega(n)$ be the number of prime divisors of $n$ counted with multiplicity. Let $f_z(A) = \sum_{a \in A}\frac{z^{\Omega(a)}}{a (\log a)^z}$,…

We present algorithms for computing ranks and order statistics in the Farey sequence, taking time O (n^{2/3}). This improves on the recent algorithms of Pawlewicz [European Symp. Alg. 2007], running in time O (n^{3/4}). We also initiate the…

We show that the number of rational points of a subgroup inside a toric variety over a finite field defined by a homogeneous lattice ideal can be computed via Smith normal form of the matrix whose columns constitute a basis of the lattice.…

Let $P(n)$ be the number of polyominoes of $n$ cells and $\lambda$ be Klarner's constant, that is, $\lambda=\lim_{n\to\infty} \sqrt[n]{P(n)}$. We show that there exist some positive numbers $A,T$, so that for every $n$ \[ P(n) \ge…

We classify all products of flag varieties with finitely many orbits under the diagonal action of the general linear group. We also classify the orbits in each case and construct explicit representatives. This generalizes the classical…

In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…

Flag matroids are combinatorial abstractions of flags of linear subspaces, just as matroids are of linear subspaces. We introduce the flag Dressian as a tropical analogue of the partial flag variety, and prove a correspondence between: (a)…

We prove a higher-rank analogue of a well-known result of W. M. Schmidt concerning almost everywhere pointwise discrepancy bounds for lattices in Euclidean space (see Theorem 1 [Trans. Amer. Math. Soc. 95 (1960), 516-529]). We also…