Related papers: Transformed flips in triangulations and matchings
We characterize mutation-finite cluster algebras of rank at least 3 using positive semi-definite quadratic forms. In particular, we associate with every unpunctured bordered surface a positive semi-definite quadratic space $V$, and with…
The shifting numbers measure the asymptotic amount by which an endofunctor of a triangulated category translates inside the category, and are analogous to Poincare translation numbers that are widely used in dynamical systems. Motivated by…
This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…
We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…
We show that any multiplicative bijection between the algebras of differentiable functions, defined on differentiable manifolds of positive dimension, is an algebra isomorphism, given by composition with a unique diffeomorphism.
There is a natural generalization of domino tilings to tilings of a polygon by hexagons, or, dually, configurations of oriented curves that meet in triples. We show exactly when two such tilings can be connected by a series of moves…
Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce…
A set of n segments in the plane may form a Euclidean TSP tour, a tree, or a matching, among others. Optimal TSP tours as well as minimum spanning trees and perfect matchings have no crossing segments, but several heuristics and…
We present a direct bijection between descending plane partitions with no special parts and permutation matrices. This bijection has the desirable property that the number of parts of the descending plane partition corresponds to the…
Additive deformations of bialgebras in the sense of J. Wirth, i.e. deformations of the multiplication map fulfilling a certain compatibility condition w.r.t. the coalgebra structure, can be generalized to braided bialgebras. The theorems…
For triangulations generated by the adaptive bisection algorithm by Maubach and Traxler we prove existence of a regularized mesh function with grading two. This sharpens previous results in two dimensions for the newest vertex bisection and…
We prove a bijection between the triangulations of the 3-dimensional cyclic polytope C(n+2, 3) and persistent graphs with n vertices. We show that under this bijection the Stasheff-Tamari orders on triangulations naturally translate to…
A bisection line divides a convex planar curve into two parts with equal areas. It is natural to study the envelope of these lines, which in general present singularities. The polygonal case is particularly inte\-resting, since there are…
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdos and Renyi about perfect matchings in random bipartite graphs.…
For a drawing of a labeled graph, the rotation of a vertex or crossing is the cyclic order of its incident edges, represented by the labels of their other endpoints. The extended rotation system (ERS) of the drawing is the collection of the…
We show that each perfect matching in a bipartite graph $G$ intersects at least half of the perfect matchings in $G$. This result has equivalent formulations in terms of the permanent of the adjacency matrix of a graph, and in terms of…
We review aspects of an important paper by Robert Strichartz concerning reverse iterated function systems (i.f.s.) and fractal blowups. We compare the invariant sets of reverse i.f.s. with those of more standard i.f.s. and with those of…
We describe an approach to finding a bijection between Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions, which is based on the Schutzenberger involution. In particular we give an explicit bijection between…
We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus $g$ with a single boundary…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…