Related papers: Framing Lattices and Flow Polytopes
We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…
Given a directed graph $D$ with transitive closure $\operatorname{tc}(D)$ and path hypergraph $\mathbb{P}(D)$, we study the connections between the (acyclic) reorientation poset of $\operatorname{tc}(D)$, the (acyclic) sourcing poset of…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
Given an acyclic directed graph (DAG), the space of strength one flows is a lattice polytope called the flow polytope of the DAG. If the DAG admits an ample framing, then the flow polytope is Gorenstein and it linearly projects onto a…
We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…
We study a family of Hamiltonians of fermions hopping on a set of lattices in the presence of a background gauge field. The lattices are constructed by decorating the root lattices of various Lie algebras with their minuscule…
Network theory has proven to be a powerful tool in describing and analyzing systems by modelling the relations between their constituent objects. In recent years great progress has been made by augmenting `traditional' network theory.…
Adapting Lindstr\"om's well-known construction, we consider a wide class of functions which are generated by flows in a planar acyclic directed graph whose vertices (or edges) take weights in an arbitrary commutative semiring. We give a…
In this paper we give two characterisations of the class of reflexive graphs admitting distributive lattice polymorphisms and use these characterisations to address the problem of recognition: for a reflexive graph G in which no two…
The partition lattice and noncrossing partition lattice are well studied objects in combinatorics. Given a graph $G$ on vertex set $\{1,2,\dots, n\}$, its bond lattice, $L_G$, is the subposet of the partition lattice formed by restricting…
We study the phase diagram of two-dimensional Bose-Fermi mixtures of ultracold atoms on a triangular optical lattice, in the limit when the velocity of bosonic condensate fluctuations is much larger than the Fermi velocity. We contrast this…
Topological mechanical metamaterials have enabled new ways to control stress and deformation propagation. Exemplified by Maxwell lattices, they have been studied extensively using a linearized formalism. Herein, we study a two-dimensional…
We study the properties of finite graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to some fixed graph $F$. This is a natural extension of the study of regular graphs, and of the study of graphs of…
Line-graph (LG) lattices are known for having flat bands (FBs) from the destructive interference of Bloch wavefunctions encoded in pure lattice symmetry. Here, we develop a generic atomic/molecular orbital design principle for FBs in non-LG…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
We attach to each $\langle 0, \vee \rangle$-semilattice a graph $\boldsymbol{G}_{\boldsymbol{S}}$ whose vertices are join-irreducible elements of $\boldsymbol{S}$ and whose edges correspond to the reflexive dependency relation. We study…
We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…
The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets of maximal tubings for the complete graph and the path…
Slim semimodular lattices (for short, SPS lattices) and slim rectangular lattices (for short, SR lattices) were introduced by G. Gr\"atzer and E. Knapp in 2007 and 2009. These lattices are necessarily finite and planar, and they have been…
Consider a semi-infinite skew-symmetric moment matrix, $m_{\iy}$ evolving according to the vector fields $\pl m / \pl t_k=\Lb^k m+m \Lb^{\top k} ,$ where $\Lb$ is the shift matrix. Then the skew-Borel decomposition $ m_{\iy}:= Q^{-1} J…