Related papers: Point Counts of D_k and Some A_k and E_k Integer L…

The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…

Let A be a k-vector space of dimension a. A subvector space M of End(A) is said to be of rank r if every non-zero f in M has rank r. The problem considered in this paper is to determine l(r;a) the maximal dimension of a rank r subspace of…

Heinz Huber (1956) considered the following problem on the the hyperbolic plane H. Consider a strictly hyperbolic subgroup of automorphisms on H with compact quotient, and choose a conjugacy class in this group. Count the number of vertices…

For any number field k, upper bounds are established for the number of k-rational points of bounded height on non-singular del Pezzo surfaces defined over k, which are equipped with suitable conic bundle structures over k.

By Dirichlet's Unit Theorem, under the log embedding the units in the ring of integers of a number field form a lattice, called the log-unit lattice. We investigate the geometry of these lattices when the number field is a biquadratic or…

A lattice in the Euclidean space is standard if it has a basis consisting vectors whose norms equal to the length in its successive minima. In this paper, it is shown that with the $L^2$ norm all lattices of dimension $n$ are standard if…

We obtain a growth estimate for the number of lattice points inside any Q-Gorenstein cone. Our proof uses the result of Futaki-Ono-Wang on Sasaki-Einstein metric for the toric Sasakian manifold associated to the cone, a Yau's inequality,…

The standard method for constructing generating vectors for good lattice point sets is the component-by-component construction. Numerical experiments have shown that the generating vectors found by these constructions sometimes tend to have…

The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…

We are interested in algebraic properties of empty lattice simplices $\Delta$, that is, $d$-dimensional lattice polytopes containing exactly $d+1$ points of the integer lattice $\mathbb{Z}^d$. The cyclicity rank of $\Delta$ is the minimal…

We establish lower bounds on the rank of matrices in which all but the diagonal entries lie in a multiplicative group of small rank. Applying these bounds we show that the distance sets of finite pointsets in $\mathbb{R}^d$ generate high…

An integral lattice which is generated by some vectors of norm $q$ is called $q$-lattice. Classification of 3-lattices of dimension at most four is given by Mimura (On 3-lattice, 2006). As a expansion, we give a classification of 3-lattices…

We show that the number of lattice points in the boundary of a positive integer dilate of a Delzant integral polytope is a polynomial in the dilation parameter, analogous to the Ehrhart polynomial giving the number of lattice points in a…

Let X be a geometrically integral projective cubic hypersurface defined over the rationals, with dimension D and singular locus of dimension at most D-4. For any \epsilon>0, we show that X contains O(B^{D+\epsilon}) rational points of…

We prove an explicit upper bound on the number of real quadratic fields that admit a universal quadratic form of a given rank, thus establishing a density zero statement. More generally, we obtain such a result for totally positive definite…

We introduce the 2-sorted counting logic $GC^k$ that expresses properties of hypergraphs. This logic has available k variables to address hyperedges, an unbounded number of variables to address vertices, and atomic formulas E(e,v) to…

In this article we prove a conjecture of A. Lubotzky: let G = G_0(K), where K is a local field of characteristic p>5, G_0 is a simply connected, absolutely almost simple K-group of K-rank at least 2. We give the rate of growth of r_x(G)…

The problem of designing a multiple description vector quantizer with lattice codebook Lambda is considered. A general solution is given to a labeling problem which plays a crucial role in the design of such quantizers. Numerical…

Multilevel lattice codes, such as those associated to Constructions $C$, $\overline{D}$, D and D', have relevant applications in communications. In this paper, we investigate some properties of lattices obtained via Constructions D and D'…

Let k be a field of positive characteristic. We construct, for each dominant coweight \lambda of the standard maximal torus in the special linear group, a closed subvariety D(\lambda) of the multigraded Hilbert scheme of an affine space…