Search arXivSearch

arXiv · 1008.2950

Partitions, rooks, and symmetric functions in noncommuting variables

Abstract

Let $Π_n$ denote the set of all set partitions of $\{1,2,\ldots,n\}$. We consider two subsets of $Π_n$, one connected to rook theory and one associated with symmetric functions in noncommuting variables. Let $\cE_n\sbeΠ_n$ be the subset of all partitions corresponding to an extendable rook (placement) on the upper-triangular board, $\cT_{n-1}$. Given $π\inΠ_m$ and $\si\inΠ_n$, define their {\it slash product\/} to be $π|\si=π\cup(\si+m)\inΠ_{m+n}$ where $\si+m$ is the partition obtained by adding $m$ to every element of every block of $\si$. Call $τ$ {\it atomic\/} if it can not be written as a nontrivial slash product and let $\cA_n\sbeΠ_n$ denote the subset of atomic partitions. Atomic partitions were first defined by Bergeron, Hohlweg, Rosas, and Zabrocki during their study of $NCSym$, the symmetric functions in noncommuting variables. We show that, despite their very different definitions, $\cE_n=\cA_n$ for all $n\ge0$. Furthermore, we put an algebra structure on the formal vector space generated by all rook placements on upper triangular boards which makes it isomorphic to $NCSym$. We end with some remarks and an open problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mahir Bilen Can, Bruce E. Sagan. 2010-08-17. Partitions, rooks, and symmetric functions in noncommuting variables. https://arxiv.org/abs/1008.2950

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