Related papers: On sublattice determinants in reduced bases
The Lenstra-Lenstra-Lov\'asz (LLL) algorithm is the most practical lattice reduction algorithm in digital communications. In this paper, several variants of the LLL algorithm with either lower theoretic complexity or fixed-complexity…
We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…
In this work, the notions of normal cones at infinity to unbounded sets and limiting and singular subdifferentials at infinity for extended real value functions are introduced. Various calculus rules for these notions objects are…
We prove inequalities that compare the relative regulator of an extension of number fields with a product of heights of multiplicatively independent relative units.
New isoperimetric inequalities for lower order eigenvalues of the Laplacian on closed hypersurfaces, of the biharmonic Steklov problems and of the Wentzell-Laplace on bounded domains in a Euclidean space are proven. Some open questions for…
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
In this survey we give a compact presentation of well-known functional inequalities of Hardy and Rellich type in the $L^2$ setting. In addition, we give some insights of their proofs by using standard and basic tools such as the method of…
In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced by the author in complexity classification of minimum…
We revisit Pavlov's characterization for Riesz bases of exponentials and study the corresponding lower Riesz basis bounds. In particular, this approach allows us to improve on known estimates for the bounds in Avdonin's theorem regarding…
Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been…
In this short article, some properties of matrices of moving least-squares approximation have been proven.The used technique is based on singular-value decomposition and inequalities for singular-values. Some inequalities for the norm of…
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…
The existence of unimodular forms with small norms on sequence spaces is crucial in a variety of problems in modern analysis. We prove that the infimum of $\left\Vert A\right\Vert $ over all unimodular $d$-linear (complex or real) forms $A$…
In this note we generalize the main result in [DIV: R. Di Gennaro, G. Ilardi, J. Valles, Singular hypersurfaces characterizing the Lefschetz properties J. Lond. Math. Soc. (2) 89 (2014), no. 1, 194-212] on artinian ideals failing Lefschetz…
The purpose of this work is to extend the classification of planar point configurations with low Waldschmidt constants for all values less than $5/2$. As a consequence we prove a conjecture of Dumnicki, Szemberg and Tutaj-Gasi\'nska…
We prove lower bounds for the Dirichlet Laplacian on possibly unbounded domains in terms of natural geometric conditions. This is used to derive uncertainty principles for low energy functions of general elliptic second order divergence…
Minimal Markov bases of configurations of integer vectors correspond to minimal binomial generating sets of the assocciated lattice ideal. We give necessary and sufficient conditions for the elements of a minimal Markov basis to be (a)…
In this paper we study various Rogers-Shephard type inequalities for the lattice point enumerator $\mathrm{G}_{n}(\cdot)$ on $\mathbb{R}^n$. In particular, for any non-empty convex bounded sets $K,L\subset\mathbb{R}^n$, we show that…
We prove well-posedness for some abstract differential equations of the first order. Our result covers the usual case of Lipschitz composition operators. It also contains the case of some integro-differential operators acting on spaces with…
The determinant lower bound of Lovasz, Spencer, and Vesztergombi [European Journal of Combinatorics, 1986] is a powerful general way to prove lower bounds on the hereditary discrepancy of a set system. In their paper, Lovasz, Spencer, and…