Related papers: Erratum : Linear projections and successive minima
In this paper, we continue our previous work on the reduction of algebraic lattices over imaginary quadratic fields for the special case when the lattice is spanned over a two dimensional basis. In particular, we show that the…
Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the law of the perturbations, we construct a translation-invariant…
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
We make two tiny corrections to our previous paper with the same title, and also obtain, as a bonus, something new.
We formulate several conjectures on mean convex domains in the Euclidean spaces, as well as in more general spaces with lower bonds on their scalar curvatures, and prove a few theorems motivating these conjectures.
If we construct a lattice fermion formulation, there are a number of goals to be considered: doubling should be avoided; even at finite lattice spacing, we want to represent chiral symmetry in a sound way; and we are seeking a good scaling…
We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…
The purpose of this paper is to present projective geometry in a synthetic, visual and intuitive style through the central notion of harmonicity which leads to harmonic curves. This presentation includes new results, unpublished proofs of…
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. The motivation comes from the problem of establishing a…
For $E_{b}: y^{2}=x^{3}+b$, we establish Lang's conjecture on a lower bound for the canonical height of non-torsion points along with upper and lower bounds for the difference between the canonical and logarithmic height. In many cases, our…
We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…
We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…
Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…
We show that a central linear mapping of a projectively embedded Euclidean $n$-space onto a projectively embedded Euclidean $m$-space is decomposable into a central projection followed by a similarity if, and only if, the least singular…
We give an asymptotic formula for the number of elliptic curves over $\mathbb{Q}$ with bounded Faltings height. Silverman has shown that the Faltings height for elliptic curves over number fields can be expressed in terms of modular…
Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…
Random projections are random linear maps, sampled from appropriate distributions, that approx- imately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows. The well-known…
In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of…
In this note, we give an overview of a new technique for studying Brill--Noether curves in projective space via degeneration. In particular, we give a roadmap to the proof of the Maximal Rank Conjecture.