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

推荐订阅源

GbyAI
GbyAI
B
Blog
Stack Overflow Blog
Stack Overflow Blog
量子位
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
T
Tailwind CSS Blog
MongoDB | Blog
MongoDB | Blog
小众软件
小众软件
博客园 - 三生石上(FineUI控件)
Recent Announcements
Recent Announcements
U
Unit 42
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
腾讯CDC
D
DataBreaches.Net
Microsoft Azure Blog
Microsoft Azure Blog
G
Google Developers Blog
M
MIT News - Artificial intelligence
P
Proofpoint News Feed
罗磊的独立博客
L
LangChain Blog
V
Visual Studio Blog
雷峰网
雷峰网
aimingoo的专栏
aimingoo的专栏
宝玉的分享
宝玉的分享

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}}$
Koszul Algebras and Flow Lattices
Zsuzsanna Dancso, Anthony M. Licata · 2019-05-08 · via math.CO updates on arXiv.org

We provide a homological algebraic realization of the lattices of integer cuts and integer flows of graphs. To a finite 2-edge-connected graph $Γ$ with a spanning tree $T$, we associate a finite dimensional Koszul algebra $A_{Γ,T}$. Under the construction, planar dual graphs with dual spanning trees are associated Koszul dual algebras. The Grothendieck group of the category of finitely-generated $A_{Γ,T}$ modules is isomorphic to the Euclidean lattice $\mathbb Z^{E(Γ)}$, and we describe the sublattices of integer cuts and integer flows on $Γ$ in terms of the representation theory of $A_{Γ,T}$. The grading on $A_{Γ,T}$ gives rise to $q$-analogs of the lattices of integer cuts and flows; these $q$-lattices depend non-trivially on the choice of spanning tree. We give a $q$-analog of the matrix-tree theorem, and prove that the $q$-flow lattice of $(Γ_1,T_1)$ is isomorphic to the $q$-flow lattice of $(Γ_2,T_2)$ if and only if there is a cycle preserving bijection from the edges of $Γ_1$ to the edges of $Γ_2$ taking the spanning tree $T_1$ to the spanning tree $T_2$. This gives a $q$-analog of a classical theorem of Caporaso-Viviani and Su-Wagner.