Related papers: Module lattices and their shortest vectors

Reference frame optimization is a generic framework to calculate a spatially-varying observer field that views an unsteady fluid flow in a reference frame that is as-steady-as-possible. In this paper, we show that the optimized vector field…

We present a novel technique for the determination of the topological susceptibility (related to the variance of the distribution of global topological charge) from lattice gauge theory simulations, based on maximum-likelihood analysis of…

A new lower bound for the maximal length of a multivector is obtained. It is much closer to the best known upper bound than previously reported lower bound estimates. The maximal length appears to be unexpectedly large for $n$-vectors, with…

In this paper, we study dilation of cyclic polytopes with the vertices defined by a generator of the simplest cubic fields. In particular, for a specific range of values, we give a precise number of the contained lattice points.

Let ${\bf C}$ be a smooth geometrically connected projective curve over a finite field, and let $A$ be the affine algebra of its regular functions outside a fixed place of ${\bf C}$. We give precise relationships between the Mahler…

In this paper we study extreme value distributions for one-parameter actions on homogeneous spaces of Lie groups. We study both shortest vectors in unimodular lattices, maximal distance excursions and closest distance returns of a…

Pursuing ideas in a recent work of the second author, we determine the isometry classes of unimodular lattices of rank 28, as well as the isometry classes of unimodular lattices of rank 29 without nonzero vectors of norm <=2.

In this paper we introduce a new type of code, called projective nested cartesian code. It is obtained by the evaluation of homogeneous polynomials of a fixed degree on a certain subset of $\mathbb{P}^n(\mathbb{F}_q)$, and they may be seen…

Well-rounded lattices have been a topic of recent studies with applications in wiretap channels and in cryptography. A lattice of full rank in Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. In…

We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest…

The purpose of the paper is to give a complete characterization of the continuity of lower envelopes in the infinite dimensional spaces in terms of the notion of c-regularity. As an application we introduce a variational unconstrained…

Consider two independent random strings having same length and taking values uniformly in a common finite alphabet. We study the order of the variance of the length of the longest common subsequences (LCS) of these strings when long blocks,…

We study random normal matrix models whose eigenvalues tend to be distributed within a narrow "band" around the unit circle of width proportional to $\frac1n$, where $n$ is the size of matrices. For general radially symmetric potentials…

We prove an asymptotic formula for the number of fixed rank matrices with integer coefficients over a number field K/Q and bounded norm. As an application, we derive an approximate Rogers integral formula for discrete sets of module…

In this paper we introduce the concept of modulus of regularity as a tool to analyze the speed of convergence, including the finite termination, for classes of Fej\'er monotone sequences which appear in fixed point theory, monotone operator…

We present an algorithm to find an {\it Euclidean Shortest Path} from a source vertex $s$ to a sink vertex $t$ in the presence of obstacles in $\Re^2$. Our algorithm takes $O(T+m(\lg{m})(\lg{n}))$ time and $O(n)$ space. Here, $O(T)$ is the…

We prove that all Euclidean lattices of dimension $n\le 9$ which are generated by their minimal vectors, also possess a basis of minimal vectors. By providing a new counterexample, we show that this is not the case for all dimensions $n\ge…

Minkowski proved that any $n$-dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most $\sqrt{n}$; in fact, there are $2^{\Omega(n)}$ such lattice vectors. Lattices whose minimum distances come close to…

A main goal in lattice theory is the construction of dense lattices. Most of the remarkable dense lattices in small dimensions have an additional symmetry, they are modular, i.e. similar to their dual lattice. Extremal lattices are densest…

We study different notions of slope of a vector bundle over a smooth projective curve with respect to ampleness and affineness in order to apply this to tight closure problems. This method gives new degree estimates from above and from…