Related papers: On isomorphism of simplicial complexes and their r…
We call a simplicial complex algebraically rigid if its Stanley-Reisner ring admits no nontrivial infinitesimal deformations, and call it inseparable if does not allow any deformation to other simplicial complexes. Algebraically rigid…
In this paper we show that a $k$-shellable simplicial complex is the expansion of a shellable complex. We prove that the face ring of a pure $k$-shellable simplicial complex satisfies the Stanley conjecture. In this way, by applying…
We study simplicial complexes with a given number of vertices whose Stanley-Reisner ring has the minimal possible Betti numbers. We find that these simplicial complexes have very special combinatorial and topological structures. For…
Generalizing the notion of a Koszul algebra, a graded k-algebra A is K2 if its Yoneda algebra is generated as an algebra in cohomology degrees 1 and 2. We prove a strong theorem about K2 factor algebras of Koszul algebras and use that…
The connectivity of graphs of simplicial and polytopal complexes is a classical subject going back at least to Steinitz, and the topic has since been studied by many authors, including Balinski, Barnette, Athanasiadis and Bjorner. In this…
Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of…
Let $\mathbb F$ be an algebraically closed field, $G$ be an abelian group, and let $A$ and $B$ be arbitrary finite-dimensional $G$-graded simple algebras over $\mathbb F$. We prove that $A$ and $B$ are isomorphic if, and only if, they…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
The main invariant to study the combinatorics of a simplicial complex $K$ is the associated face ring or Stanley-Reisner algebra. Reisner respectively Stanley explained in which sense Cohen-Macaulay and Gorenstein properties of the face…
To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By…
A compact K\"ahler manifold is shown to be simply-connected if its `symmetric cotangent algebra' is trivial. Conjecturally, such a manifold should even be rationally connected. The relative version is also shown: a proper surjective…
We find families of simplicial complexes where the simplicial chromatic polynomials defined by Cooper--de Silva--Sazdanovic \cite{CdSS} are Hilbert series of Stanley--Reisner rings of auxiliary simplicial complexes. As a result, such…
We consider the relationship between the Stanley-Reisner ring (a.k.a. face ring) of a simplicial or boolean complex $\Delta$ and that of its barycentric subdivision. These rings share a distinguished parameter subring. S. Murai asked if…
We introduce a notion of ideal-related K-theory for rings, and use it to prove that if two complex Leavitt path algebras are Morita equivalent (respectively, isomorphic), then the ideal-related K-theories (respectively, the unital…
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…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
A simple topological graph is $k$-quasiplanar ($k\geq 2$) if it contains no $k$ pairwise crossing edges, and $k$-planar if no edge is crossed more than $k$ times. In this paper, we explore the relationship between $k$-planarity and…
Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…
Let $A$ and $B$ be two connected graded algebras finitely generated in degree one. If $A$ is isomorphic to $B$ as ungraded algebras, then they are also isomorphic to each other as graded algebras.
A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be…