Related papers: Geometric Bijections Between Spanning Trees and Br…
We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…
For a given graph G and integers b,f >= 0, let S be a subset of vertices of G of size b+1 such that the subgraph of G induced by S is connected and S can be separated from other vertices of G by removing f vertices. We prove that every…
We propose a partitioning of the set of unlabelled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants is much larger than that of the genes. The key distinction between…
We show that the presentation of affine $\mathbb{T}$-varieties of complexity one in terms of polyhedral divisors holds over an arbitrary field. We also describe a class of multigraded algebras over Dedekind domains. We study how the algebra…
Techniques of combinatorial set theory are applied to the following algebraic problem. Suppose G is an abelian group such that, for all countable subgroups C, the divisible part of the quotient G/C is countable. What can one conclude about…
A complete mapping of a group $G$ is a bijection $\phi\colon G\to G$ such that $x\mapsto x\phi(x)$ is also bijective. Hall and Paige conjectured in 1955 that a finite group $G$ has a complete mapping whenever $\prod_{x\in G} x$ is the…
We give a functorial definition of $G$-gerbes over a simplicial complex when the local symmetry group $G$ is non-Abelian. These combinatorial gerbes are naturally endowed with a connective structure and a curving. This allows us to define a…
Consider a Jacobian elliptic surface $E \to C$ with a section $P$ of infinite order. Previous work of the first author and Urz\'ua over the complex numbers gives a bound on the number of tangencies between $P$ and a torsion section of $E$…
Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…
We introduce jacobian graphs, which are explicit families of regular graphs that are spectrally indistinguishable from random graphs, but whose local structure is very different from that of random graphs. The construction relies on the…
We survey the geometry of the theta divisor and discuss various loci of principally polarized abelian varieties (ppav) defined by imposing conditions on its singularities. The loci defined in this way include the (generalized)…
We study compactifications of subvarieties of algebraic tori defined by imposing a sufficiently fine polyhedral structure on their non-archimedean amoebas. These compactifications have many nice properties, for example any k boundary…
We investigate a canonical extension of a conventional combinatorial notion of reduced divisors to a notion of tropical projections, which can be defined as the unique minimizers of the so-called $B$-pseudonorms with respect to compact…
We introduce a new family of higher-rank graphs, whose construction was inspired by the graphical techniques of Lambek \cite{Lambek} and Johnstone \cite{Johnstone} used for monoid and category emedding results. We show that they are planar…
We show that if $G$ is a group and $G$ has a graph-product decomposition with finitely-generated abelian vertex groups, then $G$ has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex…
An elimination tree for a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $x$ and recursing on the connected components of $G-x$ to produce the subtrees of $x$. Elimination trees appear in many guises…
We study the topological structure of random geometric forests $G$ in the Euclidean plane under mild assumptions: non-crossing edges, stationarity, and finite edge intensity. The framework covers a broad range of constructions, including…
We present combinatorial bijections and identities between certain skew Young tableaux, Dyck paths, triangulations, and dissections.
Ultrametric matrices are a class of covariance matrices that arise in latent tree models. As a parameter space in a statistical model, the set of ultrametric matrices is neither convex nor a smooth manifold. Focus in the literature has…
It is a result of Gabriel that hereditary torsion pairs in categories of modules are in bijection with certain filters of ideals of the base ring, called Gabriel filters or Gabriel topologies. A result of Jans shows that this bijection…