Related papers: Two-dimensional partial cubes
We classify a class of complex representations of an arbitrary Coxeter group via characters of the integral homology of certain graphs. Such representations can be viewed as a generalization of the geometric representation and correspond to…
Let G be a graph with vertices V and edges E. Let F be the union-closed family of sets generated by E. Then F is the family of subsets of V without isolated points. Theorem: There is an edge e belongs to E such that |{U belongs to F | e…
We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…
A middle-cube is an induced subgraph consisting of nodes at the middle two layers of a hypercube. The middle-cubes are related to the well-known Revolving Door (Middle Levels) conjecture. We study the middle-cube graph by completely…
A graph $G$ admiting a $2$-factor is \textit{pseudo $2$-factor isomorphic} if the parity of the number of cycles in all its $2$-factors is the same. In [M. Abreu, A.A. Diwan, B. Jackson, D. Labbate and J. Sheehan. Pseudo $2$-factor…
In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…
A "2-group" is a category equipped with a multiplication satisfying laws like those of a group. Just as groups have representations on vector spaces, 2-groups have representations on "2-vector spaces", which are categories analogous to…
We construct families of cell complexes that generalize expander graphs. These families are called non-$k$-hyperfinite, generalizing the idea of a non-hyperfinite (NH) family of graphs. Roughly speaking, such a complex has the property that…
We study vortex structure in a two-band superconductor, in which one band is ballistic and quasi-two-dimensional (2D), and the other is diffusive and three-dimensional (3D). A circular cell approximation of the vortex lattice within the…
We introduce a class of combinatorial hypersurfaces in the complex projective space. They are submanifolds of codimension~2 in $\C P^n$ and are topologically "glued" out of algebraic hypersurfaces in $(\C^*)^n$. Our construction can be…
We relate three classes of nonpositively curved metric spaces: hierarchically hyperbolic spaces, coarsely injective spaces, and strongly shortcut spaces. We show that every hierarchically hyperbolic space admits a new metric that is…
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…
In the physics literature, Bilal--Fock--Kogan \cite{BFK} introduced the idea of parabolic reduced flat connections on a surface to give a geometric origin to $W$-algebras. In this paper, we combine these ideas with higher complex…
The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…
The implicit representation conjecture concerns hereditary families of graphs. Given a graph in such a family, we want to assign some string of bits to each vertex in such a way that we can recover the information about whether 2 vertices…
The topological charge density and topological susceptibility are determined by multi-probing approximation using overlap fermions in quenched SU(3) gauge theory. Then we investigate the topological structure of the quenched QCD vacuum, and…
We study random subgraphs of the 2-dimensional Hamming graph H(2,n), which is the Cartesian product of two complete graphs on $n$ vertices. Let $p$ be the edge probability, and write $p=\frac{1+\vep}{2(n-1)}$ for some $\vep\in \R$. In Borgs…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…
Finite subdivision rules in high dimensions can be difficult to visualize and require complex topological structures to be constructed explicitly. In many applications, only the history graph is needed. We characterize the history graph of…