Cover Image

Computing the Volume of Polytropes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hong-Minh, Killian, Sheehan, Paul
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tropical Fermat-Weber Polytropes
by: Sabol, John, et al.
Published: (2024)

Characterization of graphs without even $F$-orientations
by: Abreu, M., et al.
Published: (2015)

Dual Mixed Volume
by: Gao, Yibo, et al.
Published: (2024)

On the Algebraic Bases of Polyzetas
by: Minh, Vincel Hoang Ngoc
Published: (2025)

Hyperlogarithms: Functions on Free Monoids
by: Minh, Vincel Hoang Ngoc
Published: (2025)

Primal-Dual Cops and Robber
by: Ha, Minh Tuan, et al.
Published: (2023)

Volume Polynomials and Log-concavity of the Characteristic Polynomials of Matroids
by: Katz, Eric
Published: (2025)

Volume inequalities for flow polytopes of full directed acyclic graphs
by: Braun, Benjamin, et al.
Published: (2024)

Volumes of moduli spaces of directed ribbon graphs and Cut-and-Join operators
by: Barazer, Simon
Published: (2025)

Normalized Volumes of Type-PQ Adjacency Polytopes for Certain Classes of Graphs
by: Davis, Robert, et al.
Published: (2022)

The number of cut-edges and conflict-free connection number in planar graphs
by: Ha, Pham Hoang, et al.
Published: (2026)

Self-intersections of arcs on a pair of pants
by: Doan, Nhat Minh, et al.
Published: (2024)

Level-Rank Dualities for Finite Reductive Groups
by: Trinh, Minh-Tâm Quang, et al.
Published: (2025)

Volumes of subset Minkowski sums and the Lyusternik region
by: Barthe, Franck, et al.
Published: (2021)

The Challenge of Computing Geode Numbers
by: Amdeberhan, Tewodros, et al.
Published: (2025)

Computing the degreewidth of a digraph is hard
by: Aboulker, Pierre, et al.
Published: (2024)

Computational results on semistrong edge coloring of graphs
by: Lin, Yuquan, et al.
Published: (2025)

An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
by: Aldi, Marco, et al.
Published: (2025)

Full Resolution to Papikian's Conjecture
by: Vollrath, Paul
Published: (2025)

Non-separable graphs meet Ledoux's polynomials
by: Mansanarez, Paul
Published: (2025)

On the theory of Lucas coloring
by: Paul, Pravakar
Published: (2024)

On $3$-designs from $PGL(2,q)$
by: Tricot, Paul
Published: (2024)

Symmetric Perfect $2$-colorings on $J(10,3)$
by: Tricot, Paul
Published: (2024)

A Cauchy-Davenport theorem for locally compact groups
by: Jing, Yifan, et al.
Published: (2021)

Corrigendum to "Higher Lorentzian polynomials,...in codimension two" [International Mathematics Research Notices, Volume 2025, Issue 13, July 2025, arXiv:2208.05653]
by: Marques, Pedro Macias, et al.
Published: (2026)

Extremal Zagreb indices of bicyclic hypergraphs
by: Zhou, Hong, et al.
Published: (2025)

Lexicographical ordering by spectral moments of bicyclic hypergraphs
by: Zhou, Hong, et al.
Published: (2025)

Volumes of odd strata of quadratic differentials
by: Duryev, Eduard, et al.
Published: (2025)

The Bin Packing Problem with Setups: Formulation, Structural Properties and Computational Insights
by: Baldacci, Roberto, et al.
Published: (2025)

Computing fault-tolerant metric dimension of graphs using their primary subgraphs
by: Prabhu, S., et al.
Published: (2025)

Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort
by: Yi, Kai
Published: (2026)

Computing excluded minors for classes of matroids representable over partial fields
by: Brettell, Nick, et al.
Published: (2023)

The weak Lefschetz properties of artinian monomial algebras associated to certain tadpole graphs
by: Hung, Phan Minh, et al.
Published: (2024)

Partial Resolutions and Noncrossing Combinatorics
by: Trinh, Minh-Tâm Quang, et al.
Published: (2026)

The global structure of locally chordal graphs
by: Abrishami, Tara, et al.
Published: (2025)

On upper domatic number of graphs
by: Paul, Subhabrata, et al.
Published: (2024)

Minors of plane digraphs
by: Chudnovsky, Maria, et al.
Published: (2026)

Maker-Breaker Rado games for equations with radicals
by: Gaiser, Collier, et al.
Published: (2023)

Computation of dominant ideals
by: Bigatti, Anna Maria, et al.
Published: (2025)

An $O(n\log^2n)$ Algorithm for Computing Hankel Determinants up to Order $n$
by: Liu, Feihu, et al.
Published: (2025)