361 research outputs found
Quantitative Tverberg theorems over lattices and other discrete sets
This paper presents a new variation of Tverberg's theorem. Given a discrete
set of , we study the number of points of needed to guarantee the
existence of an -partition of the points such that the intersection of the
convex hulls of the parts contains at least points of . The proofs
of the main results require new quantitative versions of Helly's and
Carath\'eodory's theorems.Comment: 16 pages. arXiv admin note: substantial text overlap with
arXiv:1503.0611
Transversal numbers over subsets of linear spaces
Let be a subset of . It is an important question in the
theory of linear inequalities to estimate the minimal number such that
every system of linear inequalities which is infeasible over has a
subsystem of at most inequalities which is already infeasible over
This number is said to be the Helly number of In view of Helly's
theorem, and, by the theorem due to Doignon, Bell and
Scarf, We give a common extension of these equalities
showing that We show that
the fractional Helly number of the space (with the
convexity structure induced by ) is at most as long as
is finite. Finally we give estimates for the Radon number of mixed
integer spaces
Quantitative Tverberg, Helly, & Carath\'eodory theorems
This paper presents sixteen quantitative versions of the classic Tverberg,
Helly, & Caratheodory theorems in combinatorial convexity. Our results include
measurable or enumerable information in the hypothesis and the conclusion.
Typical measurements include the volume, the diameter, or the number of points
in a lattice.Comment: 33 page
Helly-type problems
In this paper we present a variety of problems in the interface between combinatorics and geometry around the theorems of Helly, Radon, Carathéodory, and Tverberg. Through these problems we describe the fascinating area of Helly-type theorems and explain some of their main themes and goals
Discrete Geometry (hybrid meeting)
A number of important recent developments in various branches of
discrete geometry were presented at the workshop, which took place in
hybrid format due to a pandemic situation. The presentations
illustrated both the diversity of the area and its strong connections
to other fields of mathematics such as topology, combinatorics,
algebraic geometry or functional analysis. The open questions abound
and many of the results presented were obtained by young researchers,
confirming the great vitality of discrete geometry
Stability of Kronecker coefficients via discrete tomography
In this paper we give a new sufficient condition for a general stability of
Kronecker coefficients, which we call it additive stability. It was motivated
by a recent talk of J. Stembridge at the conference in honor of Richard P.
Stanley's 70th birthday, and it is based on work of the author on discrete
tomography along the years. The main contribution of this paper is the
discovery of the connection between additivity of integer matrices and
stability of Kronecker coefficients. Additivity, in our context, is a concept
from discrete tomography. Its advantage is that it is very easy to produce lots
of examples of additive matrices and therefore of new instances of stability
properties. We also show that Stembridge's hypothesis and additivity are
closely related, and prove that all stability properties of Kronecker
coefficients discovered before fit into additive stability.Comment: 22 page
- …