Search arXivSearch

arXiv · 1911.11736

Hopf monoids, permutohedral cones, and generalized retarded functions

Abstract

The commutative Hopf monoid of set compositions is a fundamental Hopf monoid internal to vector species, having undecorated bosonic Fock space the combinatorial Hopf algebra of quasisymmetric functions. We construct a geometric realization of this Hopf monoid over the adjoint of the (essentialized) braid hyperplane arrangement, which identifies the monomial basis with signed characteristic functions of the interiors of permutohedral tangent cones. We show that the indecomposable quotient Lie coalgebra is obtained by restricting functions to chambers of the adjoint arrangement, i.e. by quotienting out the higher codimensions. The resulting functions are characterized by the Steinmann relations of axiomatic quantum field theory, demonstrating an equivalence between the Steinmann relations, tangent cones to (generalized) permutohedra, and having algebraic structure internal to species. Our results give a new interpretation of a construction appearing in the mathematically rigorous formulation of renormalization by Epstein-Glaser, called causal perturbation theory. In particular, we show that operator products of time-ordered products correspond to the H-basis of the cocommutative Hopf monoid of set compositions, and generalized retarded products correspond to a spanning set of its primitive part Lie algebra.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

William Norledge, Adrian Ocneanu. 2021-04-14. Hopf monoids, permutohedral cones, and generalized retarded functions. https://arxiv.org/abs/1911.11736

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

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO