Discrete tomography: Magic numbers for NN-fold symmetry

We consider the problem of distinguishing convex subsets of $n$-cyclotomic model sets $\varLambda$ by (discrete parallel) X-rays in prescribed $\varLambda$-directions. In this context, a `magic number' $m_{\varLambda}$ has the property that any two convex subsets of $\varLambda$ can be distinguished by their X-rays in any set of $m_{\varLambda}$ prescribed $\varLambda$-directions. Recent calculations suggest that (with one exception in the case $n=4$) the least possible magic number for $n$-cyclotomic model sets might just be $N+1$, where $N=\operatorname{lcm}(n,2)$.Comment: 5 pages, 2 figures; new computer calculations based on the results of arXiv:1101.4149 and arXiv:1211.6318; presented at ICQ 12 (Cracow, Poland

Magic numbers in the discrete tomography of cyclotomic model sets

We report recent progress in the problem of distinguishing convex subsets of cyclotomic model sets $\varLambda$ by (discrete parallel) X-rays in prescribed $\varLambda$-directions. It turns out that for any of these model sets $\varLambda$ there exists a `magic number' $m_{\varLambda}$ such that any two convex subsets of $\varLambda$ can be distinguished by their X-rays in any set of $m_{\varLambda}$ prescribed $\varLambda$-directions. In particular, for pentagonal, octagonal, decagonal and dodecagonal model sets, the least possible numbers are in that very order 11, 9, 11 and 13.Comment: 6 pages, 1 figure; based on the results of arXiv:1101.4149 [math.MG]; presented at Aperiodic 2012 (Cairns, Australia

Balanced partitions of 3-colored geometric sets in the plane

Let SS be a finite set of geometric objects partitioned into classes or colors . A subset S'¿SS'¿S is said to be balanced if S'S' contains the same amount of elements of SS from each of the colors. We study several problems on partitioning 33-colored sets of points and lines in the plane into two balanced subsets: (a) We prove that for every 3-colored arrangement of lines there exists a segment that intersects exactly one line of each color, and that when there are 2m2m lines of each color, there is a segment intercepting mm lines of each color. (b) Given nn red points, nn blue points and nn green points on any closed Jordan curve ¿¿, we show that for every integer kk with 0=k=n0=k=n there is a pair of disjoint intervals on ¿¿ whose union contains exactly kk points of each color. (c) Given a set SS of nn red points, nn blue points and nn green points in the integer lattice satisfying certain constraints, there exist two rays with common apex, one vertical and one horizontal, whose union splits the plane into two regions, each one containing a balanced subset of SS.Peer ReviewedPostprint (published version

Solution of a uniqueness problem in the discrete tomography of algebraic Delone sets

We consider algebraic Delone sets $\varLambda$ in the Euclidean plane and address the problem of distinguishing convex subsets of $\varLambda$ by X-rays in prescribed $\varLambda$-directions, i.e., directions parallel to nonzero interpoint vectors of $\varLambda$. Here, an X-ray in direction $u$ of a finite set gives the number of points in the set on each line parallel to $u$. It is shown that for any algebraic Delone set $\varLambda$ there are four prescribed $\varLambda$-directions such that any two convex subsets of $\varLambda$ can be distinguished by the corresponding X-rays. We further prove the existence of a natural number $c_{\varLambda}$ such that any two convex subsets of $\varLambda$ can be distinguished by their X-rays in any set of $c_{\varLambda}$ prescribed $\varLambda$-directions. In particular, this extends a well-known result of Gardner and Gritzmann on the corresponding problem for planar lattices to nonperiodic cases that are relevant in quasicrystallography.Comment: 21 pages, 1 figur

Happy endings for flip graphs

We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of lattices, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently.Comment: 26 pages, 15 figures. Revised and expanded for journal publicatio

Discrete automorphism groups of convex cones of finite type

We investigate subgroups of SL (n,Z) which preserve an open nondegenerate convex cone in real n-space and admit in that cone as fundamental domain a polyhedral cone of which some faces are allowed to lie on the boundary. Examples are arithmetic groups acting on selfdual cones, Weyl groups of certain Kac-Moody algebras and do occur in algebraic geometry as the automorphism groups of projective manifolds acting on their ample cones.Comment: 30 pages, to appear in Compositio Mat

The Triangle Closure is a Polyhedron

Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with certain families of lattice-free sets are polyhedra. For a long time, the only result known was the celebrated theorem of Cook, Kannan and Schrijver who showed that the split closure is a polyhedron. Although some fairly general results were obtained by Andersen, Louveaux and Weismantel [ An analysis of mixed integer linear sets based on lattice point free convex sets, Math. Oper. Res. 35 (2010), 233--256] and Averkov [On finitely generated closures in the theory of cutting planes, Discrete Optimization 9 (2012), no. 4, 209--215], some basic questions have remained unresolved. For example, maximal lattice-free triangles are the natural family to study beyond the family of splits and it has been a standing open problem to decide whether the triangle closure is a polyhedron. In this paper, we show that when the number of integer variables $m=2$ the triangle closure is indeed a polyhedron and its number of facets can be bounded by a polynomial in the size of the input data. The techniques of this proof are also used to give a refinement of necessary conditions for valid inequalities being facet-defining due to Cornu\'ejols and Margot [On the facets of mixed integer programs with two integer variables and two constraints, Mathematical Programming 120 (2009), 429--456] and obtain polynomial complexity results about the mixed integer hull.Comment: 39 pages; made self-contained by merging material from arXiv:1107.5068v