Related papers: The Burge correspondence and crystal graphs
We study the correspondence between the non-trivial topological properties associated with the individual valleys of gapped bilayer graphene (BLG), as a prototypical multi-valley system, and the gapless modes at its edges and other…
We consider the problem of establishing dense correspondences within a set of related shapes of strongly varying geometry. For such input, traditional shape matching approaches often produce unsatisfactory results. We propose an ensemble…
This paper is devoted to a study of geometric structures expressible in terms of graded symplectic supermanifolds. We extend the classical BRST formalism to arbitrary pseudo-Euclidean vector bundles (E\to M_{0}) by canonically associating…
Structured prediction tasks in machine learning involve the simultaneous prediction of multiple labels. This is typically done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise elements, each…
A directed graph is oriented if it can be obtained by orienting the edges of a simple, undirected graph. For an oriented graph $G$, let $\beta(G)$ denote the size of a minimum feedback arc set, a smallest subset of edges whose deletion…
Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…
The existence of a "Plastikstufe" for a contact structure implies the Weinstein conjecture for all supporting contact forms.
Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial…
We describe the Gerstenhaber algebra structure on the Hochschild cohomology HH*$(A)$ when $A$ is a quadratic string algebra. First we compute the Hochschild cohomology groups using Barzdell's resolution and we describe generators of these…
The number of standard Young tableaux of a skew shape $\lambda/\mu$ can be computed as a sum over excited diagrams inside $\lambda$. Excited diagrams are in bijection with certain lozenge tilings, with flagged semistandard tableaux and also…
Let $\mathcal{G}$ be the set of simple graphs (or multigraphs) $G$ such that for each $G \in \mathcal{G}$ there exists at least two non-empty disjoint proper subsets $V_{1},V_{2}\subseteq V(G)$ satisfying $V(G)\setminus(V_{1} \cup…
The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…
We present equalities in law between the spectra of the minors of a GUE matrix and some maximal functionals of independent Brownian motions. In turn, these results allow to recover the limiting shape (properly centered and scaled) of the…
A distance labeling scheme is an assignment of bit-labels to the vertices of an undirected, unweighted graph such that the distance between any pair of vertices can be decoded solely from their labels. An important class of distance…
In the past two decades, significant advances have been made in understanding the structural and functional properties of biological networks, via graph-theoretic analysis. In general, most graph-theoretic studies are conducted in the…
The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…
A graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of…
For a semisimple Lie algebra admitting a good enumeration, we prove a parametrization for the elements in its Weyl group. As an application, we give a coordinate-free comparison between the crystal graph description (when it is known) and…
In this paper, we introduce a variation of the notion of topological phase reflecting metric structure of the position space. This framework contains not only periodic and non-periodic systems with symmetries in Kitaev's periodic table but…
For a fixed set of positive integers $R$, we say $\mathcal{H}$ is an $R$-uniform hypergraph, or $R$-graph, if the cardinality of each edge belongs to $R$. For a graph $G=(V,E)$, a hypergraph $\mathcal{H}$ is called a Berge-$G$, denoted by…