Related papers: From flag complexes to banner complexes
We obtain an explicit presentation of the equivariant cobordism ring of a complete flag variety. An immediate corollary is a Borel presentation of the ordinary cobordism ring. Another application is an equivariant Schubert calculus in…
Imposing a strong condition on the linear order of shellable complexes, we introduce strong shellability. Basic properties, including the existence of dimension-decreasing strong shelling orders, are developed with respect to nonpure…
We establish basic properties of cluster algebras associated with oriented bordered surfaces with marked points. In particular, we show that the underlying cluster complex of such a cluster algebra does not depend on the choice of…
Associated to any Coxeter system $(W,S)$, there is a labeled simplicial complex $L$ and a contractible CW-complex $\Sigma_L$ (the Davis complex) on which $W$ acts properly and cocompactly. $\Sigma_L$ admits a cellulation under which the…
In this paper we investigate the simplicial structure of a chain complex associated to the higher order Hochschild homology over the $3$-sphere. We also introduce the tertiary Hochschild homology corresponding to a quintuple…
Recently, neural network architectures have been developed to accommodate when the data has the structure of a graph or, more generally, a hypergraph. While useful, graph structures can be potentially limiting. Hypergraph structures in…
This paper provides a self-contained exploration of subdivisions of simplicial complexes, with emphasis on barycentric subdivision. We present formal definitions of subdivisions, show how the realization of a complex is preserved under…
We introduce the class $\Sigma_k(d)$ of $k$-stellated (combinatorial) spheres of dimension $d$ ($0 \leq k \leq d + 1$) and compare and contrast it with the class ${\cal S}_k(d)$ ($0 \leq k \leq d$) of $k$-stacked homology $d$-spheres. We…
Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as "tournaplexes", whose simplices are tournaments. In particular, given a digraph…
In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that,…
We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…
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…
We review particle-like configurations of complex scalar field, localized by gravity, so-called boson stars. In the simplest case, these solutions posses spherical symmetry, they may arise in the massive Einstein-Klein-Gordon theory with…
For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…
We consider the structures formed by isogenies of abelian varieties with polarizations that are not necessarily principal, specifically with the $[\ell]$-polarizations we have previously defined. Our primary interest is in superspecial…
We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimensional analogue of clique (or flag) complexes (case k=2) and…
This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…
We offer the following explanation of the statement of the Kuratowski graph planarity criterion and of 6/7 of the statement of the Robertson-Seymour-Thomas intrinsic linking criterion. Let us call a cell complex 'dichotomial' if to every…
The methods of Information geometry have been glowing up to develop various subjects of theoretical physics, including quantum information systems. The present article has two purposes. The first one is to develop general theory of…
The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…