31 research outputs found
Computational Aspects of the Hausdorff Distance in Unbounded Dimension
We study the computational complexity of determining the Hausdorff distance
of two polytopes given in halfspace- or vertex-presentation in arbitrary
dimension. Subsequently, a matching problem is investigated where a convex body
is allowed to be homothetically transformed in order to minimize its Hausdorff
distance to another one. For this problem, we characterize optimal solutions,
deduce a Helly-type theorem and give polynomial time (approximation) algorithms
for polytopes
Random Sampling in Computational Algebra: Helly Numbers and Violator Spaces
This paper transfers a randomized algorithm, originally used in geometric
optimization, to computational problems in commutative algebra. We show that
Clarkson's sampling algorithm can be applied to two problems in computational
algebra: solving large-scale polynomial systems and finding small generating
sets of graded ideals. The cornerstone of our work is showing that the theory
of violator spaces of G\"artner et al.\ applies to polynomial ideal problems.
To show this, one utilizes a Helly-type result for algebraic varieties. The
resulting algorithms have expected runtime linear in the number of input
polynomials, making the ideas interesting for handling systems with very large
numbers of polynomials, but whose rank in the vector space of polynomials is
small (e.g., when the number of variables and degree is constant).Comment: Minor edits, added two references; results unchange
Colorful and Quantitative Variations of Krasnosselsky's Theorem
Krasnosselsky's art gallery theorem gives a combinatorial characterization of
star-shaped sets in Euclidean spaces, similar to Helly's characterization of
finite families of convex sets with non-empty intersection. We study colorful
and quantitative variations of Krasnosselsky's result. In particular, we are
interested in conditions on a set that guarantee there exists a measurably
large set such that every point in can see every point in . We
prove results guaranteeing the existence of with large volume or large
diameter.Comment: 12 pages, 4 Figure
Violator Spaces: Structure and Algorithms
Sharir and Welzl introduced an abstract framework for optimization problems,
called LP-type problems or also generalized linear programming problems, which
proved useful in algorithm design. We define a new, and as we believe, simpler
and more natural framework: violator spaces, which constitute a proper
generalization of LP-type problems. We show that Clarkson's randomized
algorithms for low-dimensional linear programming work in the context of
violator spaces. For example, in this way we obtain the fastest known algorithm
for the P-matrix generalized linear complementarity problem with a constant
number of blocks. We also give two new characterizations of LP-type problems:
they are equivalent to acyclic violator spaces, as well as to concrete LP-type
problems (informally, the constraints in a concrete LP-type problem are subsets
of a linearly ordered ground set, and the value of a set of constraints is the
minimum of its intersection).Comment: 28 pages, 5 figures, extended abstract was presented at ESA 2006;
author spelling fixe
LIPIcs, Volume 258, SoCG 2023, Complete Volume
LIPIcs, Volume 258, SoCG 2023, Complete Volum
Discrete Geometry
A number of important recent developments in various branches of discrete geometry were presented at the workshop. The presentations illustrated both the diversity of the area and its strong connections to other fields of mathematics such as topology, combinatorics or algebraic geometry. The open questions abound and many of the results presented were obtained by young researchers, confirming the great vitality of discrete geometry
Hierarchically hyperbolic spaces I: curve complexes for cubical groups
In the context of CAT(0) cubical groups, we develop an analogue of the theory
of curve complexes and subsurface projections. The role of the subsurfaces is
played by a collection of convex subcomplexes called a \emph{factor system},
and the role of the curve graph is played by the \emph{contact graph}. There
are a number of close parallels between the contact graph and the curve graph,
including hyperbolicity, acylindricity of the action, the existence of
hierarchy paths, and a Masur--Minsky-style distance formula.
We then define a \emph{hierarchically hyperbolic space}; the class of such
spaces includes a wide class of cubical groups (including all virtually compact
special groups) as well as mapping class groups and Teichm\"{u}ller space with
any of the standard metrics. We deduce a number of results about these spaces,
all of which are new for cubical or mapping class groups, and most of which are
new for both. We show that the quasi-Lipschitz image from a ball in a nilpotent
Lie group into a hierarchically hyperbolic space lies close to a product of
hierarchy geodesics. We also prove a rank theorem for hierarchically hyperbolic
spaces; this generalizes results of Behrstock--Minsky, Eskin--Masur--Rafi,
Hamenst\"{a}dt, and Kleiner. We finally prove that each hierarchically
hyperbolic group admits an acylindrical action on a hyperbolic space. This
acylindricity result is new for cubical groups, in which case the hyperbolic
space admitting the action is the contact graph; in the case of the mapping
class group, this provides a new proof of a theorem of Bowditch.Comment: To appear in "Geometry and Topology". This version incorporates the
referee's comment