Related papers: Gorenstein and Cohen-Macaulay Matching Complexes

We characterize pure lexsegment complexes which are Cohen-Macaulay in arbitrary codimension. More precisely, we prove that any lexsegment complex is Cohen-Macaulay if and only if it is pure and its one dimensional links are connected, and,…

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…

Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H2, however Motwani and Sudan proved that it is NP-complete to determine…

By considering graphs as discrete analogues of Riemann surfaces, Baker and Norine (Adv. Math. 2007) developed a concept of linear systems of divisors for graphs. Building on this idea, a concept of gonality for graphs has been defined and…

Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very hard and challenging to show a given graph to be determined…

A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…

For $r\geq 1$, the $r$-independence complex of a graph $G$ is a simplicial complex whose faces are subset $I \subseteq V(G)$ such that each component of the induced subgraph $G[I]$ has at most $r$ vertices. In this article, we determine the…

Let $(A,\mathfrak{m})$ be an excellent Gorenstein local ring of dimension $d \geq 2$ which is an isolated singularity. Let $\widehat{A}$ denote the completion of $A$. If $G(A)$ is the Grothendieck group of $A$ then by $G(A)_\mathbb{Q}$ we…

Let $G=(V,E)$ be a graph. If $G$ is a K\"onig graph or $G$ is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: $\Delta_{G}$ is pure shellable, $R/I_{\Delta}$ is Cohen-Macaulay, $G$ is unmixed…

A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. While every non-complete graph has at least two moplexes, little is known about structural properties of graphs…

Levelness and nearly Gorensteinness are well-studied properties of graded rings as a generalized notion of Gorensteinness. In this paper, we compare the strength of these properties. For any Cohen-Macaulay homogeneous affine semigroup ring…

For a symplectic space $V$ of dimension $2n$ over $\mathbb{F}_{q}$, we compute the eigenvalues of its orthogonality graph. This is the simple graph with vertices the $2$-dimensional non-degenerate subspaces of $V$ and edges between…

Let $G$ be a finite simple graph. The line graph $L(G)$ represents the adjacencies between edges of $G$. We define first the line simplicial complex $\Delta_L(G)$ of $G$ containing Gallai and anti-Gallai simplicial complexes…

Let $F$ be a homogeneous polynomial in $n$ variables of degree $d$ over a field $K$. Let $A(F)$ be the associated Artinian graded $K$-algebra. If $B \subset A(F)$ is a subalgebra of $A(F)$ which is Gorenstein with the same socle degree as…

A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their…

A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…

Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…

A mixed graph $G$ is a graph obtained from a simple undirected graph by orientating a subset of edges. $G$ is self-converse if it is isomorphic to the graph obtained from $G$ by reversing each directed edge. For two mixed graphs $G$ and $H$…

For a compact Lie group G we show that if the representing spectrum for Borel cohomology generates its category of modules if G is connected. For a closed subgroup H of G we consider the map C^*(BG)--->C^*(BH) and establish the sense in…

Using techniques coming from the theory of marked bases, we develop new computational methods for detection and construction of Cohen-Macaulay, Gorenstein and complete intersection homogeneous polynomial ideals. Thanks to the functorial…