Related papers: Cluster duality between Calkin-Wilf tree and Stern…
We introduce several classes of pseudorandom sequences which represent a natural extension of classical methods in random number generation. The sequences are obtained from constructions on labeled binary trees, generalizing the well-known…
A duality theory of bundles of C$^*$-algebras whose fibres are twisted transformation group algebras is established. Classical T-duality is obtained as a special case, where all fibres are commutative tori, i.e. untwisted group algebras for…
In representation theory of algebras, there exist two types of mutation pairs: rigid type (cluster-tilting mutations by Iyama-Yoshino) and simple-minded type (mutations of simple-minded systems by Sim\~oes-Pauksztello). It is known that…
We investigate some relations between the duality and the topological filtration in algebraic K-theory. As a result, we obtain a construction of the first Steenrod square for Chow groups modulo two of varieties over a field of arbitrary…
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…
Recent work has uncovered a connection between the symbol letters of general massless scattering and (permutations of) cluster variables of partial flag varieties. In this paper we explore the cluster adjacency of tree-level gluon…
A central limit theorem for binary tree is numerically examined. Two types of central limit theorem for higher-order branches are formulated. A topological structure of a binary tree is expressed by a binary sequence, and the…
Multiloop scattering amplitudes describing the quantum fluctuations at high-energy scattering processes are the main bottleneck in perturbative quantum field theory. The loop-tree duality is a novel method aimed at overcoming this…
The paper establishes a strong correspondence between two important clustering approaches that emerged in the 1970's: clustering by level sets or cluster tree as proposed by Hartigan and clustering by gradient lines or gradient flow as…
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…
In this paper the relationship between iterated tilted algebras and cluster-tilted algebras and relation-extensions is studied. In the Dynkin case, it is shown that the relationship is very strong and combinatorial.
Combinatoric formulas for cluster expansions have been improved many times over the years. Here we develop some new combinatoric proofs and extensions of the tree formulas of Brydges and Kennedy, and test them on a series of pedagogical…
Ensembles of coupled nonlinear oscillators are a popular paradigm and an ideal benchmark for analyzing complex collective behaviors. The onset of cluster synchronization is found to be at the core of various technological and biological…
We present an extension of the duality theorem, previously defined by S. Catani et al. on the one-loop level, to higher loop orders. The duality theorem provides a relation between loop integrals and tree-level phase-space integrals. Here,…
Succinct data structures give space-efficient representations of large amounts of data without sacrificing performance. They rely one cleverly designed data representations and algorithms. We present here the formalization in Coq/SSReflect…
Maxmin trees are labeled trees with the property that each vertex is either a local maximum or a local minimum. Such trees were originally introduced by Postnikov, who gave a formula to count them and different combinatorial interpretations…
Cluster ensemble is a pair of positive spaces (X, A) related by a map p: A -> X. It generalizes cluster algebras of Fomin and Zelevinsky, which are related to the A-space. We develope general properties of cluster ensembles, including its…
Hierarchical structure is ubiquitous in data across many domains. There are many hierarchical clustering methods, frequently used by domain experts, which strive to discover this structure. However, most of these methods limit discoverable…
We study a two-species bidirectional exclusion process, and a single species variant, which is motivated by the motion of organelles and vesicles along microtubules. Specifically, we are interested in the clustering of the particles and…
We consider skew-symmetrizable (upper) cluster algebras with a compatible Poisson structure, called $\mathsf{\Lambda}$-(upper) cluster algebras. For any two good elements (e.g., cluster monomials) in a $\mathsf{\Lambda}$-upper cluster…