arXiv subjects

Lenny Fukshansky

Publications and source records attributed to Lenny Fukshansky.

At least 55 records · Page 3Linked to original sources

arXiv2015

Height bounds on zeros of quadratic forms over $\overline{\mathbb Q}$

In this paper we establish three results on small-height zeros of quadratic polynomials over $\overline{\mathbb Q}$. For a single quadratic form in $N \geq 2$ variables on a subspace of $\overline{\mathbb Q}^N$, we prove an upper bound on the height of a smallest nontrivial zero outside of an algebraic set under the assumption that such a zero exists. For a system of $k$ quadratic forms on an $L$-dimensional subspace of $\overline{\mathbb Q}^N$, $N \geq L \geq \frac{k(k+1)}{2}+1$, we prove existence of a nontrivial simultaneous small-height zero. For a system of one or two inhomogeneous quadratic and $m$ linear polynomials in $N \geq m+4$ variables, we obtain upper bounds on the height of a smallest simultaneous zero, if such a zero exists. Our investigation extends previous results on small zeros of quadratic forms, including Cassels' theorem and its various generalizations and contributes to the literature of so-called "absolute" Diophantine results with respect to height. All bounds on height are explicit.

math.NT↗

arXiv2015

Lattices from Hermitian function fields

We consider the well-known Rosenbloom-Tsfasman function field lattices in the special case of Hermitian function fields. We show that in this case the resulting lattices are generated by their minimal vectors, provide an estimate on the total number of minimal vectors, and derive properties of the automorphism groups of these lattices. Our study continues previous investigations of lattices coming from elliptic curves and finite Abelian groups. The lattices we are faced with here are more subtle than those considered previously, and the proofs of the main results require the replacement of the existing linear algebra approaches by deep results of Gerhard Hiss on the factorization of functions with particular divisor support into lines and their inverses.

math.NT↗

arXiv2014

On the geometry of cyclic lattices

Cyclic lattices are sublattices of $\mathbb Z^N$ that are preserved under the rotational shift operator. Cyclic lattices were introduced by D.~Micciancio and their properties were studied in the recent years by several authors due to their importance in cryptography. In particular, Peikert and Rosen showed that on cyclic lattices in prime dimensions, the shortest independent vectors problem SIVP reduces to the shortest vector problem SVP with a particularly small loss in approximation factor, as compared to general lattices. In this paper, we further investigate geometric properties of cyclic lattices. Our main result is a counting estimate for the number of well-rounded cyclic lattices, indicating that well-rounded lattices are more common among cyclic lattices than generically. We also show that SVP is equivalent to SIVP on a positive proportion of Minkowskian well-rounded cyclic lattices in every dimension. As an example, we demonstrate an explicit construction of a family of such lattices on which this equivalence holds. To conclude, we introduce a class of sublattices of $\mathbb Z^N$ closed under the action of subgroups of the permutation group $S_N$, which are a natural generalization of cyclic lattices, and show that our results extend to all such lattices closed under the action of any $N$-cycle.

math.NT↗

arXiv2014

Totally isotropic subspaces of small height in quadratic spaces

Let $K$ be a global field or $\overline{\mathbb Q}$, $F$ a nonzero quadratic form on $K^N$, $N \geq 2$, and $V$ a subspace of $K^N$. We prove the existence of an infinite collection of finite families of small-height maximal totally isotropic subspaces of $(V,F)$ such that each such family spans $V$ as a $K$-vector space. This result generalizes and extends a well known theorem of J. Vaaler and further contributes to the effective study of quadratic forms via height in the general spirit of Cassels' theorem on small zeros of quadratic forms. All bounds on height are explicit.

math.NT↗

arXiv2014

Toeplitz determinants with perturbations in the corners

