3,725 research outputs found
The infinite cyclohedron and its automorphism group
Cyclohedra are a well-known infinite familiy of finite-dimensional polytopes
that can be constructed from centrally symmetric triangulations of even-sided
polygons. In this article we introduce an infinite-dimensional analogue and
prove that the group of symmetries of our construction is a semidirect product
of a degree 2 central extension of Thompson's infinite finitely presented
simple group T with the cyclic group of order 2. These results are inspired by
a similar recent analysis by the first author of the automorphism group of an
infinite-dimensional associahedron.Comment: 18 pages, 8 figure
On -Gons and -Holes in Point Sets
We consider a variation of the classical Erd\H{o}s-Szekeres problems on the
existence and number of convex -gons and -holes (empty -gons) in a set
of points in the plane. Allowing the -gons to be non-convex, we show
bounds and structural results on maximizing and minimizing their numbers. Most
noteworthy, for any and sufficiently large , we give a quadratic lower
bound for the number of -holes, and show that this number is maximized by
sets in convex position
Byzantine Approximate Agreement on Graphs
Consider a distributed system with n processors out of which f can be Byzantine faulty. In the approximate agreement task, each processor i receives an input value x_i and has to decide on an output value y_i such that
1) the output values are in the convex hull of the non-faulty processors\u27 input values,
2) the output values are within distance d of each other.
Classically, the values are assumed to be from an m-dimensional Euclidean space, where m >= 1.
In this work, we study the task in a discrete setting, where input values with some structure expressible as a graph. Namely, the input values are vertices of a finite graph G and the goal is to output vertices that are within distance d of each other in G, but still remain in the graph-induced convex hull of the input values. For d=0, the task reduces to consensus and cannot be solved with a deterministic algorithm in an asynchronous system even with a single crash fault. For any d >= 1, we show that the task is solvable in asynchronous systems when G is chordal and n > (omega+1)f, where omega is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a variant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact variants of these and related tasks over a large class of combinatorial structures
Two properties of volume growth entropy in Hilbert geometry
The aim of this paper is to provide two examples in Hilbert geometry which
show that volume growth entropy is not always a limit on the one hand, and that
it may vanish for a non-polygonal domain in the plane on the other hand
- …