相关论文: Internal edge vectors on plabic networks in the di…

Amalgamation in the totally non-negative part of positroid varieties is equivalent to gluing copies of $Gr^{TP}(1,3)$ and $Gr^{TP}(2,3)$. Lam has proposed to represent amalgamation in positroid varieties by equivalence classes of relations…

The standard parametrization of totally non-negative Grassmannians was obtained by A. Postnikov [45] introducing the boundary measurement map in terms of discrete path integration on planar bicolored (plabic) graphs in the disk. An…

For a planar directed graph G, Postnikov's boundary measurement map sends positive weight functions on the edges of G onto the appropriate totally nonnegative Grassmann cell. We establish an explicit formula for Postnikov's map by…

We complete the program of Ref. [3,5] of connecting totally non-negative Grassmannians to the reality problem in KP finite-gap theory via the assignment of real regular divisors on rational degenerations of M-curves for the class of real…

Postnikov constructed a decomposition of a totally nonnegative Grassmannian into positroid cells. We provide combinatorial formulas that allow one to decide which cell a given point belongs to and to determine affine coordinates of the…

A plabic graph is a planar bicolored graph embedded in a disk, which satisfies some combinatorial conditions. Postnikov's boundary measurement map takes the space of positive edge weights of a plabic graph $G$ to a positroid cell in some…

Franco, Galloni, Penante, and Wen have proposed a boundary measurement map for a graph on any closed orientable surface with boundary. We consider this boundary measurement map which takes as input an edge weighted directed graph embedded…

To clarify the relationship between edge electronic states in open-boundary crystalline systems and their corresponding bulk electronic structure, Alase et al. [Phys. Rev. Lett. 117, 076804 (2016)] have recently generalized Bloch's theorem…

This paper proposes a discrimination technique for vertices in a weighted network. We assume that the edge weights and adjacencies in the network are conditionally independent and that both sources of information encode class membership…

We present new higher-order quadratures for a family of boundary integral operators re-derived using the approach introduced in [Kublik, Tanushev, and Tsai - J. Comp. Phys. 247: 279-311, 2013]. In this formulation, a boundary integral over…

Postnikov's plabic graphs in a disk are used to parametrize totally positive Grassmannians. In recent years plabic graphs have found numerous applications in math and physics. One of the key features of the theory is the fact that if a…

In this paper, we introduce a variation of the notion of topological phase reflecting metric structure of the position space. This framework contains not only periodic and non-periodic systems with symmetries in Kitaev's periodic table but…

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

Positroids are families of matroids introduced by Postnikov in the study of non-negative Grassmannians. In particular, positroids enumerate a CW decomposition of the totally non-negative Grassmannian. Furthermore, Postnikov has identified…

We formulate a higher-rank version of the boundary measurement map for weighted planar bipartite networks in the disk. It sends a network to a linear combination of SL$_r$-webs, and is built upon the r-fold dimer model on the network. When…

We consider the inverse problem of finding matrix valued edge or nodal quantities in a graph from measurements made at a few boundary nodes. This is a generalization of the problem of finding resistors in a resistor network from voltage and…

In this paper, we study the componentwise linearity of powers of edge ideal of a weighted oriented graph $D$. We give a characterization for componentwise linearity of the edge ideal $I(D)$ in terms of forbidden subgraphs of $D$. If $D$ is…

In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if $D$ is a weighted oriented graph whose edge ideal $I(D)$ is componentwise linear, then the underlying simple graph $G$ of $D$ is…

The aim of this paper is to discuss a relationship between total positivity and planar directed networks. We show that the inverse boundary problem for these networks is naturally linked with the study of the totally nonnegative…

We present an edge-based framework for the study of geometric elastic network models to model mechanical interactions in physical systems. We use a formulation in the edge space, instead of the usual node-centric approach, to characterise…