Related papers: Introducing the Plaid Model

We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.

In the article "Construction of the continuous hull for the combinatorics of a regular pentagonal tiling of the plane" we constructed the continuous hull for the combinatorics of "A regular pentagonal tiling of the plane", and in the…

This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…

We determine the topology of the moduli space of periodic tilings of the plane by parallelograms. To each such tiling, we associate combinatorial data via the zone curves of the tiling. We show that all tilings with the same combinatorial…

We introduce a new method for estimating the growth of various quantities arising in dynamical systems. We apply our method to polygonal billiards on surfaces of constant curvature. For instance, we obtain power bounds of degree two plus…

We construct Birkhoff cones for dispersing billiards, which are contracted by the action of the transfer operator. This construction permits the study of statistical properties not only of regular dispersing billiards but also of sequential…

We introduce combinatorial objects named matricubes that provide a generalization of the theory of matroids. As matroids provide a combinatorial axiomatization of hyperplane arrangements, matricubes provide a combinatorial axiomatization of…

Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…

White's conjecture asserts that any two tuples of matroid bases that have the same multi-set union can be transformed from one to another by symmetric exchanges; it also implies that the toric ideals of matroids are generated by the…

Partial combinatory algebras are algebraic structures that serve as generalized models of computation. In this paper, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene's models, of…

Motivated by work of the first author, this paper studies symplectic embedding problems of lagrangian products that are sufficiently symmetric. In general, lagrangian products arise naturally in the study of billiards. The main result of…

A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…

A multidimensional basis of p-adic wavelets is constructed. The relation of the constructed basis to a system of coherent states (i.e. orbit of action) for some $p$-adic group of linear transformations is discussed. We show that the set of…

We consider polygons with the following ``pairing property'': for each edge of the polygon there is precisely one other edge parallel to it. We study the problem of when such a polygon $K$ tiles the plane multiply when translated at the…

This survey is about combinatorial objects related to reflection groups and their applications in representation theory and arithmetic geometry. Coxeter groups and folded galleries in Coxeter complexes are introduced in detail and…

A variety of mesoscopic systems can be represented as a billiard with a random coupling to the exterior at the boundary. Examples include quantum dots with multiple leads, quantum corrals with different kinds of atoms forming the boundary,…

In the present paper we introduce a new generating function for outer billiards in the plane. Using this generating function, we prove the following rigidity result: if the vicinity of the smooth convex plane curve $\gamma$ of positive…

We find an explicit combinatorial gradient vector field on the well known complex S (Salvetti complex) which models the complement to an arrangement of complexified hyperplanes. The argument uses a total ordering on the facets of the…

We develop a framework for dealing with smooth approximations to billiards with corners in the two-dimensional setting. Let a polygonal trajectory in a billiard start and end up at the same billiard's corner point. We prove that smooth…

Several examples of pairs of isospectral planar domains have been produced in the two-dimensional Euclidean space by various methods. We show that all these examples rely on the symmetry between points and blocks in finite projective…