Related papers: Classifying SL$_2$-tilings
The paper contains enumerative combinatorics for positive braids, square free braids, and simple braids, emphasizing connections with classical Fibonacci sequence. The simple subgraph of the Cayley graph of the braid group is analyzed in…
The current computer architecture has moved towards the multi/many-core structure. However, the algorithms in the current sequential dense numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multi/many-core…
Building on the work of the fourth author in math.AG/9904074, we prove the weak factorization conjecture for birational maps in characteristic zero: a birational map between complete nonsingular varieties over an algebraically closed field…
In this work, we consider tilings of the Hamming cube and look for metrics which turn the tilings into a perfect code. We consider the family of metrics which are determined by a weight and are compatible with the support of vectors…
We present a new family of zero-field Ising models over $N$ binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components and subsets of at most three vertices into a tree. The polynomial-time algorithm of…
We construct via usual graph theory a class of associative dialgebras as well as a class of coassociative L-coalgebras. Tiling of the (n^2,1)-De bruijn graphs are also obtained and constructions of cubical trialgebras, (notion defined by…
Periodic tilings play a role in the decorative arts, in construction and in crystal structures. Combinatorial tiling theory allows the systematic generation, visualization and exploration of such tilings of the plane, sphere and hyperbolic…
This paper continues the study of cluster algebras initiated in math.RT/0104151. Its main result is the complete classification of the cluster algebras of finite type, i.e., those with finitely many clusters. This classification turns out…
In this note we use techniques in the topology of 2-complexes to recast some tools that have arisen in the study of planar tiling questions. With spherical pictures we show that the tile counting group associated to a set $T$ of tiles and a…
We introduce a partial decidability protocol for the Wang tiling problem (which is the prototype of undecidable problems in combinatorics and statistical physics) by constructing a suitable mapping from tilings of finite squares of…
It has been proven that the lozenge tilings of a quartered hexagon on the triangular lattice are enumerated by a simple product formula. In this paper we give a new proof for the tiling formula by using Kuo's graphical condensation. Our…
Floor diagrams are a class of weighted oriented graphs introduced by E. Brugalle and the second author. Tropical geometry arguments lead to combinatorial descriptions of (ordinary and relative) Gromov-Witten invariants of projective spaces…
We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…
Let (W,S) be a Coxeter system of affine type D, and let TL(W) the corresponding generalized Temperley-Lieb algebra. In this extended abstract we define an infinite dimensional associative algebra made of decorated diagrams which is…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
We review the recent construction \cite{brower2024isingmodelmathbbs2} of the 2d Ising model on a triangulated sphere $\mathbb{S}^2$. Surprisingly, this led to a precise map of the lattice couplings to the target geometry in order to reach…
Conjecturally, a knot in the 3-sphere has only finitely many non-integer non-characterizing slopes. We verify this conjecture for all knots with knot Floer homology satisfying certain simplicity conditions. The class of knots satisfying our…
Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…
We compute the tensor triangular spectrum of perfect complexes of filtered modules over a commutative ring, and deduce a classification of the thick tensor ideals. We give two proofs: one by reducing to perfect complexes of graded modules…
Lattice gauge theories of permutation groups with a simple topological action (henceforth permutation-TFTs) have recently found several applications in the combinatorics of quantum field theories (QFTs). They have been used to solve…