相关论文: Integrable cluster dynamics of directed networks a…

In recent work, we presented the construction of a family of difference equations associated with the Stieltjes continued fraction expansion of a certain function on a hyperelliptic curve of genus $g$. As well as proving that each such…

Cluster algebras are commutative rings with a set of distinguished generators having a remarkable combinatorial structure. They were introduced by Fomin and Zelevinsky in 2000 in the context of Lie theory, but have since appeared in many…

In this work we study the integrability of a family of nonlinear oscillators. Dynamical systems from this family appear in different applications from mechanics to chemistry. We propose an approach for finding first integrals and…

LP algebras, introduced by Lam and Pylyavskyy, are a generalization of cluster algebras. These algebras are known to have the Laurent phenomenon, but positivity remains conjectural. Graph LP algebras are finite LP algebras encoded by a…

We investigate the question of studying spectral clustering in a Hilbert space where the set of points to cluster are drawn i.i.d. according to an unknown probability distribution whose support is a union of compact connected components. We…

In 2011 Musiker, Schiffler and Williams obtained expansion formulae for cluster algebras from orientable surfaces. For singly and doubly notched arcs these formulae required the notion of $\gamma$-symmetric perfect matchings and…

In a recent work, we constructed a rational map from a simple Lie group $\mathcal G$ to itself that intertwines the standard Poisson--Lie structure on $\mathcal G$ with a Poisson homogeneous one defined by a pair of quasi-triangular…

We show that having any planar (cyclic or acyclic) directed network on a disc with the only condition that all $n_1+m$ sources are separated from all $n_2+m$ sinks, we can construct a cluster-algebra realization of elements of an affine…

We present an intuitive diagrammatic representation of a new class of integrable $\s$-models. It is shown that to any given diagram corresponds an integrable theory that couples $N$ WZW models with a certain number of each of the following…

Part of these notes was written as the author's 2013 master thesis. For proper flat schemes over a complete discrete valuation ring of mixed characteristic, we construct an isomorphism of certain subgroups of the Picard group and the first…

We study a discrete dynamic on weighted bipartite graphs on a torus, analogous to dimer integrable systems in Goncharov-Kenyon 2013. The dynamic on the graph is an urban renewal together with shrinking all 2-valent vertices, while it is a…

This paper investigates the Poisson geometry of cluster algebras and the corresponding ideal theory of quantum cluster algebras. We then show how our approach can be applied to the ring theory of quantized coordinate rings. We give a new…

Classifying whole images is a classic problem in machine learning, and graph neural networks are a powerful methodology to learn highly irregular geometries. It is often the case that certain parts of a point cloud are more important than…

This paper provides some applications of the Poisson cohomology groups introduced by Flato, Gerstenhaber and Voronov. Given an abelian extension of a Poisson algebra by a representation, we first investigate the inducibility of a pair of…

Partitioning a graph into groups of vertices such that those within each group are more densely connected than vertices assigned to different groups, known as graph clustering, is often used to gain insight into the organisation of large…

The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…

Dorn and Otto (1994) and independently Zamolodchikov and Zamolodchikov (1996) proposed a remarkable explicit expression, the so-called DOZZ formula, for the 3 point structure constants of Liouville Conformal Field Theory (LCFT), which is…

Spectral clustering is a widely studied problem, yet its complexity is prohibitive for dynamic graphs of even modest size. We claim that it is possible to reuse information of past cluster assignments to expedite computation. Our approach…

Graph LP algebras are a generalization of cluster algebras introduced by Lam and Pylyavskyy. We provide a combinatorial proof of positivity for certain cluster variables in these algebras. This proof uses a hypergraph generalization of…

This paper proposes a Mixed-Integer Linear Programming approach for the Soft Graph Clustering Problem. This is the first method that simultaneously allocates membership proportion for vertices that lie in multiple clusters, and that…