相关论文: Plabic R-matrices

In this thesis we study the relationship between the existence of canonical metrics on a complex manifold and stability in the sense of geometric invariant theory. We introduce a modification of K-stability of a polarised variety which we…

In this paper we construct an explicit map from planar bicolored (plabic) trivalent graphs representing a given irreducible positroid cell $S$ in the totally non-negative Grassmannian $Gr^{\mbox{TNN}}(k,n)$ to the spectral data for the…

Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…

Using the Plucker map between grassmannians, we study basic aspects of classic grassmannian geometries. For `hyperbolic' grassmannian geometries, we prove some facts (for instance, that the Plucker map is a minimal isometric embedding) that…

For any cluster algebra whose underlying combinatorial data can be encoded by a bordered surface with marked points, we construct a geometric realization in terms of suitable decorated Teichmueller space of the surface. On the geometric…

We study the interplay between double cross sum decompositions of a given Lie algebra and classical r-matrices for its semidual. For a class of Lie algebras which can be obtained by a process of generalised complexification we derive an…

The C-Planarity problem asks for a drawing of a $\textit{clustered graph}$, i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by a simple closed region with no edge-edge crossings, no…

A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the Euclidean plane $\mathbb{R}^2$. Recognizing them is known to be $\exists\mathbb{R}$-complete, i.e., as hard as solving a system of polynomial…

In this paper we study the Grassmannian of submodules of a given dimension inside a finitely generated projective module $P$ for a finite dimensional algebra $\Lambda$ over an algebraically closed field. The orbit of such a submodule $C$…

Geometry can be used to explain many properties commonly observed in real networks. It is therefore often assumed that real networks, especially those with high average local clustering, live in an underlying hidden geometric space.…

Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry are studied recently. In this paper, we give fast algorithms to compute these invariants by expressing them in terms of the discrete Laplacian…

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…

We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.

We study the statistical properties of piecewise expanding maps in the general setting of metric measure spaces. We provide sufficient conditions for exponential mixing of such systems with explicit estimates on the constants. We also…

We study the pullback of the apolarity invariant of complex polynomials in one variable under a polynomial map on the complex plane. As a consequence, we obtain variations of the classical results of Grace and Walsh in which the unit disk,…

We define group-twisted Alexander-Whitney and Eilenberg-Zilber maps for converting between bimodule resolutions of skew group algebras. These algebras are the natural semidirect products recording actions of finite groups by automorphisms.…

The one-dimensional Hubbard model is an exceptional integrable spin chain which is apparently based on a deformation of the Yangian for the superalgebra gl(2|2). Here we investigate the quantum-deformation of the Hubbard model in the…

We present a probabilistic graphical model formulation for the graph clustering problem. This enables to locally represent uncertainty of image partitions by approximate marginal distributions in a mathematically substantiated way, and to…

The Wronski map is a finite, PGL_2(C)-equivariant morphism from the Grassmannian Gr(d,n) to a projective space (the projectivization of a vector space of polynomials). We consider the following problem. If C_r < PGL_2(C) is a cyclic…

Graph-Laplacians and their spectral embeddings play an important role in multiple areas of machine learning. This paper is focused on graph-Laplacian dimension reduction for the spectral clustering of data as a primary application. Spectral…