Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On Plücker coordinat ...
Conference paper

On Plücker coordinates of a perfectly oriented planar network

Kelli Talaska (1)
(1) Department of Mathematics - University of Michigan
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2007
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AJ, 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008)
Proceedings
DOI
10.46298/dmtcs.3616
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
0502170
EMSW21-RTG: Enhancing the Research Workforce in Algebraic Geometry and its Boundaries in the Twenty-First Century
Indicators
540
Views
715
Downloads

On Plücker coordinates of a perfectly oriented planar network

Kelli Talaska (1)
(1) Department of Mathematics - University of Michigan
Abstract
Let $G$ be a perfectly oriented planar graph. Postnikov's boundary measurement construction provides a rational map from the set of positive weight functions on the edges of $G$ onto the appropriate totally nonnegative Grassmann cell. We establish an explicit combinatorial formula for Postnikov's map by expressing each Plücker coordinate of the image as a ratio of two polynomials in the edge weights, with positive integer coefficients. These polynomials are weight generating functions for certain subsets of edges in $G$.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • boundary measurements
  • total positivity
  • totally nonnegative Grassmannian
  • perfectly oriented network
Preview
Loading PDF preview...