Related papers: Electrical networks and Lagrangian Grassmannians
In [RW19] Rietsch and Williams relate cluster structures and mirror symmetry for type A Grassmannians Gr(k, n), and use this interaction to construct Newton-Okounkov bodies and associated toric degenerations. In this article we define a…
We study the ring of regular functions on the space of planar electrical networks, which we coin the grove algebra. This algebra is an electrical analogue of the Pl\"ucker ring studied classically in invariant theory. We develop the…
We construct the lattice gauge theory of the group G_N, the semidirect product of the permutation group S_N with U(1)^N, on an arbitrary Riemann surface. This theory describes the branched coverings of a two-dimensional target surface by…
The totally nonnegative Grassmannian is the set of k-dimensional subspaces V of R^n whose nonzero Pluecker coordinates all have the same sign. Gantmakher and Krein (1950) and Schoenberg and Whitney (1951) independently showed that V is…
Gaetz, Pechenik, Pfannerer, Striker, and Swanson introduced the concept of hourglass plabic graphs and provided a method for computing web diagrams and invariants corresponding to $4\times n$ Young tableaux, while Elkin, Musiker, and Wright…
In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…
We prove a case of a positivity conjecture of Mihalcea-Singh, concerned with the local Euler obstructions associated to the Schubert stratification of the Lagrangian Grassmannian LG(n,2n). Combined with work of…
For a graph $G$, the $\ell$-deck of $G$ is the multiset of induced subgraphs on $G$ having $\ell$ vertices. Recently, Groenland et al. proved that any tree can be reconstructed from its $(8/9+o(1))n$-deck. For the particular case of…
This article revisits and elaborates the significant role of positive geometry of momentum twistor Grassmannian for planar N=4 SYM scattering amplitudes. First we establish the fundamentals of positive Grassmannian geometry for tree…
The Lights Out Puzzle, played on a graph $\Gamma$, has been studied using linear algebra over $\mathbb{F}_2$ and more generally over $\mathbb{Z}/k\mathbb{Z}$. We generalize the setting by allowing the states of vertices to be the elements…
A $k$-polar Grassmannian is the geometry having as pointset the set of all $k$-dimensional subspaces of a vector space $V$ which are totally isotropic for a given non-degenerate bilinear form $\mu$ defined on $V.$ Hence it can be regarded…
These are lecture notes intended to supplement my second lecture at the Current Developments in Mathematics conference in 2014. In the first half of article, we give an introduction to the totally nonnegative Grassmannian together with a…
We associate real and regular algebraic--geometric data to each multi--line soliton solution of Kadomtsev-Petviashvili II (KP) equation. These solutions are known to be parametrized by points of the totally non--negative part of real…
In this paper we proof that any cactus graph satisfies graph complement conjecture by finding a orthogonal representation of its complement in $\mathbb{R}^5$.
Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer…
The totally nonnegative part of a partial flag variety G/P has been shown by the first author to be a union of semi-algebraic cells. Moreover she showed that the closure of a cell is the union of smaller cells. In this note we provide…
A tree-based network $N$ on $X$ is called universal if every phylogenetic tree on $X$ is a base tree for $N$. Recently, binary universal tree-based networks have attracted great attention in the literature and their existence has been…
We propose Lattice gauge equivariant Convolutional Neural Networks (L-CNNs) for generic machine learning applications on lattice gauge theoretical problems. At the heart of this network structure is a novel convolutional layer that…
The study and calculation of spectrum of networks can be used to describe networks structure and quantify analysis of networks performance. The fractal M\"{o}bius octagonal networks, denoted by $Q_n$, is derived from the inverse…
We study a representation-theoretic refinement of the ordinary Laplacian spectrum of a graph. Given a graph $G$ on $n$ vertices, one may associate to it the element \[ X_G=\sum_{ij\in E(G)} (ij)\in \C[S_n]. \] The action of $X_G$ in…