### Coding parking functions by pairs of permutations.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Back to Simple Search
# Advanced Search

In the famous paper [FZ2] Fomin and Zelevinsky obtained Cartan-Killing type classification of all cluster algebras of finite type, i.e. cluster algebras having only finitely many distinct cluster variables. A wider class of cluster algebras is formed by cluster algebras of finite mutation type which have finitely many exchange matrices (but are allowed to have infinitely many cluster variables). In this paper we classify all cluster algebras of finite mutation type with skew-symmetric exchange matrices....

As a generalization of Postnikov’s construction [P], we define a map from the space of edge weights of a directed network in an annulus into a space of loops in the Grassmannian. We then show that universal Poisson brackets introduced for the space of edge weights in [GSV3] induce a family of Poisson structures on rational matrix-valued functions and on the space of loops in the Grassmannian. In the former case, this family includes, for a particular kind of networks, the Poisson bracket associated...

We show that, if a meromorphic function of degree at most four on a real algebraic curve of an arbitrary genus has only real critical points, then it is conjugate to a real meromorphic function by a suitable projective automorphism of the image.

**Page 1**