Related papers: On sublattice determinants in reduced bases
We propose and analyse a reduced-rank method for solving least-squares regression problems with infinite dimensional output. We derive learning bounds for our method, and study under which setting statistical performance is improved in…
In this paper we show the surprising results that while the local reach of the boundary of an L1TV minimizer is bounded below by 1/lambda, the global reach can be smaller. We do this by demonstrating several example minimizing sets not…
Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important role in control theory, linear systems theory, and coding theory. It is a common practice to arrange the vectors of any minimal basis as…
A search for sidereal variations in the non-Newtonian force between two tungsten plates separated at millimeter ranges sets experimental limits on Lorentz invariance violation involving quadratic couplings of Riemann curvature. We show that…
We completely characterize the weak differentiability (or, in other words Gateaux differentiability) of the norm in the spaces of bounded multilinear maps. Also, we obtain a multilinear generalization of the well-known Bhatia-\v{S}emrl…
In this paper we give alternate proofs of some well-known matrix inequalities. In particular, we show that under certain conditions the inequality holds \begin{align}\sum \limits_{\lambda_i\in \mathrm{Spec}(ab^{T})}\mathrm{min}\{\log…
We consider a high dimensional linear regression problem where the goal is to efficiently recover an unknown vector $\beta^*$ from $n$ noisy linear observations $Y=X\beta^*+W \in \mathbb{R}^n$, for known $X \in \mathbb{R}^{n \times p}$ and…
We show that for those lattices of Voronoi's first kind, a vector of shortest nonzero Euclidean length can computed in polynomial time by computing a minimum cut in a graph.
Reasoning with minimal models has always been at the core of many knowledge representation techniques, but we still have only a limited understanding of this problem in Description Logics (DLs). Minimization of some selected predicates,…
Let h_R denote an L ^{\infty} normalized Haar function adapted to a dyadic rectangle R contained in the unit cube in dimension d. We establish a non-trivial lower bound on the L^{\infty} norm of the `hyperbolic' sums $$ \sum _{|R|=2 ^{-n}}…
We study the subvariety of singular sections, the discriminant, of a base point free linear system $|L|$ on a smooth toric variety $X$. On one hand we describe pairs $(X,L)$ for which the discriminant is of low dimension. Precisely, we…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
We show general lower semicontinuity and relaxation theorems for linear-growth integral functionals defined on vector measures that satisfy linear PDE side constraints (of arbitrary order). These results generalize several known lower…
In this short note we obtain new lower bounds for the constants of the real Hardy--Littlewood inequality for $m$-linear forms on $\ell_{p}^{2}$ spaces when $p=2m$ and for certain values of $m$. The real and complex cases for the general…
We consider the linear elliptic systems or equations in divergence form with periodically oscillating coefficients. We prove the large-scale boundary Lipschitz estimate for the weak solutions in domains satisfying the so-called…
The concept of a $\lambda$-lattice was introduced by V. Sn\'a\v sel in order to generalize some lattice concepts for directed posets whose elements need not have suprema or infima. We extend the concept of semimodularity from lattices to…
The Gilbert type bound for codes in the title is reviewed, both for small and large alphabets. Constructive lower bounds better than these existential bounds are derived from geometric codes, either over Fp or Fp2 ; or over even degree…
We discuss various forms of the Luxemburg norm in spaces of random vectors with coordinates belonging to the classical Orlicz spaces of exponential type. We prove equivalent relations between some kinds of these forms. We also show when the…
We establish a general normal subgroup theorem for commensurators of lattices in locally compact groups. While the statement is completely elementary, its proof, which rests on the original strategy of Margulis in the case of higher rank…
The Lov\'{a}sz Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos have shown that the LLL gives more than just…