Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.04907

A Toric Analogue for Greene's Rational Function of a Poset

Elise Catania
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a finite poset, Greene introduced a rational function obtained by summing certain rational functions over the linear extensions of the poset. This function has interesting interpretations, and for certain families of posets, it simplifies surprisingly. In particular, Greene evaluated this rational function for strongly planar posets in his work on the Murnaghan-Nakayama formula. In 2012, Develin, Macauley, and Reiner introduced toric posets, which combinatorially are equivalence classes of posets (or rather acyclic quivers) under the operation of flipping maximum elements into minimum elements and vice versa. In this work, we introduce a toric analogue of Greene's rational function for toric posets, and study its properties. In addition, we use toric posets to show that the Kleiss-Kuijf relations, which appear in scattering amplitudes, are equivalent to a specific instance of Greene's evaluation of his rational function for strongly planar posets. Also in this work, we give an algorithm for finding the set of toric total extensions of a toric poset.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elise Catania. 2025-01-13. A Toric Analogue for Greene's Rational Function of a Poset. https://arxiv.org/abs/2409.04907

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