Related papers: Sequentially $S_r$ simplicial complexes and sequen…
We prove that after an arbitrarily small adjustment of edge lengths, the spectrum of a compact quantum graph with $\delta$-type vertex conditions can be simple. We also show that the eigenfunctions, with the exception of those living…
We introduce the Macaulay2 package SCMAlgebras. It provides functions for computing the modules of deficiency and the filter ideals, in order to check whether a module or an ideal is sequentially Cohen-Macaulay. After the basic algebraic…
It is a conjecture of Koll\'ar that a variety $X$ with rational singularities in some open subvariety $U$ has a rationalification; that is, a proper, birational morphism $f: Y \rightarrow X$ such that $Y$ has rational singularities, and…
By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.
We recently introduced a notion of tilings of geometric realizations of finite relative simplicial complexes and related those tilings to the discrete Morse theory of R. Forman, especially when they have the property of being shellable, a…
A celebrated theorem of Stiebitz asserts that any graph with minimum degree at least $s+t+1$ can be partitioned into two parts which induce two subgraphs with minimum degree at least $s$ and $t$, respectively. This resolved a conjecture of…
A space X is selectively sequentially pseudocompact if for every sequence (U_n) of non-empty open subsets of X, one can choose a point x_n in each U_n in such a way that the sequence (x_n) has a convergent subsequence. Let G be a group from…
We define and study the notion of a minimal Cohen-Macaulay simplicial complex. We prove that any Cohen-Macaulay complex is shelled over a minimal one in our sense, and we give sufficient conditions for a complex to be minimal…
The degree sequence of a graph is the sequence of the degrees of its vertices. If $\pi$ is a degree sequence of a graph $G$, then $G$ is a realization of $\pi$ and $G$ realizes $\pi$. Determining when a sequence of positive integers is…
We present a discrete Morse-theoretic method for proving that a regular CW complex is homeomorphic to a sphere. We use this method to define bisimplices, the cells of a class of regular CW complexes we call bisimplicial complexes. The…
Let $\bar{L}_i\lr X_i$ be a holomorphic line bundle over a compact complex manifold for $i=1,2$. Let $S_i$ denote the associated principal circle-bundle with respect to some hermitian inner product on $\bar{L}_i$. We construct complex…
In this paper we study almost Cohen-Macaulay bipartite graphs. Furthermore, we prove that if $G$ is almost Cohen-Macaulay bipartite graph with at least one vertex of positive degree, then there is a vertex of $\deg(v) \leq 2$. In…
The prime simplicial complex $\Pi(G)$ of a finite group $G$ is composed of all sets of primes $S$ where $G$ has an element of order the product of primes in $S$, with the subsets partially ordered by inclusion. This complex was introduced…
Let $\Gamma$ be a $d$-flag sortable simplicial complex. We consider the toric ring $R_{\Gamma}=K[{\bf x}_Ft:F\in \Gamma]$ and the Rees algebra of the facet ideals $I(\Gamma^{[i]})$ of pure skeletons of $\Gamma$. We show that these algebras…
We study the homology of simplicial and cubical sets with symmetries. These are simplicial and cubical sets with additional maps expressing the symmetries of simplices and cubes. We consider the chain complex computing the homology groups…
We introduce and study vertex cover algebras of weighted simplicial complexes. These algebras are special classes of symbolic Rees algebras. We show that symbolic Rees algebras of monomial ideals are finitely generated and that such an…
We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…
The enumeration of independent sets of regular graphs is of interest in statistical mechanics, as it corresponds to the solution of hard-particle models. In 2004, it was conjectured by Fendleyet al. that for some rectangular grids, with…
It is increasingly common for data to possess intricate structure, necessitating new models and analytical tools. Graphs, a prominent type of structure, can encode the relationships between any two entities (nodes). However, graphs neither…
Given a simplicial complex, it is easy to construct a generic deformation of its Stanley-Reisner ideal. The main question under investigation in this paper is how to characterize the simplicial complexes such that their Stanley-Reisner…