Related papers: Cluster algebras and binary subwords
Quadratic Poisson brackets on a vector space equipped with a bilinear multiplication are studied. A notion of a bracket compatible with the multiplication is introduced and an effective criterion of such compatibility is given. Among…
A double-arborescence is a treelike comparability graph with an all-adjacent vertex. In this paper, we first give a forbidden induced subgraph characterization of double-arborescences, where we prove that double-arborescences are precisely…
We prove that each semi-invariant ring of the complete triple flag of length $n$ is an upper cluster algebra associated to an ice hive quiver. We find a rational polyhedral cone ${\sf G}_n$ such that the generic cluster character maps its…
In this paper, we establish a bijection between the infinite reduced words of an affine Weyl group and certain biclosed sets of its positive system and determine all finitely generated biclosed sets in the positive system of an affine Weyl…
Worldsheet string theory compactified on exceptional holomony manifolds is revisited following arXiv:1809.06376, where aspects of the chiral symmetry were described for the case where the compact space is a 7-dimensional G$_2$-holonomy…
State-of-the-art multilingual systems rely on shared vocabularies that sufficiently cover all considered languages. To this end, a simple and frequently used approach makes use of subword vocabularies constructed jointly over several…
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…
We introduce a family of automorphisms on the bosonic extension of arbitrary type and show that they satisfy the braid relations. They preserve the global basis and the crystal basis. Using this braid group action, we define a subalgebra…
We propose a simple method for constructing representations of (super)conformal and nonlinear W-type algebras in terms of their subalgebras and corresponding Nambu-Goldstone fields. We apply it to N=2 and N=1 superconformal algebras and…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
Cluster automorphisms have been shown to have links to the mapping class groups of surfaces, maximal green sequences and to exchange graph automorphisms for skew-symmetric cluster algebras. In this paper we aim to generalise these results…
Symmetry plays a major role in subgraph matching both in the description of the graphs in question and in how it confounds the search process. This work addresses how to quantify these effects and how to use symmetries to increase the…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
Let $G$ be a simply connected simple algebraic group over $\mathbb{C}$, $B$ and $B_-$ be its two opposite Borel subgroups. For two elements $u$, $v$ of the Weyl group $W$, it is known that the coordinate ring ${\mathbb C}[G^{u,v}]$ of the…
Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…
We introduce a global equivariant refinement of algebraic K-theory; here `global equivariant' refers to simultaneous and compatible actions of all finite groups. Our construction turns a specific kind of categorical input data into a global…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
We construct a hierarchy of supersymmetric string theories by showing that the general N-extended superstrings may be viewed as a special class of the (N+1)-extended superstrings. As a side result, we find a twisted (N+2) superconformal…
We study the problem of modeling a binary operation that satisfies some algebraic requirements. We first construct a neural network architecture for Abelian group operations and derive a universal approximation property. Then, we extend it…
Biserial algebras are a classical class in the representation theory of algebras, generalizing Nakayama algebras. They were further generalized by Green and Schroll to multiserial algebras, which share many structural properties with…