Related papers: ULD-Lattices and Delta-Bonds
Geometric lattices are characterized in this paper as those finite, atomic lattices such that every atom ordering induces a lexicographic shelling given by an edge labeling known as a minimal labeling. Equivalently, geometric lattices are…
We show that every Borel graph $G$ of subexponential growth has a Borel proper edge-coloring with $\Delta(G) + 1$ colors. We deduce this from a stronger result, namely that an $n$-vertex (finite) graph $G$ of subexponential growth can be…
We study the construction of substitution tilings of the plane based on certain simplicial configurations of tangents of the deltoid with evenly distributed orientations. The random tiling ensembles are obtained as a result of tile…
Given a periodic graph, we wish to determine via combinatorial methods whether it has periodic embeddings in the plane that -- via motions that preserve edge-lengths and periodicity -- can be continuously deformed into another non-congruent…
We propose a simple generalization of Schnyder woods from the plane to maps on orientable surfaces of higher genus. This is done in the language of angle labelings. Generalizing results of De Fraysseix and Ossona de Mendez, and Felsner, we…
We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…
For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…
In this article we study supermodular functions on finite distributive lattices. Relaxing the assumption that the domain is a powerset of a finite set, we focus on geometrical properties of the polyhedral cone of such functions.…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…
We present a comprehensive classification theory for saturated Fell bundles over locally compact groups, utilizing data associated with their base group and unit fiber. This framework offers a unified approach to understanding the structure…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…
Two-dimensional networks of ordered quantum dots beyond the percolation threshold are studied, as typical example of conducting nanostructures with quenched random disorder. Theory predicts anomalous diffusion with stretched-exponential…
Magnetic fluids are colloidal suspensions of ferromagnetic particles covered with a surfactant layer, dispersed in a host liquid. The existence of cooperative phenomena in such magnetic colloidal systems, makes the determining of their…
We introduce and explore patterned lattices consisting of coupled isospectral cells that vary across the lattice. The isospectrality of the cells is encapsulated in the phase that characterizes each cell and can be designed at will such…
The geometric properties of a lattice can have profound consequences on its band spectrum. For example, symmetry constraints and geometric frustration can give rise to topologicially nontrivial and dispersionless bands, respectively.…
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…
Given a group $G$ and a subgroup $H$, we let $\mathcal{O}_G(H)$ denote the lattice of subgroups of $G$ containing $H$. This paper provides a classification of the subgroups $H$ of $G$ such that $\mathcal{O}_{G}(H)$ is Boolean of rank at…
Lattice structures play a central role in spectral graph theory, offering analytical insight into diffusion, synchronization, and transport processes on regular discrete spaces. While their spectral properties are completely characterized…
Colored lattice models can be used to describe many different types of special functions of interest in both algebraic combinatorics and representation theory, for example Schur polynomials, nonsymmetric Macdonald polynomials, and…
A gel consists of a network of particles or molecules formed for example using the sol-gel process, by which a solution transforms into a porous solid. Particles or molecules in a gel are mainly organized on a scaffold that makes up a…