Search arXivSearch

arXiv · 2404.14439

Type B Set partitions, an analogue of restricted growth functions

Abstract

In this work, we study type B set partitions for a given specific positive integer $k$ defined over $\langle n\rangle=\{-n, -(n-1),\cdots -1,0,1,\cdots n-1,n\}$. We found a few generating functions of type B analogue for some of the set partition statistics defined by Wachs, White and Steingrimsson for partitions over positive integers $[n] =\{1,2,\cdots n\}$, both for standard and ordered set partitions respectively. We extended the idea of restricted growth functions utilized by Wachs and White for set partitions over $[n]$, in the scenario of $\langle n\rangle$ and called the analogue as Signed Restricted Growth Function (SRGF). We discussed analogues of major index for type B partitions in terms of SRGF. We found an analogue of Foata bijection and reduced matrix for type B set partitions as done by Sagan for set partitions of $[n]$ with sepcific number of blocks $k$. We conclude with some open questions regarding the type B analogue of some well known results already done in case of set partitions of $[n]$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amrita Acharyya. 2024-04-19. Type B Set partitions, an analogue of restricted growth functions. https://arxiv.org/abs/2404.14439

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