Related papers: Homology in Combinatorial Refraction Billiards

We define billiards in the context of sub-Finsler Geometry. We provide symplectic and variational (or rather, control theoretical) descriptions of the problem and show that they coincide. We then discuss several phenomena in this setting,…

We study the following combinatorial game played by two players, Alice and Bob, which generalizes the Pizza game considered by Brown, Winkler and others. Given a connected graph G with nonnegative weights assigned to its vertices, the…

In this paper, we study a class of graph drawings that arise from bobbin lace patterns. The drawings are periodic and require a combinatorial embedding with specific properties which we outline and demonstrate can be verified in linear…

In the graph avoidance game two players alternatingly color edges of a graph G in red and in blue respectively. The player who first creates a monochromatic subgraph isomorphic to a forbidden graph F loses. A symmetric strategy of the…

We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows.…

Given a vertex-weighted oriented graph, we can associate to it a set of monomials. We consider the toric ideal whose defining map is given by these monomials. We find a generating set for the toric ideal for certain classes of graphs which…

We show that the dimer model on a bipartite graph on a torus gives rise to a quantum integrable system of special type - a cluster integrable system. The phase space of the classical system contains, as an open dense subset, the moduli…

Much of dynamical algebraic combinatorics focuses on global dynamical systems defined via maps that are compositions of local toggle operators. The second author and Roby studied such maps that result from toggling independent sets of a…

The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…

Traditionally, rotation numbers for toroidal billiard flows are defined as the limiting vectors of average displacements per time on trajectory segments. Naturally, these creatures are living in the (commutative) vector space $\real^n$, if…

We give lowed bounds on the number of periodic trajectories in strictly convex smooth billiards in $\R^{m+1}$ for $m\ge 3$. For plane billiards (when m=1) such bounds were obtained by G. Birkhoff in the 1920's. Our proof is based on…

A caustic of a strictly convex planar bounded billiard is a smooth curve whose tangent lines are reflected from the billiard boundary to its tangent lines. The famous Birkhoff Conjecture states that if the billiard boundary has an inner…

In this paper, we study visibility representations of graphs that are embedded on a torus or a Klein bottle. Mohar and Rosenstiehl showed that any toroidal graph has a visibility representation on a flat torus bounded by a parallelogram,…

The pseudo-integrable barrier billiard invented by Hannay and McCraw [J. Phys. A 23, 887 (1990)] -- rectangular billiard with line-segment barrier placed on a symmetry axis -- is generalized. It is proven that the flow on invariant surfaces…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and…

In this paper, we introduce new combinatorial invariants of any finite simple graph, which arise in toric topology. We compute the $i$-th (rational) Betti number and Euler characteristic of the real toric variety associated to a graph…

We investigate how to find generic and globally rigid realizations of graphs in $\mathbb{R}^d$ based on elementary geometric observations. Our arguments lead to new proofs of a combinatorial characterization of the global rigidity of graphs…

For a collection $\mathbf{G}=\{G_1,\dots, G_s\}$ of not necessarily distinct graphs on the same vertex set $V$, a graph $H$ with vertices in $V$ is a $\mathbf{G}$-transversal if there exists a bijection $\phi:E(H)\rightarrow [s]$ such that…

A graph G is intrinsically S^1-linked if for every embedding of the vertices of G into S^1, vertices that form the endpoints of two disjoint edges in G form a non-split link in the embedding. We show that a graph is intrinsically S^1-linked…

In this paper we prove that in any analytic one-parameter family of twist maps of the annulus, homotopically invariant curves filled with periodic points corresponding to a given rotation number, either exist for all values of the…