Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1705.05454

A $q$-deformation of the symplectic Schur functions and the Berele insertion algorithm

Ioanna Nteka
View original source ↗Read source document ↗Export metadata ↓

Abstract

A randomisation of the Berele insertion algorithm is proposed, where the insertion of a letter to a symplectic Young tableau leads to a distribution over the set of symplectic Young tableaux. Berele's algorithm provides a bijection between words from an alphabet and a symplectic Young tableau along with a recording oscillating tableau. The randomised version of the algorithm is achieved by introducing a parameter $0 < q < 1$. The classic Berele algorithm corresponds to letting the parameter $q \to 0$. The new version provides a probabilistic framework that allows to prove Littlewood-type identities for a $q$-deformation of the symplectic Schur functions. These functions correspond to multilevel extensions of the continuous $q$-Hermite polynomials. Finally, we show that when both the original and the $q$-modified insertion algorithms are applied to a random word then the shape of the symplectic Young tableau evolves as a Markov chain on the set of partitions.

Explore related subjects

math.COmath.PRmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ioanna Nteka. 2017-08-15. A $q$-deformation of the symplectic Schur functions and the Berele insertion algorithm. https://arxiv.org/abs/1705.05454

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↗