English
Related papers

Related papers: Bounds on Area Involving Lattice Size

200 papers

It is shown that solutions of the Neumann problem for the Poisson equation in an arbitrary convex $n$-dimensional domain are uniformly Lipschitz. Applications of this result to some aspects of regularity of solutions to the Neumann problem…

Analysis of PDEs · Mathematics 2008-11-07 Vladimir Maz'ya

Given a convex body K in R^n and p in R, we introduce and study the extremal inner and outer affine surface areas IS_p(K) = sup_{K'\subseteq K} (as_p(K') ) and os_p(K)=inf_{K'\supseteq K} (as_p(K') ), where as_p(K') denotes the L_p-affine…

Functional Analysis · Mathematics 2020-02-26 O. Giladi , H. Huang , C. Schütt , E. M. Werner

In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum $P_1+\dots+P_d$ of $d$-dimensional lattice polytopes is bounded from above by a…

Metric Geometry · Mathematics 2020-12-22 Gennadiy Averkov , Christopher Borger , Ivan Soprunov

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c$ that to the interior of $\mathcal{P}$. It follows from a lower…

Combinatorics · Mathematics 2023-01-25 Ichiro Sainose , Ginji Hamano , Tatsuo Emura , Takayuki Hibi

Minkowski's second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski's bound by replacing the volume by the lattice point…

Metric Geometry · Mathematics 2010-11-09 Christian Bey , Martin Henk , Matthias Henze , Eva Linke

We study the exact solution of the two-body problem on a tight-binding one-dimensional lattice, with pairwise interaction potentials which have an arbitrary but finite range. We show how to obtain the full spectrum, the bound and scattering…

Other Condensed Matter · Physics 2015-05-18 Manuel Valiente

This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…

Number Theory · Mathematics 2016-01-08 Jens-Dietrich Bauch

Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…

Representation Theory · Mathematics 2018-05-25 Fahimeh Sadat Fotouhi , Alex Martsinkovsky , Shokrollah Salarian

We prove an Allard-type regularity theorem for free-boundary minimal surfaces in Lipschitz domains locally modelled on convex polyhedra. We show that if such a minimal surface is sufficiently close to an appropriate free-boundary plane,…

Differential Geometry · Mathematics 2021-05-27 Nicholas Edelen , Chao Li

In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…

Information Theory · Computer Science 2015-06-26 Ivan Soprunov

In 2021, Henk, Schymura and Xue introduced packing minima, associated with a convex body and a lattice, as packing counterparts to the covering minima of Kannan and Lov\'asz. Motivated by conjectures on the volume inequalities for the…

Metric Geometry · Mathematics 2026-01-21 Mei Han , Martin Henk , Fei Xue

We show that every planar convex body is contained in a quadrangle whose area is less than $(1 - 2.6 \cdot 10^{-7}) \sqrt{2}$ times the area of the original convex body, improving the best known upper bound by W. Kuperberg.

Metric Geometry · Mathematics 2026-04-13 Ferenc Fodor , Florian Grundbacher

In an earlier work, the first author and Petsche used potential theoretic techniques to establish a lower bound for the height of algebraic numbers that satisfy splitting conditions, such as being totally real or p-adic, improving on…

Number Theory · Mathematics 2021-05-11 Paul Fili , Lukas Pottmeyer

This is an expository paper intended to introduce the polynomial time lattice basis reduction algorithm first described by Arjen Lenstra, Hendrik Lenstra, and L\'aszl\'o Lov\'asz in 1982. We begin by introducing the shortest vector problem,…

Number Theory · Mathematics 2024-11-22 Alex Kalbach , Ted Chinburg

For a convex body B in three-dimensional Euclidean space, which is invariant under rotations around one coordinate axis and has a smooth boundary of bounded nonzero curvature, the lattice point discrepancy (number of integer points minus…

Number Theory · Mathematics 2007-05-23 Manfred Kühleitner , Werner Georg Nowak

We show that the number of lattice directions in which a d-dimensional convex body in R^d has minimum width is at most 3^d-1, with equality only for the regular cross-polytope. This is deduced from a sharpened version of the 3^d-theorem due…

Combinatorics · Mathematics 2017-10-10 Jan Draisma , Tyrrell B. McAllister , Benjamin Nill

Considering the Teichm\"uller space of a surface equipped with Thurston's Lipschitz metric, we study geodesic segments whose endpoints have bounded combinatorics. We show that these geodesics are cobounded, and that the closest-point…

Geometric Topology · Mathematics 2011-09-15 Anna Lenzhen , Kasra Rafi , Jing Tao

Given a lattice polygon $P$ with $g$ interior lattice points, we associate to it the moduli space of tropical curves of genus $g$ with Newton polygon $P$. We completely classify the possible dimensions such a moduli space can have. For…

In this paper we continue the study of compact-like operators in lattice normed spaces started recently by Aydin, Emelyanov, Erkur\c{s}un \"Ozcand and Marabeh. We show among others, that every p-compact operator between lattice normed…

Functional Analysis · Mathematics 2019-03-04 Youssef Azouzi , Mohamed Amine Ben Amor

Let $P$ be a rational polyhedron in $\mathbb{R}^d$ and let $\mathcal{L}$ be a class of $d$-dimensional maximal lattice-free rational polyhedra in $\mathbb{R}^d$. For $L \in \mathcal{L}$ by $R_L(P)$ we denote the convex hull of points…

Optimization and Control · Mathematics 2012-08-21 Gennadiy Averkov
‹ Prev 1 3 4 5 6 7 10 Next ›