Related papers: Boolean formulae, hypergraphs and combinatorial to…
We introduce a notion of non-commutative joint independence for multiple algebras in a non-commutative probability space. The pairwise relationships between these algebras are encoded by a graph with two edge sets -- a combinatorial…
The dual complex associated to a resolution of singularities generalizes the notion of a resolution graph of a surface singularity to any dimension. We show that homotopy type of the dual complex is an invariant of an isolated singularity.
We exhibit an $n$-node graph whose independent set polytope requires extended formulations of size exponential in $\Omega(n/\log n)$. Previously, no explicit examples of $n$-dimensional $0/1$-polytopes were known with extension complexity…
The Temperley-Lieb algebra \tln(\beta) can be defined as the set of rectangular diagrams with n points on each of their vertical sides, with all points joined pairwise by non-intersecting strings. The multiplication is then the…
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…
It was conjectured by Goyal, Shukla and Singh that the independence complex of the categorical product $K_2\times K_3\times K_n$ has the homotopy type of a wedge of $(n-1)(3n-2)$ spheres of dimension $3$. Here we prove this conjecture by…
Hecke-Kiselman monoids $\textrm{HK}_{\Theta}$ and their algebras $K[\textrm{HK}_{\Theta}]$, over a field $K$, associated to finite oriented graphs $\Theta$ are studied. In the case $\Theta $ is a cycle of length $n\geqslant 3$, a hierarchy…
We investigate polyhedral $2k$-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex {\it $k$-Hamiltonian} if it contains the full $k$-skeleton of the polytope. Since the case of the cube is well…
We examine the topology of the clique complexes of the graphs of weakly and strongly separated subsets of the set $[n]=\{1,2,...,n\}$, which, after deleting all cone points, we denote by $\hat{\Delta}_{ws}(n)$ and $\hat{\Delta}_{ss}(n)$,…
For a graph $G$, Bayer-Denker-Milutinovi\'c-Rowlands-Sundaram-Xue study in \cite{B-D-M-R-S-X} a new graph complex $\Delta_k^t(G)$, namely the simplicial complex with facets that are complements to independent sets of size $k$ in $G$. They…
Let $\Delta$ be simplicial complex and let $k[\Delta]$ denote the Stanley--Reisner ring corresponding to $\Delta$. Suppose that $k[\Delta]$ has a pure free resolution. Then we describe the Betti numbers and the Hilbert--Samuel multiplicity…
We construct a functor associating a cubical set to a (simple) graph. We show that cubical sets arising in this way are Kan complexes, and that the A-groups of a graph coincide with the homotopy groups of the associated Kan complex. We use…
We introduce and investigate bucolic complexes, a common generalization of systolic complexes and of CAT(0) cubical complexes. They are defined as simply connected prism complexes satisfying some local combinatorial conditions. We study…
We study the homological properties of $\Delta_{\mathbf{r}}(n_1, \dots, n_e)$, a simplicial complex formed by sequentially gluing complete graphs along $(r_i-1)$-simplices. This construction generates precisely the chordal clique complexes,…
Given a convex n-gon P in the Euclidean plane, it is well known that the simplicial complex \theta(P) with vertex set given by diagonals in P and facets given by triangulations of P is the boundary complex of a polytope of dimension n-3. We…
Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the…
Abstract polytopes generalize the classical notion of convex polytopes to more general combinatorial structures. The most studied ones are regular and chiral polytopes, as it is well-known, they can be constructed as coset geometries from…
Given an arbitrary hypergraph $\mathcal{H}$, we may glue to $\mathcal{H}$ a family of hypergraphs to get a new hypergraph $\mathcal{H}'$ having $\mathcal{H}$ as an induced subhypergraph. In this paper, we introduce three gluing techniques…
For a simplicial complex $\Delta$, the graded Betti number $\beta_{i,j}(k[\Delta])$ of the Stanley-Reisner ring $k[\Delta]$ over a field $k$ has a combinatorial interpretation due to Hochster. Terai and Hibi showed that if $\Delta$ is the…
Triangulations and higher triangulations axiomatize the calculus of derived cokernels when applied to strings of composable morphisms. While there are no cubical versions of (higher) triangulations, in this paper we use coherent diagrams to…