Riemann-Roch Theory for Graph Orientations

@article{Backman2014RiemannRochTF,
  title={Riemann-Roch Theory for Graph Orientations},
  author={Spencer Backman},
  journal={ArXiv},
  year={2014},
  volume={abs/1401.3309}
}
We develop a new framework for investigating linear equivalence of divisors on graphs using a generalization of Gioan's cycle--cocycle reversal system for partial orientations. An oriented version of Dhar's burning algorithm is introduced and employed in the study of acyclicity for partial orientations. We then show that the Baker--Norine rank of a partially orientable divisor is one less than the minimum number of directed paths which need to be reversed in the generalized cycle--cocycle… Expand
On Computation of Baker and Norine's Rank on Complete Graphs
TLDR
An algorithm for the determination of the rank of configurations for the complete graph K_n and an apparently new parameter which is called the prerank is presented which provides an alternative description to some well known $ q,t$-Catalan numbers. Expand
The Bernardi process and torsor structures on spanning trees
Let G be a ribbon graph, i.e., a connected finite graph G together with a cyclic ordering of the edges around each vertex. By adapting a construction due to O. Bernardi, we associate to any pairExpand
Partial graph orientations and the Tutte polynomial
Gessel and Sagan investigated the Tutte polynomial, $T(x,y)$ using depth first search, and applied their techniques to show that the number of acyclic partial orientations of a graph isExpand
Geometric bijections between spanning trees and break divisors
  • C. Yuen
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. A
  • 2017
TLDR
A special class of geometric bijections that are called edge ordering maps, which have good algorithmic properties are introduced, which provide a new geometric method for constructingBijections in combinatorics. Expand
Flow-Cut Dualities for Sheaves on Graphs
This paper generalizes the Max-Flow Min-Cut (MFMC) theorem from the setting of numerical capacities to sheaves of partial semimodules over semirings on directed graphs. Motivating examples of partialExpand
Divisors on graphs, orientations, syzygies, and system reliability
We study various ideals arising in the theory of system reliability. We use ideas from the theory of divisors, orientations, and matroids on graphs to describe the minimal polyhedral cellularExpand
Effective divisor classes on metric graphs
We introduce the notion of semibreak divisors on metric graphs (tropical curves) and prove that every effective divisor class (of degree at most the genus) has a semibreak divisor representative.Expand
GEOMETRIC BIJECTIONS FOR REGULAR MATROIDS, ZONOTOPES, AND EHRHART THEORY
Let $M$ be a regular matroid. The Jacobian group $\text{Jac}(M)$ of $M$ is a finite abelian group whose cardinality is equal to the number of bases of $M$ . This group generalizes the definition ofExpand
On the number of circuit-cocircuit reversal classes of an oriented matroid
TLDR
The circuit-cocircuit reversal system of an oriented matroid is extended to an equivalence of matroidal properties, thereby giving a new characterization of regular matroids. Expand
On the Gonality of Cartesian Products of Graphs
TLDR
The upper bound to prove that Baker's gonality conjecture holds for the Cartesian product of any two graphs with two or more vertices each is presented, and precisely which nontrivial product graphs have gonality equal to Baker's conjectural upper bound is determined. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 57 REFERENCES
The Riemann-Roch theorem for graphs and the rank in complete graphs
The paper by M. Baker and S. Norine in 2007 introduced a new parameter on configurations of graphs and gave a new result in the theory of graphs which has an algebraic geometry flavour. This resultExpand
Riemann-Roch for Sublattices of the Root Lattice A n
Recently, Baker and Norine {Advances in Mathematics, 215(2): 766-788, 2007} found new analogies between graphs and Riemann surfaces by developing a Riemann-Roch machinery on a finite graph $G$. InExpand
Rank-determining sets of metric graphs
  • Ye Luo
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. A
  • 2011
TLDR
It is shown constructively in this paper that there exist finite rank-determining sets and the v"0-reduced divisor from any effective Divisor in the same linear system is derived. Expand
Riemann-Roch for Sub-Lattices of the Root Lattice An
TLDR
A general Riemann-Roch Theory for sub-lattices of the root lattice of $A_n$ is developed by following the work of Baker and Norine, and connections between the RiemANN-R Coch theory and the Voronoi diagrams of lattices under certain simplicial distance functions are established. Expand
Enumerating degree sequences in digraphs and a cycle-cocycle reversing system
  • E. Gioan
  • Computer Science, Mathematics
  • Eur. J. Comb.
  • 2007
TLDR
It is shown that indegree sequences can represent the configurations of discrete dynamical systems in digraphs consisting in reversing cycles, cocycles, or both, which extend the edge firing game by considering all orientations and by introducing duality. Expand
Tutte Polynomial, Subgraphs, Orientations and Sandpile Model: New Connections via Embeddings
  • O. Bernardi
  • Computer Science, Mathematics
  • Electron. J. Comb.
  • 2008
TLDR
The bijection $\Phi$ is closely related to a recent characterization of the Tutte polynomial relying on combinatorial embeddings of graphs, that is, on a choice of cyclic order of the edges around each vertex. Expand
Bigraphical Arrangements
We define the bigraphical arrangement of a graph and show that the Pak-Stanley labels of its regions are the parking functions of a closely related graph, thus proving conjectures of Duval, Klivans,Expand
Lattice structure for orientations of graphs
Earlier researchers have studied the set of orientations of a connected finite graph $G$, and have shown that any two such orientations having the same flow-difference around all closed loops can beExpand
Chip-firing games on Eulerian digraphs and -hardness of computing the rank of a divisor on a graph
TLDR
It is proved that computing the rank of a divisor on a graph is NP -hard, even for simple graphs, by relating chip-firing on directed and undirected graphs. Expand
Riemann–Roch and Abel–Jacobi theory on a finite graph
Abstract It is well known that a finite graph can be viewed, in many respects, as a discrete analogue of a Riemann surface. In this paper, we pursue this analogy further in the context of linearExpand
...
1
2
3
4
5
...