Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Spencer Backman"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020)
A fourientation of a graph G is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. We may naturally view fourientations as a mixture of subgraphs and graph orientations where unor
Externí odkaz:
https://doaj.org/article/1b2942ea4c8c49d480fc944cc4ca89b4
Publikováno v:
Forum of Mathematics, Sigma, Vol 7 (2019)
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 of the Jacobian group (also known as the critical group
Externí odkaz:
https://doaj.org/article/11d156aa92434a44b75f47b05e306118
Autor:
Ahmed Ashraf, Spencer Backman
Publikováno v:
Proceedings of the American Mathematical Society.
Lopéz de Medrano-Rincón-Shaw defined Chern-Schwartz-MacPher-son cycles for an arbitrary matroid M {M} and proved by an inductive geometric argument that the unsigned degrees of these cycles agree with the coefficients of T ( M ; x , 0 ) T({M};x,0)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae936a22a872948f5a41ab23d61e00a7
https://doi.org/10.1090/proc/16145
https://doi.org/10.1090/proc/16145
Autor:
Spencer Backman
Publikováno v:
Handbook of the Tutte Polynomial and Related Topics ISBN: 9780429161612
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3c2feb45dba7c7193e83e89c61a86aa
https://doi.org/10.1201/9780429161612-5
https://doi.org/10.1201/9780429161612-5
Autor:
Tony Huynh, Spencer Backman
Publikováno v:
Compute, 7 (4
It is well-known that the Ford-Fulkerson algorithm for finding a maximum flow in a network need not terminate if we allow the arc capacities to take irrational values. Every non-Terminating example converges to a limit flow, but this limit flow need
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e60ff436b7187cb80482313b47bfe7f0
https://doi.org/10.3233/com-180082
https://doi.org/10.3233/com-180082
Autor:
Spencer Backman
Publikováno v:
Advances in Mathematics. 309:655-691
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 employ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8b7b812a1b66d99fe4f1d6a25427c7e
https://doi.org/10.1016/j.aim.2017.01.005
https://doi.org/10.1016/j.aim.2017.01.005
Autor:
Spencer Backman, Madhusudan Manjunath
Publikováno v:
Journal of Algebraic Combinatorics. 42:1097-1110
For a finite index sublattice L of the root lattice of type A, we construct a deterministic algorithm to deform the lattice ideal $$I_\mathrm{L}$$IL to a nearby generic lattice ideal, answering a question posed by Miller and Sturmfels. Our algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa49b7008c6cf9aea2102f73281132ac
https://doi.org/10.1007/s10801-015-0618-x
https://doi.org/10.1007/s10801-015-0618-x
Autor:
Sam Hopkins, Spencer Backman
Publikováno v:
Springer International Publishing
A fourientation of a graph is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. Fixing a total order on the edges and a reference orientation of the graph, we investigate propert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1316fcbb416180908379cee053b7e30
https://doi.org/10.1186/s40687-017-0107-z
https://doi.org/10.1186/s40687-017-0107-z
Let $M$ be a regular matroid. The Jacobian group ${\rm 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 of the Jacobian group (also known as the critical group o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::352011551072a75ff399e5199f0055f9
Autor:
Spencer Backman
Publikováno v:
Electronic Notes in Discrete Mathematics. 43:379-388
We investigate chip-firing with respect to open covers of discrete graphs and metric graphs. For the case of metric graphs we show that given an open cover and a sink q , stabilization of a divisor D is unique and that there is a distinguished config
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d6029a1377dd2a4385b1b4cd3369c96
https://doi.org/10.1016/j.endm.2013.07.056
https://doi.org/10.1016/j.endm.2013.07.056