The paper is devoted to exact and asymptotic formulas for the determinants of Toeplitz matrices with perturbations by blocks of fixed size in the four corners. If the norms of the inverses of the unperturbed matrices remain bounded as the matrix dimension goes to infinity, then standard perturbation theory yields asymptotic expressions for the perturbed determinants. This premise is not satisfied for matrices generated by so-called Fisher-Hartwig symbols. In that case we establish formulas for pure single Fisher-Hartwig singularities and for Hermitian matrices induced by general Fisher-Hartwig symbols.

math.FA↗

arXiv2014

On lattices generated by finite Abelian groups

This paper is devoted to the study of lattices generated by finite Abelian groups. Special species of such lattices arise in the exploration of elliptic curves over finite fields. In case the generating group is cyclic, they are also known as the Barnes lattices. It is shown that for every finite Abelian group with the exception of the cyclic group of order four these lattices have a basis of minimal vectors. Another result provides an improvement of a recent upper bound by Min Sha for the covering radius in the case of the Barnes lattices. Also discussed are properties of the automorphism groups of these lattices.

math.NT↗

arXiv2014

Lattices from elliptic curves over finite fields

In their well known book Tsfasman and Vladut introduced a construction of a family of function field lattices from algebraic curves over finite fields, which have asymptotically good packing density in high dimensions. In this paper we study geometric properties of lattices from this construction applied to elliptic curves. In particular, we determine the generating sets, conditions for well-roundedness and a formula for the number of minimal vectors. We also prove a bound on the covering radii of these lattices, which improves on the standard inequalities.

math.NT↗

arXiv2013

Lattice point counting and height bounds over number fields and quaternion algebras

An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit applications of a particular estimate of this sort to several counting problems in number theory: counting integral points and units of bounded height over number fields, counting points of bounded height over positive definite quaternion algebras, and counting points of bounded height with a fixed support over global function fields. Our arguments use a collection of height comparison inequalities for heights over a number field and over a quaternion algebra. We also show how these inequalities can be used to obtain existence results for points of bounded height over a quaternion algebra, which constitute non-commutative analogues of variations of the classical Siegel's lemma and Cassels' theorem on small zeros of quadratic forms.

math.NT↗

arXiv2013

Small zeros of quadratic forms outside of a union of varieties

Let $F$ be a quadratic form in $N \geq 2$ variables defined on a vector space $V \subseteq K^N$ over a global field $K$, and $\Z \subseteq K^N$ be a finite union of varieties defined by families of homogeneous polynomials over $K$. We show that if $V \setminus \Z$ contains a nontrivial zero of $F$, then there exists a linearly independent collection of small-height zeros of $F$ in $V\setminus \Z$, where the height bound does not depend on the height of $\Z$, only on the degrees of its defining polynomials. As a corollary of this result, we show that there exists a small-height maximal totally isotropic subspace $W$ of the quadratic space $(V,F)$ such that $W$ is not contained in $\Z$. Our investigation extends previous results on small zeros of quadratic forms, including Cassels' theorem and its various generalizations. The paper also contains an appendix with two variations of Siegel's lemma. All bounds on height are explicit.

math.NT↗

arXiv2012

On well-rounded ideal lattices - II

We study well-rounded lattices which come from ideals in quadratic number fields, generalizing some recent results of the first author with K. Petersen. In particular, we give a characterization of ideal well-rounded lattices in the plane and show that a positive proportion of real and imaginary quadratic number fields contains ideals giving rise to well-rounded lattices.

math.NT↗

arXiv2012

On integral well-rounded lattices in the plane

We investigate distribution of integral well-rounded lattices in the plane, parameterizing the set of their similarity classes by solutions of the family of Pell-type Diophantine equations of the form $x^2+Dy^2=z^2$ where $D>0$ is squarefree. We apply this parameterization to the study of the greatest minimal norm and the highest signal-to-noise ratio on the set of such lattices with fixed determinant, also estimating cardinality of these sets (up to rotation and reflection) for each determinant value. This investigation extends previous work of the first author in the specific cases of integer and hexagonal lattices and is motivated by the importance of integral well-rounded lattices for discrete optimization problems. We briefly discuss an application of our results to planar lattice transmitter networks.

