惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Apple Machine Learning Research
Apple Machine Learning Research
博客园 - 三生石上(FineUI控件)
雷峰网
雷峰网
WordPress大学
WordPress大学
S
SegmentFault 最新的问题
博客园 - 叶小钗
The Cloudflare Blog
T
Tailwind CSS Blog
Hugging Face - Blog
Hugging Face - Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
月光博客
月光博客
小众软件
小众软件
罗磊的独立博客
酷 壳 – CoolShell
酷 壳 – CoolShell
大猫的无限游戏
大猫的无限游戏
阮一峰的网络日志
阮一峰的网络日志
V
V2EX
美团技术团队
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 聂微东
量子位
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
宝玉的分享
宝玉的分享

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Internal edge vectors on plabic networks in the disk and ...
Simonetta Abenda, Petr G. Grinevich · 2021-08-07 · via math.CO updates on arXiv.org

Following [42], positroid cells ${\mathcal S}_{\mathcal M}^{\mbox{TNN}}$ in totally non-negative Grassmannians ${Gr^{\mbox{TNN}} (k,n)}$ admit parametrizations by positive weights on planar bicolored directed perfect networks in the disk. An explicit formula for elements of matrices representing the points in ${\mathcal S}_{\mathcal M}^{\mbox{TNN}}$ was obtained in [49] in terms of flows on such networks. The formulas from [42,49] are defined on the boundary edge vectors. In this paper we propose an extension of these formulas for vectors on internal edges defined as summations over paths on the given directed network gauged by the choice of a ray direction. This gauge choice does not affect the boundary edge vectors, which generate the Postnikov boundary measurement map. The systems of internal edge vectors corresponding to different choices of gauge ray directions coincide up to sign, the sign rule admits a simple explicit description. We prove that the components of these edge vectors are rational in the weights with subtraction--free denominators. Moreover, these components are expressed in terms of internal edge flows; these formulas extend the original Talaska ones to the internal edges. These vectors also solve the system of geometric relations associated to the corresponding network. These relations are full rank and respect the total non--negativity property on the full positroid cell. We also provide explicit formulas both for the transformation rules of the edge vectors with respect to the orientation, and for their transformations due to moves and reductions of networks.