Related papers: On sublattice determinants in reduced bases

We present a class of lattices in R^d (d >= 2) which we call GL-lattices and conjecture that any lattice is such. This conjecture is referred to as GLC. Littlewood's conjecture amounts to saying that Z^2 is GL. We then prove existence of GL…

Robust low-rank matrix estimation is a topic of increasing interest, with promising applications in a variety of fields, from computer vision to data mining and recommender systems. Recent theoretical results establish the ability of such…

We show that, given some lacunary sequence of angles $\mathbf{\theta}=(\theta_j)_{j\in\N}$ not converging too fast to zero, it is possible to build a rare differentiation basis $\mathcal{B}$ of rectangles parallel to the axes that…

We introduce higher order variants of the Yang-Mills functional that involve $(n-2)$th order derivatives of the curvature. We prove coercivity and smoothness of critical points in Uhlenbeck gauge in dimensions $\mathrm{dim}M\le 2n$. These…

We extend Elitzur's theorem to systems with symmetries intermediate between global and local. In general, our theorem formalizes the idea of {\it dimensional reduction}. We apply the results of this generalization to many systems that are…

The estimation of parameters in a linear model is considered under the hypothesis that the noise, with finite second order statistics, can be represented in a given deterministic basis by random coefficients. An extended underdetermined…

We prove that semialgebraic sets of rectangular matrices of a fixed rank, of skew-symmetric matrices of a fixed rank and of real symmetric matrices whose eigenvalues have prescribed multiplicities are minimal submanifolds of the space of…

Monotone operators, especially in the form of subdifferential operators, are of basic importance in optimization. It is well known since Minty, Rockafellar, and Bertsekas-Eckstein that in Hilbert space, monotone operators can be understood…

In this paper, we give a new proof on a Theorem of Tutte which says that the determinants of the adjacency matrices of two hypomorphic graphs are the same. We also study the lowest eigenvectors.

The Lopsided Lov\'{a}sz Local Lemma (LLLL) is a powerful probabilistic principle which has been used in a variety of combinatorial constructions. While originally a general statement about probability spaces, it has recently been…

We prove the density hypothesis for congruence subgroups of an irreducible uniform lattice in $\mathrm{PSL}_2(\mathbb{R})^d$, extending previous results on the spherical density hypothesis to bound multiplicities of non-tempered…

Langrange duality theorems for vector and set optimization problems which are based on an consequent usage of infimum and supremum (in the sense greatest lower and least upper bounds with respect to a partial ordering) have been recently…

The Johnson--Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be flattened to lower dimensions while…

Olkin [3] obtained a neat upper bound for the determinant of a correlation matrix. In this note, we present an extension and improvement of his result.

Generalizing work of Polya, de Bruijn and Newman, we allow the backward heat equation to deform the zeros of quadratic Dirichlet L-functions. There is a real constant \Lambda_Kr (generalizing the de Bruijn-Newman constant \Lambda) such that…

This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…

We perform a detailed analysis of the different forms of the kinematical constraint imposed on the low $x$ evolution that appear in the literature. We find that all of them generate the same leading anti-collinear poles in Mellin space…

It is believed that, in the limit as the conductor tends to infinity, correlations between the zeros of elliptic curve $L$-functions averaged within families follow the distribution laws of the eigenvalues of random matrices drawn from the…

We give a short proof of the log-concavity of the coefficients of the reduced characteristic polynomial of a matroid. The proof uses an extension of the theory of Lorentzian polynomials to convex cones, and reproves the Hodge-Riemann…

We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…