Search arXivSearch

arXiv · 2412.11013

A Hopf algebra generalization of the symmetric functions in partially commutative variables

Abstract

The quasisymmetric functions, $QSym$, are generalized for a finite alphabet $A$ by the colored quasisymmetric functions, $QSym_A$, in partially commutative variables. Their dual, $NSym_A$, generalizes the noncommutative symmetric functions, $NSym$, through a relationship with a Hopf algebra of trees. We define an algebra $Sym_A$, contained within $QSym_A$, that is isomorphic to the symmetric functions, $Sym$, when $A$ is an alphabet of size one. We show that $Sym_A$ is a Hopf algebra and define its graded dual, $PSym_A$, which is the commutative image of $NSym_A$ and also generalizes $Sym$. The seven algebras listed here can be placed in a commutative diagram connected by Hopf morphisms. In addition to defining generalizations of the classic bases of the symmetric functions to $Sym_A$ and $PSym_A$, we describe multiplication, comultiplication, and the antipode in terms of a basis for both algebras. We conclude by defining a pair of dual bases that generalize the Schur functions and listing open questions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Spencer Daugherty. 2024-12-15. A Hopf algebra generalization of the symmetric functions in partially commutative variables. https://arxiv.org/abs/2412.11013

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

KEEP EXPLORING

Related papers

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

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