math.NT↗

arXiv2012

Well-rounded zeta-function of planar arithmetic lattices

We investigate the properties of the zeta-function of well-rounded sublattices of a fixed arithmetic lattice in the plane. In particular, we show that this function has abscissa of convergence at $s=1$ with a real pole of order 2, improving upon a recent result of S. Kuehnlein. We use this result to show that the number of well-rounded sublattices of a planar arithmetic lattice of index less or equal $N$ is $O(N \log N)$ as $N \to \infty$. To obtain these results, we produce a description of integral well-rounded sublattices of a fixed planar integral well-rounded lattice and investigate convergence properties of a zeta-function of similarity classes of such lattices, building on some previous results of the author.

math.NT↗

arXiv2012

Heights and quadratic forms: on Cassels' theorem and its generalizations

In this survey paper, we discuss the classical Cassels' theorem on existence of small-height zeros of quadratic forms over Q and its many extensions, to different fields and rings, as well as to more general situations, such as existence of totally isotropic small-height subspaces. We also discuss related recent results on effective structural theorems for quadratic spaces, as well as Cassels'-type theorems for small-height zeros of quadratic forms with additional conditions. We conclude with a selection of open problems.

math.NT↗

arXiv2011

Bounds on generalized Frobenius numbers

Let $N \geq 2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. The Frobenius number of this $N$-tuple is defined to be the largest positive integer that has no representation as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are non-negative integers. More generally, the $s$-Frobenius number is defined to be the largest positive integer that has precisely $s$ distinct representations like this. We use techniques from the Geometry of Numbers to give upper and lower bounds on the $s$-Frobenius number for any nonnegative integer $s$.

math.NT↗

arXiv2011

On well-rounded ideal lattices

We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We consider lattices coming from full rings of integers in number fields, proving that only cyclotomic fields give rise to well-rounded lattices. We further study the well-rounded lattices coming from ideals in quadratic rings of integers, showing that there exist infinitely many real and imaginary quadratic number fields containing ideals which give rise to well-rounded lattices in the plane.

math.NT↗

arXiv2011

Generalized Frobenius numbers: Bounds and average behavior

We produce new upper and lower bounds for the s-Frobenius number by relating it to the so called s-covering radius of a certain convex body with respect to a certain lattice; this generalizes a well-known theorem of R. Kannan for the classical Frobenius number. Using these bounds, we obtain results on the average behavior of the s-Frobenius number, extending analogous recent investigations for the classical Frobenius number by a variety of authors. We also derive bounds on the s-covering radius, an interesting geometric quantity in its own right.

math.NT↗

arXiv2010

On well-rounded sublattices of the hexagonal lattice

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 signal-to-noise ratio of well-rounded sublattices of the hexagonal lattice of a fixed index. This investigation parallels earlier work by Bernstein, Sloane, and Wright where similar questions were addressed on the space of all sublattices of the hexagonal lattice. Our restriction is motivated by the importance of well-rounded lattices for discrete optimization problems. Finally, we also discuss the existence of a natural combinatorial structure on the set of similarity classes of well-rounded sublattices of the hexagonal lattice, induced by the action of a certain matrix monoid.

math.NT↗

arXiv2010

Bounds for solid angles of lattices of rank three

We find sharp absolute constants $C_1$ and $C_2$ with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval $[C_1,C_2]$. In fact, we show that these absolute bounds hold for a larger class of lattices than just well-rounded, and the upper bound holds for all. We state a technical condition on the lattice that may prevent it from satisfying the absolute lower bound on the solid angle, in which case we derive a lower bound in terms of the ratios of successive minima of the lattice. We use this result to show that among all spherical triangles on the unit sphere in $\mathbb R^N$ with vertices on the minimal vectors of a lattice, the smallest possible area is achieved by a configuration of minimal vectors of the (normalized) face centered cubic lattice in $\mathbb R^3$. Such spherical configurations come up in connection with the kissing number problem.

math.MG↗