Related papers: Chordal and sequentially Cohen-Macaulay clutters
Multi-component aggregates are being intensively researched in various fields because of their highly tunable properties and wide applications. Due to the complex configurational space of these systems, research would greatly benefit from a…
Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…
The purpose of this paper is to present a family of Cohen-Macaulay monomial ideals such that their integral closures have embedded components and hence are not Cohen-Macaulay.
We establish basic properties of cluster algebras associated with oriented bordered surfaces with marked points. In particular, we show that the underlying cluster complex of such a cluster algebra does not depend on the choice of…
In this article we show that a wide range of multiple structures on curves arise whenever a family of embeddings degenerates to a morphism $\varphi$ of degree $n$. One could expect to see, when an embedding degenerates to such a morphism,…
We formulate an elementary condition on an involutive quantaloid Q under which there is a distributive law from the Cauchy completion monad over the symmetrisation comonad on the category of Q-enriched categories. For such quantaloids,…
Analysis of higher-order organizations, usually small connected subgraphs called motifs, is a fundamental task on complex networks. This paper studies a new problem of testing higher-order clusterability: given query access to an undirected…
We show the existence of quasi-cluster $\mathcal{A}$-structures and cluster Poisson structures on moduli stacks of sheaves with singular support in the alternating strand diagram of grid plabic graphs by studying the microlocal parallel…
There is a class of graphs with well-covered dimension equal to the simplicial clique number that contains all chordal graphs and infinitely many other graphs. These graphs generalize a result by Brown and Nowakowski on the well-covered…
Graph Spectral Clustering methods (GSC) allow representing clusters of diverse shapes, densities, etc. However, the results of such algorithms, when applied e.g. to text documents, are hard to explain to the user, especially due to…
We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is…
We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope. We find a sufficient condition for adjacency, and…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
This paper is devoted to qualgebras and squandles, which are quandles enriched with a compatible binary/unary operation. Algebraically, they are modeled after groups with conjugation and multiplication/squaring operations. Topologically,…
Matrices are two-dimensional data structures allowing one to conceptually organize information. For example, adjacency matrices are useful to store the links of a network; correlation matrices are simple ways to arrange gene co-expression…
The defect morphology is an essential aspect of the evolution of crystals' microstructure and its response to stress. Existing methods either only report defect concentration or characterize only some of the defect morphologies. The need…
While spectral clustering algorithms for undirected graphs are well established and have been successfully applied to unsupervised machine learning problems ranging from image segmentation and genome sequencing to signal processing and…
We classify the complementary vectors of doubly Cohen-Macaulay complexes. This proves a conjecture of Swartz, negatively answers a question of Athanasiadis and Tzanaki, and gives new bounds on the number of independent sets in a matroid.…
We find all maximal linklessly embeddable graphs of order up to 11, and verify that for every graph $G$ of order 11 either $G$ or its complement $cG$ is intrinsically linked. We give an example of a graph $G$ of order 11 such that both $G$…
Given a graph $G$, the non-cover complex of $G$ is the combinatorial Alexander dual of the independence complex of $G$. Aharoni asked if the non-cover complex of a graph $G$ without isolated vertices is $(|V(G)|-i \gamma(G)-1)$-collapsible…