ترغب بنشر مسار تعليمي؟ اضغط هنا

Systolic inequalities for the number of vertices

135   0   0.0 ( 0 )
 نشر من قبل Roman Karasev
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian case, where the inequality holds under a topological assumption of ``essentiality, our proofs rely on a combinatorial analogue of that assumption. Under a stronger assumption, expressed in terms of cohomology cup-length, we improve our results quantitatively. We also illustrate our methods in the continuous setting, generalizing and improving quantitatively the Minkowski principle of Balacheff and Karam; a corollary of this result is the extension of the Guth--Nakamura cup-length systolic bound from manifolds to complexes.



قيم البحث

اقرأ أيضاً

76 - Yu-Wei Fan 2018
We introduce the notions of categorical systoles and categorical volumes of Bridgeland stability conditions on triangulated categories. We prove that for any projective K3 surface, there exists a constant C depending only on the rank and discriminant of its Picard group, such that $$mathrm{sys}(sigma)^2leq Ccdotmathrm{vol}(sigma)$$ holds for any stability condition on the derived category of coherent sheaves on the K3 surface. This is an algebro-geometric generalization of a classical systolic inequality on two-tori. We also discuss applications of this inequality in symplectic geometry.
We study the class of (locally) anti-blocking bodies as well as some associated classes of convex bodies. For these bodies, we prove geometric inequalities regarding volumes and mixed volumes, including Godbersons conjecture, near-optimal bounds on M ahler volumes, Saint-Raymond-type inequalities on mixed volumes, and reverse Kleitman inequalities for mixed volumes. We apply our results to the combinatorics of posets and prove Sidorenko-type inequalities for linear extensions of pairs of 2-dimensional posets. The results rely on some elegant decompositions of differences of anti-blocking bodies, which turn out to hold for anti-blocking bodies with respect to general polyhedral cones.
We develop an intrinsic necessary and sufficient condition for single-vertex origami crease patterns to be able to fold rigidly. We classify such patterns in the case where the creases are pre-assigned to be mountains and valleys as well as in the un assigned case. We also illustrate the utility of this result by applying it to the new concept of minimal forcing sets for rigid origami models, which are the smallest collection of creases that, when folded, will force all the other creases to fold in a prescribed way.
118 - Alexey Balitskiy 2020
If a convex body $K subset mathbb{R}^n$ is covered by the union of convex bodies $C_1, ldots, C_N$, multiple subadditivity questions can be asked. Two classical results regard the subadditivity of the width (the smallest distance between two parallel hyperplanes that sandwich $K$) and the inradius (the largest radius of a ball contained in $K$): the sum of the widths of the $C_i$ is at least the width of $K$ (this is the plank theorem of Thoger Bang), and the sum of the inradii of the $C_i$ is at least the inradius of $K$ (this is due to Vladimir Kadets). We adapt the existing proofs of these results to prove a theorem on coverings by certain generalized non-convex multi-planks. One corollary of this approach is a family of inequalities interpolating between Bangs theorem and Kadetss theorem. Other corollaries include results reminiscent of the Davenport--Alexander problem, such as the following: if an $m$-slice pizza cutter (that is, the union of $m$ equiangular rays in the plane with the same endpoint) in applied $N$ times to the unit disk, then there will be a piece of the partition of inradius at least $frac{sin pi/m}{N + sin pi/m}$.
Monskys theorem from 1970 states that a square cannot be dissected into an odd number of triangles of the same area, but it does not give a lower bound for the area differences that must occur. We extend Monskys theorem to constrained framed maps; based on this we can apply a gap theorem from semi-algebraic geometry to a polynomial area difference measure and thus get a lower bound for the area differences that decreases doubly-exponentially with the number of triangles. On the other hand, we obtain the first superpolynomial upper bounds for this problem, derived from an explicit construction that uses the Thue-Morse sequence.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا