Related papers: Higher pentagram maps, weighted directed networks,…
We present a new automated method for finding integrable symplectic maps of the plane. These dynamical systems possess a hidden symmetry associated with an existence of conserved quantities, i.e. integrals of motion. The core idea of the…
Let $G=(V, E)$ be a planar graph and let $\mathcal{C}$ be a partition of $V$. We refer to the graphs induced by the vertex sets in $\mathcal{C}$ as Clusters. Let $D_{\mathcal C}$ be an arrangement of disks with a bijection between the disks…
Unit disk graphs are the intersection graphs of unit radius disks in the Euclidean plane. Deciding whether there exists an embedding of a given unit disk graph, i.e. unit disk graph recognition, is an important geometric problem, and has…
The homogeneous coordinate ring of the Grassmannian Gr(k,n) has a cluster structure defined in terms of planar diagrams known as Postnikov diagrams. The cluster corresponding to such a diagram consists entirely of Pluecker coordinates. We…
Clustering is an essential technique for network analysis, with applications in a diverse range of fields. Although spectral clustering is a popular and effective method, it fails to consider higher-order structure and can perform poorly on…
A graphical model provides a compact and efficient representation of the association structure of a multivariate distribution by means of a graph. Relevant features of the distribution are represented by vertices, edges and other…
We develop new methods based on graph motifs for graph clustering, allowing more efficient detection of communities within networks. We focus on triangles within graphs, but our techniques extend to other clique motifs as well. Our…
We present a general framework for constructing polynomial integrable systems on linearizations of Poisson varieties that admit log-canonical systems. Our construction is in particular applicable to Poisson varieties with compatible cluster…
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 review some important results by Gross, Hacking, Keel, and Kontsevich on cluster algebra theory, namely, the column sign-coherence of $C$-matrices and the Laurent positivity, both of which were conjectured by Fomin and Zelevinsky. We…
For the p-adic group G=SL (2) , we present results of the computations of the sums of the Bernstein projectors of a given depth. Motivation for the computations is based on a conversation with Roger Howe in August 2013. The computations are…
Poisson brackets admit infinitesimal symmetries which are encoded using oriented graphs; this construction is due to Kontsevich (1996). We formulate several open problems about combinatorial and topological properties of the graphs…
In this paper we study a so-called separatrix map introduced by Zaslaskii-Filonenko [ZF68] and studied by Treschev and Piftankin [Tre98, Tre02, Pif06, PT07]. We derive a second order expansion of this map for trigonometric perturbations. In…
One of the remarkable properties of cluster algebras is that any cluster, obtained from a sequence of mutations from an initial cluster, can be written as a Laurent polynomial in the initial cluster (known as the "Laurent phenomenon").…
We review the solution of the $A_r$ Q-systems in terms of the partition function of paths on a weighted graph, and show that it is possible to modify the graphs and transfer matrices so as to provide an explicit connection to the theory of…
We introduce a variant of stable logarithmic maps, which we call punctured logarithmic maps. They allow an extension of logarithmic Gromov-Witten theory in which marked points have a negative order of tangency with boundary divisors. As a…
Clustering is a well-known and studied problem, one of its variants, called contiguity-constrained clustering, accepts as a second input a graph used to encode prior information about cluster structure by means of contiguity constraints…
We introduce a geometric framework for constructing superintegrable systems from Poisson centralizers (commutants) in the Lie-Poisson algebra $S(\mathfrak{g})$ of a complex semisimple Lie algebra. Starting from a chain of reductive…
The ability to control a complex network towards a desired behavior relies on our understanding of the complex nature of these social and technological networks. The existence of numerous control schemes in a network promotes us to wonder:…
A tutorial introduction to projective geometric algebra (PGA), a modern, coordinate-free framework for doing euclidean geometry. PGA features: uniform representation of points, lines, and planes; robust, parallel-safe join and meet…