Related papers: The combinatorics of frieze patterns and Markoff n…
We announce recent results on a connection between factorization statistics of polynomials over a finite field and the structure of the cohomology of configurations in $\mathbb{R}^3$ as a representation of the symmetric group. This…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…
The 1970s conjecture of Lov\'asz and Plummer that the number of perfect matchings in any $3$-regular graph is exponential in the number of vertices was proved in 2011 by Esperet, Kardo\v{s}, King, Kr\'al', and Norine. We give the exact…
We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…
We explicate the combinatorial/geometric ingredients of Arthur's proof of the convergence and polynomiality, in a truncation parameter, of his non-invariant trace formula. Starting with a fan in a real, finite dimensional, vector space and…
We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of sums and products of unitarily invariant random matrices.…
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…
The following article is one of introduction to additive frieze patterns, linking the subject to multiplicative frieze patterns. We also add two new theorems about additive frieze patterns (see theorem 2 and 5) and a conjecture about…
For Poincare series of binary polyhedral groups and Coxeter polynomials there are obtained statements close to the Euclid algorithm and orthogonal polynomials theory: generalized Ebeling formula, decompositions into ramified continued…
We give a combinatorial characterization of Fulton's operational Chow cohomology groups of a complete , $\Q$-factorial, rational T-variety of complexity one in terms of so called generalized Minkowsky weights in the contraction-free case.…
The enumeration of points on (or off) the union of some linear or affine subspaces over a finite field is dealt with in combinatorics via the characteristic polynomial and in algebraic geometry via the zeta function. We discuss the basic…
We study the connection between the three-color model and the polynomials $q_n(z)$ of Bazhanov and Mangazeev, which appear in the eigenvectors of the Hamiltonian of the XYZ spin chain. By specializing the parameters in the partition…
We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…
In this article we study the combinatorics of congruence subgroups of the modular group. We consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of Coxeter friezes),…
We define Bernstein-Gelfand-Ponomarev reflection functors in the cluster categories of hereditary algebras. They are triangle equivalences which provide a natural quiver realization of the "truncated simple reflections" on the set of almost…
We introduce an abstract framework to study certain classes of stably embedded pairs of models of a complete $\mathcal{L}$-theory $T$, called \textit{beautiful pairs}, which comprises Poizat's belles paires of stable structures and van den…
We introduce a class of links whose bracket polynomials admit an expansion over perfect matchings of a plane bipartite graph. This class includes 2-bridge links, pretzel links, and Montesinos links. Our first main result (Theorem A)…
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…
There are two objectives to this work: to classify all tame integer tilings and to classify all tame integer hypertilings. Motivation for the first objective comes from Conway and Coxeter's modelling of positive integer friezes using…
Over the past decade, a combinatorial framework for discrete, finite, and irreversibly aggregating systems has emerged. This work reviews its progress, practical applications, and limitations. We outline the approach's assumptions and…