Related papers: Cluster algebras and binary subwords
To any semigroup presentation $\mathcal{P}= \langle \Sigma \mid \mathcal{R} \rangle$ and base word $w \in \Sigma^+$ may be associated a nonpositively curved cube complex $S(\mathcal{P},w)$, called a Squier complex, whose underlying graph…
Biclustering numerical data became a popular data-mining task in the beginning of 2000's, especially for analysing gene expression data. A bicluster reflects a strong association between a subset of objects and a subset of attributes in a…
Given a finite group $G$ and an extension of finite chain rings $S|R$, one can consider the group rings $\mathscr{S} = S[G]$ and $\mathscr{R} = R[G]$. The group ring $\mathscr{S}$ can be viewed as an $R$-bimodule, and any of its…
We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…
To a weighted graph can be associated a bipartite graph planar algebra P. We construct and study the symmetric enveloping inclusion of P. We show that this construction is equivariant with respect to the automorphism group of P. The…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
Complex systems are usually represented as an intricate set of relations between their components forming a complex graph or network. The understanding of their functioning and emergent properties are strongly related to their structural…
In this paper, we formulate and prove linear analogues of results concerning matchings in groups. A matching in a group G is a bijection f between two finite subsets A,B of G with the property, motivated by old questions on symmetric…
We explore new connections between complete non-ambiguous trees (CNATs) and permutations. We give a bijection between tree-like tableaux and a specific subset of CNATs. This map is used to establish and solve a recurrence relation for the…
We show that there are four chiral ${\cal W}$-algebra extensions of $\mathfrak{so}(2,3)$ algebra and construct them explicitly. We do this by a simple identification of each of the inequivalent embeddings of a copy of…
Emphasis Selection is a newly proposed task which focuses on choosing words for emphasis in short sentences. Traditional methods only consider the sequence information of a sentence while ignoring the rich sentence structure and word…
Bayesian structure learning is the NP-hard problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computational worst-case complexity of exact Bayesian structure learning…
Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to…
For an unpunctured marked surface $\Sigma$, we consider a skein algebra $\mathscr{S}_{\mathfrak{sl}_{3},\Sigma}^{q}$ consisting of $\mathfrak{sl}_3$-webs on $\Sigma$ with the boundary skein relations at marked points. We construct a quantum…
We introduce an expansion formula for elements in quantum cluster algebras associated to type A and Kronecker quivers with principal quantization. Our formula is parametrized by perfect matchings of snake graphs as in the classical case. In…
We construct the nonlinear $W(sl(N+3),sl(3))$ algebras and find the spectrum of values of the central charge that gives rise, by contracting the $W(sl(N+3),sl(3))$ algebras, to a $W_3$ algebra belonging to the coset…
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…
Let $S$ be an upper cluster algebra, which is a subalgebra of $R$. Suppose that there is some cluster variable $x_e$ such that ${R}_{{x}_e} = S[{x}_e^{\pm 1}]$. We try to understand under which conditions ${R}$ is an upper cluster algebra,…
Best match graphs (BMG) are a key intermediate in graph-based orthology detection and contain a large amount of information on the gene tree. We provide a near-cubic algorithm to determine whether a BMG is binary-explainable, i.e., whether…
In this paper two new graph operations are introduced, and with them the S-trees are studied in depth. This allows to find \(\{-1,0,1\}\)-basis for all the fundamental subspaces of the adjacency matrix of any tree, and to understand in…