Related papers: Classifying SL$_2$-tilings
We study constrained percolation models on planar lattices including the $[m,4,n,4]$ lattice and the square tilings of the hyperbolic plane, satisfying certain local constraints on faces of degree 4, and investigate the existence of…
Using the non-semisimple Temperley-Lieb calculus, we study the additive and monoidal structure of the category of tilting modules for $\mathrm{SL}_{2}$ in the mixed case. This simultaneously generalizes the semisimple situation, the case of…
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile algorithms, has recently been introduced. Previous research…
Geometric approach to classical and exceptional groups of Lie type has been quite successful and has led to the deveopment of the concept of buildings and polar spaces. The latter have been characterized by simple systems of axioms with a…
We introduce a notion of "simulation" for labelled graphs, in which edges of the simulated graph are realized by regular expressions in the simulating graph, and prove that the tiling problem (aka "domino problem") for the simulating graph…
We develop a method of calculation for the symplectic Floer homology of composite knots. The symplectic Floer homology of knots defined in \cite{li} naturally admits an integer graded lifting, and it formulates a filtration and induced…
A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For…
We investigate the rich combinatorial structure of premodel structures on finite lattices whose weak equivalences are closed under composition. We prove that there is a natural refinement of the inclusion order of weak factorization systems…
We study rank-2 cluster scattering diagrams through moduli spaces of quiver representations and a recently developed combinatorial framework of tight gradings. Combining quiver-theoretic and combinatorial methods, we prove and extend a…
Adaptive binarization methodologies threshold the intensity of the pixels with respect to adjacent pixels exploiting the integral images. In turn, the integral images are generally computed optimally using the summed-area-table algorithm…
Peach introduced rhombal algebras associated to quivers given by tilings of the plane by rhombi. We develop general techniques to analyse rhombal algebras, including a filtration by what we call rhombus modules. We introduce a way to relate…
The combinatorics of tilings of a hexagon of integer side-length $n$ by 120 degree - 60 degree diamonds of side-length 1 has a long history, both directly (as a problem of interest in thermodynamic models) and indirectly (through the…
Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…
Let $\mathbb{X}$ be a weighted projective line and $\operatorname{coh}\mathbb{X}$ the associated categoy of coherent sheaves. We classify the tilting complexes $T$ in $D^b(\operatorname{coh}\mathbb{X})$ such that $\tau^2 T\cong T$, where…
We review briefly the existing vertex-operator-algebraic constructions of various tensor category structures on module categories for affine Lie algebras. We discuss the results first conjectured in the work of Moore and Seiberg that led us…
Kautz and de Bruijn graphs have a high degree of connectivity which makes them ideal candidates for massively parallel computer network topologies. In order to realize a practical computer architecture based on these graphs, it is useful to…
We apply matrix theory over $\mathbb{F}_2$ to understand the nature of so-called "successful pressing sequences" of black-and-white vertex-colored graphs. These sequences arise in computational phylogenetics, where, by a celebrated result…
The geometry of the moduli space of stable spin curves is studied, with emphasis on its combinatorial properties. In this context, the standard graph theoretic framework is not just a book-keeping device: some purely combinatorial results…
The spin network quantum simulator relies on the su(2) representation ring (or its q-deformed counterpart at q= root of unity) and its basic features naturally include (multipartite) entanglement and braiding. In particular, q-deformed spin…
A finite projective plane, or more generally a finite linear space, has an associated incidence complex that gives rise to two natural algebras: the Stanley-Reisner ring $R/I_\Lambda$ and the inverse system algebra $R/I_\Delta$. We give a…