Related papers: Links in the complex of weakly separated collectio…
We investigate how exchange-graph techniques can be used to study the topology of strata of meromorphic quadratic differentials. The exchange graph provides natural generators for the fundamental group. By extending the combinatorics of…
The complement of a complex hyperplane arrangement is known to be homotopic to a minimal CW complex. There are several approaches to the minimality. In this paper, we restrict our attention to real two dimensional cases, and introduce the…
In this note we give two examples of partially commutative subgroups of partially commutative groups. Our examples are counterexamples to the Extension Graph Conjecture and to the Weakly Chordal Conjecture of Kim and Koberda, \cite{KK}. On…
Let $\mathcal{D}$ be a Hom-finite, Krull-Schmidt, 2-Calabi-Yau triangulated category with a rigid object $R$. Let $\Lambda=\operatorname{End}_{\mathcal{D}}R$ be the endomorphism algebra of $R$. We introduce the notion of mutation of maximal…
Let $R$ be a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$, and suppose $q+q^{-1}$ is invertible in $R$. For each planar surface $\Sigma_{0,n+1}$, we present its Kauffman bracket skein algebra over $R$ by…
Graph classification plays a pivotal role in various domains, including pathology, where images can be represented as graphs. In this domain, images can be represented as graphs, where nodes might represent individual nuclei, and edges…
Bayesian nonparametric mixtures and random partition models are powerful tools for probabilistic clustering. However, standard independent mixture models can be restrictive in some applications such as inference on cell lineage due to the…
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying themes of our investigation are various `nonpositive…
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…
Graph neural networks are widely used to learn global representations of graphs, which are then used for regression or classification tasks. Typically, the graphs in such data sets are connected, i.e. each training sample consists of a…
We define a solvable extension of the graph 2-step nilpotent Lie algebras of [5] by adding elements corresponding to the 3-cliques of the graph. We study some of their basic properties and we prove that two such Lie algebras are isomorphic…
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…
We say that a set of pairs of disjoint cycles $\Lambda(G)$ of a graph $G$ is linked if for any spatial embedding $f$ of $G$ there exists an element $\lambda$ of $\Lambda(G)$ such that the $2$-component link $f(\lambda)$ is nonsplittable,…
We enumerate rooted 2-connected and 3-connected surface maps with respect to vertices and edges. We also derive the bivariate version of the large face-width result for random 3-connected maps. These results are then used to derive…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…
A $k$-weak bisection of a cubic graph $G$ is a partition of the vertex-set of $G$ into two parts $V_1$ and $V_2$ of equal size, such that each connected component of the subgraph of $G$ induced by $V_i$ ($i=1,2$) is a tree of at most $k-2$…
We propose a partitioning of the set of unlabelled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants is much larger than that of the genes. The key distinction between…
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…