Related papers: The Burge correspondence and crystal graphs
Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…
For simply-laced Kac-Moody algebras $\frak g$, Stembridge (2003) proposed a `local' axiomatization of crystal graphs of representations of $U_q(\frak g)$. In this paper we propose axioms for edge-2-colored graphs which characterize the…
Mock threshold graphs are a simple generalization of threshold graphs that, like threshold graphs, are perfect graphs. Our main theorem is a characterization of mock threshold graphs by forbidden induced subgraphs. Other theorems…
A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations to be…
We develop and explore the idea of recognition of languages (in the general sense of subsets of topological algebras) as preimages of clopen sets under continuous homomorphisms into Stone topological algebras. We obtain an Eilenberg…
Consider a host hypergraph $G$ which contains a spanning structure due to minimum degree considerations. We collect three results proving that if the edges of $G$ are sampled at the appropriate rate then the spanning structure still appears…
Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…
Fiber graphs of Gr\"obner bases from contingency tables are important in statistical hypothesis testing, where one studies random walks on these graphs using the Metropolis-Hastings algorithm. The connectivity of the graphs has implications…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
Persistent homology, a central tool of topological data analysis, provides invariants of data called barcodes (also known as persistence diagrams). A barcode is simply a multiset of real intervals. Recent work of Edelsbrunner, Jablonski,…
For finite reflection groups of types A and B, we determine the diameter of the graph whose vertices are reduced words for the longest element and whose edges are braid relations. This is deduced from a more general theorem that applies to…
A typical crystal is a finite piece of a material which may be invariant under some point symmetry group. If it is a so-called intrinsic higher-order topological insulator or superconductor, then it displays boundary modes at hinges or…
The subgraph number of a vertex in a graph is defined as the number of connected subgraphs containing that vertex. The graph and its vertex which correspond to the minimum subgraph number among all graphs on $n$ vertices and $k$ cut…
The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper…
Let $(G,G')$ be a reductive dual pair of a symplectic group and an orthogonal group over a finite field of odd characteristic. The Howe correspondence establishes a correspondence between a subset of irreducible characters of $G$ and a…
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…
The long-root elements in Lie algebras of Chevalley type have been well studied and can be characterized as extremal elements, that is, elements $x$ such that the image of $(\ad x)^2$ lies in the subspace spanned by $x$. In this paper,…
We study the structure of $r$-uniform hypergraphs containing no Berge cycles of length at least $k$ for $k \leq r$, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such…
The computation of distance measures between nodes in graphs is inefficient and does not scale to large graphs. We explore dense vector representations as an effective way to approximate the same information: we introduce a simple yet…
We show that the square of every connected $S(K_{1,4})$-free graph satisfying a matching condition has a $2$-connected spanning subgraph of maximum degree at most~$3$. Furthermore, we characterise trees whose square has a $2$-connected…