Related papers: Stellar theory for flag complexes
We prove that a Murai sphere is flag if and only if it is a nerve complex of a flag nestohedron and classify all the polytopes arising in this way. Our classification implies that flag Murai spheres satisfy the Nevo-Petersen conjecture on…
We obtain new topological information about the local structure of collapsing under a lower sectional curvature bound. As an application we prove a new sphere theorem and obtain a partial result towards the conjecture that not every…
We show that two constructions yield equivalent braided monoidal categories. The first is topological, based on Legendrian tangles and skein relations, while the second is algebraic, in terms of chain complexes with complete flag and…
The theory of flag algebras, introduced by Razborov in 2007, has opened the way to a systematic approach to the development of computer-assisted proofs in extremal combinatorics. It makes it possible to derive bounds for parameters in…
By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.
Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…
Characteristic classes of Schubert varieties can be used to study the geometry and the combinatorics of homogeneous spaces. We prove a relation between elliptic classes of Schubert varieties on a generalized full flag variety and those on…
For some partial flag manifolds of semisimple real Lie groups, including many full flag manifolds, transverse circles are known to be locally maximally transverse. We complete the classification of all partial flag manifolds of split real…
For any flag simplicial complex $K$, we describe the multigraded Poincare series, the minimal number of relations and the degrees of these relations in the Pontryagin algebra of the corresponding moment-angle complex $Z_K$. We compute the…
In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…
Our first main result is a uniform bound, in every dimension $k \in \mathbb N$, on the topological Tur\'an numbers of $k$-dimensional simplicial complexes: for each $k \in \mathbb N$, there is a $\lambda_k \ge k^{-2k^2}$ such that for any…
The dynamics of large complex systems are predominately modeled through pairwise interactions, the principle underlying structure being a network of the form of a digraph or quiver. Significant success has been obtained in applying the…
In this paper, oppositeness in spherical buildings is used to define an EKR-problem for flags in projective and polar spaces. A novel application of the theory of buildings and Iwahori-Hecke algebras is developed to prove sharp upper bounds…
We address two longstanding open problems, one originating in PL topology, another in birational geometry. First, we prove the weighted version of Oda's \emph{strong factorization conjecture} (1978), and prove that every two birational…
Associated to any finite flag complex L there is a right-angled Coxeter group W_L and a contractible cubical complex Sigma_L (the Davis complex) on which W_L acts properly and cocompactly, and such that the link of each vertex is L. It…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
Tur\'an problems in extremal combinatorics ask to find asymptotic bounds on the edge densities of graphs and hypergraphs that avoid specified subgraphs. The theory of flag algebras proposed by Razborov provides powerful methods based on…
We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…
In the framework of graph property testing, we study the problem of determining if a graph admits a cluster structure. We say that a graph is $(k, \phi)$-clusterable if it can be partitioned into at most $k$ parts such that each part has…
The $g$-theorem is a momentous result in combinatorics that gives a complete numerical characterization of the face numbers of simplicial convex polytopes. The $g$-conjecture asserts that the same numerical conditions given in the…