Related papers: Higher Nerves of Simplicial Complexes
A simplicial complex $\Delta$ is a virtually Cohen-Macaulay simplicial complex if its associated Stanley-Reisner ring $S$ has a virtual resolution, as defined by Berkesch, Erman, and Smith, of length ${\rm codim}(S)$. We provide a…
Each simplicial complex and integer vector yields a vector configuration whose combinatorial properties are important for the analysis of contingency tables. We study the normality of these vector configurations including a description of…
While sporadic examples of virtual resolutions with homology have been constructed, their occurrence is not well understood or controlled. Our results build a new set of tools for studying virtual resolutions of monomial ideals as arising…
A simplicial complement P is a sequence of subsets of [m] and the simplicial complement P corresponds to a unique simplicial complex K with vertices in [m]. In this paper, we defined the homology of a simplicial complement…
We consider ideals $I$ in a Stanley-Reisner ring $k[\Delta]$ over the simplical complex $\Delta$, such that the tight closure of $I$, $I^*$, is equal to $\mathfrak{m}$, the standard graded maximal ideal of $k[\Delta]$. We determine the…
We introduce necklicial nerve functors from enriched categories to simplicial sets, which include Cordier's homotopy coherent, Lurie's differential graded and Le Grignou's cubical nerves. It is shown that every necklicial nerve can be…
Stanley-Reisner rings of Buchsbaum* complexes are studied by means of their quotients modulo a linear system of parameters. The socle of these quotients is computed. Extending a recent result by Novik and Swartz for orientable homology…
We consider simplicial complexes admitting a free action by an abelian group. Specifically, we establish a refinement of the classic result of Hochster describing the local cohomology modules of the associated Stanley--Reisner ring,…
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in…
The homology groups of a simplicial complex reveal fundamental properties of the topology of the data or the system and the notion of topological stability naturally poses an important yet not fully investigated question. In the current…
We extend several $g$-type theorems for connected, orientable homology manifolds without boundary to manifolds with boundary. As applications of these results we obtain K\"uhnel-type bounds on the Betti numbers as well as on certain…
We give a bound for the Betti numbers of the Stanley-Reisner ring of a stellar subdivision of a Gorenstein* simplicial complex by applying unprojection theory. From this we derive a bound for the Betti numbers of iterated stellar…
We give different bounds for the Stanley depth of a monomial ideal $I$ of a polynomial algebra $S$ over a field $K$. For example we show that the Stanley depth of $I$ is less or equal with the Stanley depth of any prime ideal associated to…
We study the annealed complexity of a random Gaussian homogeneous polynomial on the $N$-dimensional unit sphere in the presence of deterministic polynomials that depend on fixed unit vectors and external parameters. In particular, we…
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…
This paper leverages linear systems theory to propose a principled measure of complexity for network systems. We focus on a network of first-order scalar linear systems interconnected through a directed graph. By locally filtering out the…
Inspired by recent results of Ein, Lazarsfeld, Erman and Zhou on the non-vanishing of Betti numbers of high Veronese subrings, we describe the behaviour of the Betti numbers of Stanley-Reisner rings associated with iterated barycentric or…
We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree…
We derive upper bounds on the complexity of ReLU neural networks approximating the solution of a linear system given the matrix and the right-hand side. We focus on matrices which are symmetric positive definite and sparse, as they appear…
We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log…