Related papers: Train track combinatorics and cluster algebras
We show that for $g\ge 2$, all integers $1 \le d \le 3g-3$ arise as trace field degrees of pseudo-Anosov mapping classes in the Torelli group of the closed orientable surface of genus $g$. Our method uses the Thurston-Veech construction of…
As an improvement of the combinatorial realization of totally positive matrices via the essential positive weightings of certain planar network by S.Fomin and A.Zelevisky \cite{[4]}, in this paper, we give the test method of positive…
We review several constructions of integrable systems with an underlying cluster algebra structure, in particular the Gekhtman-Shapiro-Tabachnikov-Vainshtein construction based on perfect networks and the Goncharov-Kenyon approach based on…
The development of autonomous vehicles requires having access to a large amount of data in the concerning driving scenarios. However, manual annotation of such driving scenarios is costly and subject to the errors in the rule-based…
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…
We obtain general trace formulae in the case of perturbation of self-adjoint operators by self-adjoint operators of class $\bS_m$, where $m$ is a positive integer. In \cite{PSS} a trace formula for operator Taylor polynomials was obtained.…
We introduce a new class of combinatorial objects, named tight gradings, which are certain nonnegative integer-valued functions on maximal Dyck paths. Using tight gradings, we derive a manifestly positive formula for any wall-function in a…
Clustering trajectory data attracted considerable attention in the last few years. Most of prior work assumed that moving objects can move freely in an euclidean space and did not consider the eventual presence of an underlying road network…
We prove a conjecture of W. Hackbusch about tensor network states related to a perfect binary tree and train track tree. Tensor network states are used to present seemingly complicated tensors in a relatively simple and efficient manner.…
Lots of research focuses on the combinatorics behind various bases of cluster algebras. This paper studies the natural basis of a type A cluster algebra, which consists of all cluster monomials. We introduce a new kind of combinatorial…
We introduce the definition of tensorized block rational Krylov subspaces and its relation with multivariate rational functions, extending the formulation of tensorized Krylov subspaces introduced in [Kressner D., Tobler C., Krylov subspace…
We introduce twisted triple crossing diagram maps, collections of points in projective space associated to bipartite graphs on the cylinder, and use them to provide geometric realizations of the cluster integrable systems of Goncharov and…
We establish several useful commutative diagrams consisting of low term exact sequences attached to {\Grot} spectral sequences, which extends and integrates the previous ones appeared in literature such as Alexei~N. Skorobogatov [Beyond the…
Goulden and Jackson introduced a very powerful method to study the distributions of certain consecutive patterns in permutations, words, and other combinatorial objects which is now called the cluster method. There are a number of natural…
We give characterizations for the existence of traces for first order Sobolev spaces defined on regular trees.
We prove the full Fock--Goncharov conjecture for $\mathcal{A}_{SL_2,\Sigma_{g,p}}$, the $\mathcal{A}$-cluster variety of the moduli of decorated twisted $SL_2$-local systems on triangulable surfaces $\Sigma_{g,p}$ with at least 2 punctures.…
In 1980's, Thurston established a combinatorial characterization for post-critically finite rational maps. This criterion was then extended by Cui, Jiang, and Sullivan to sub-hyperbolic rational maps. The goal of this paper is to present a…
Zamolodchikov periodicity is a property of certain discrete dynamical systems and was one of the primary motivations for the creation of cluster algebras. It was first observed by Zamolodchikov in his study of thermodynamic Bethe ansatz,…
Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the…
We compare the spectra of Dynnikov matrices with the spectra of the train track transition matrices of a given pseudo-Anosov braid on the finitely punctured disk, and show that these matrices are isospectral up to roots of unity and zeros…