相关论文: Volume vs. rank of lattices

We describe a data structure that can maintain a dynamic set of points given by their Cartesian coordinates, and maintain the point whose product of ranks within the two coordinate orderings is minimum or maximum, in time $O(\sqrt{n\log…

We prove that the lower central series of the cactus group associated with a non commutative Coxeter group never stabilizes. We also compute a minimal presentation in terms of generators for the cactus group associated with a finite Coxeter…

We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is…

We show that symmetric spaces and thick affine buildings which are not of spherical type $A_1^r$ have no coarse median in the sense of Bowditch. As a consequence, they are not quasi-isometric to a CAT(0) cube complex, answering a question…

We show that L\"uck's conjecture on torsion growth in homology implies that two 3-manifolds have equal volume if the fundamental groups have the same set of finite quotients.

We establish an upper bound of the bottom of the essential spectrum for the generator associated with a regular Dirichlet form in terms of the rates of the volume growth/decay and big jump. Using this bound, we discuss how the bottom of the…

This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…

By median we mean a scheme that inputs three element of a lattice, and outputs an element that is an average of the three inputs in a certain sense. The medians of a given finite lattice form a new lattice that is usually larger than the…

In this paper we show error bounds for randomly subsampled rank-1 lattices. We pay particular attention to the ratio of the size of the subset to the size of the initial lattice, which is decisive for the computational complexity. In the…

We develop a theory of levels for irreducible representations of symmetric groups of degree $n$ analogous to the theory of levels for finite classical groups. A key property of level is that the level of a character, provided it is not too…

We consider the problem of counting lattice points contained in domains in $\mathbb{R}^d$ defined by products of linear forms and we show that the normalized discrepancies in these counting problems satisfy non-degenerate Central Limit…

A tree with $n$ vertices has at most $95^{n/13}$ minimal dominating sets. The growth constant $\lambda = \sqrt[13]{95} \approx 1.4194908$ is best possible. It is obtained in a semi-automatic way as a kind of "dominant eigenvalue" of a…

Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of…

This note gives an example of closed smooth manifolds $M$ and $N$ for which the rank of $M\times N$ is strictly greater than $rank M + rank N$.

We are concerned with the study of different notions of curvature on graphs. We show that if a graph has stronger inner-outer curvature growth than a model graph, then it has faster volume growth too. We also study the relationhips of…

We examine the moments of the number of lattice points in a fixed ball of volume $V$ for lattices in Euclidean space which are modules over the ring of integers of a number field $K$. In particular, denoting by $\omega_K$ the number of…

The rank (also known as protection number or leaf-height) of a vertex in a rooted tree is the minimum distance between the vertex and any of its leaf descendants. We consider the sum of ranks over all vertices (known as the security) in…

Given k sets such that no one is contained in another, there is an associated lattice on the power set P([k]) corresponding to inclusion relations among unions of the sets. Two lattices on P([k]) are equivalent if there is a permutation of…

Suppose that $X_1,\...,X_n,\...$ are i.i.d. rotationally invariant $N$-by-$N$ matrices. Let $\Pi_n=X_n\... X_1$. It is known that $n^{-1}\log |\Pi_n|$ converges to a nonrandom limit. We prove that under certain additional assumptions on…

We establish finiteness of low-dimensional actions of lattices in higher-rank semisimple Lie groups and establish Zimmer's conjecture for many such groups. This builds on previous work of the authors handling the case of actions by…