Related papers: Positivity of permutation pattern character polyno…

We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{\lambda(\sigma)/2}$ where…

We consider polynomials $Q:=\sum _{j=0}^da_jx^j$, $a_j\in \mathbb{R}^*$, with all roots real. When the {\em sign pattern} $\sigma (Q):=({\rm sgn}(a_d),{\rm sgn}(a_{d-1})$, $\ldots$, ${\rm sgn}(a_0))$ has $\tilde{c}$ sign changes, the…

For a finite group $G$, let $K(G)$ denote the field generated over $\mathbb{Q}$ by its character values. For $n>24$, G. R. Robinson and J. G. Thompson proved that $$K(A_n)=\mathbb{Q}\left (\{ \sqrt{p^*} \ : \ p\leq n \ {\text{ an odd prime…

A D-permutation is a permutation of $[2n]$ satisfying $2k-1 \le \sigma(2k-1)$ and $2k \ge \sigma(2k)$ for all $k$; they provide a combinatorial model for the Genocchi and median Genocchi numbers. We find Stieltjes-type and Thron-type…

We prove that twisted versions of Schubert polynomials defined by $\widetilde{\mathfrak S}_{w_0} = x_1^{n-1}x_2^{n-2} \cdots x_{n-1}$ and $\widetilde{\mathfrak S}_{ws_i} = (s_i+\partial_i)\widetilde{\mathfrak S}_w$ are monomial positive and…

We consider the inverse problem for the polynomial map which sends an $m$-tuple of quadratic forms in $n$ variables to the sum of their $d$-th powers. This map captures the moment problem for mixtures of $m$ centered $n$-variate Gaussians.…

We consider the symmetric group $S_n$-module of the polynomial ring with $m$ sets of $n$ commuting variables and $m'$ sets of $n$ anti-commuting variables and show that the multiplicity of an irreducible indexed by the partition $\lambda$…

Using the theory of signatures of hermitian forms over algebras with involution, developed by us in earlier work, we introduce a notion of positivity for symmetric elements and prove a noncommutative analogue of Artin's solution to…

$n$-cycle permutations with small $n$ have the advantage that their compositional inverses are efficient in terms of implementation. They can be also used in constructing Bent functions and designing codes. Since the AGW Criterion was…

We say a permutation $\pi=\pi_1\pi_2\cdots\pi_n$ in the symmetric group $\mathfrak{S}_n$ has a peak at index $i$ if $\pi_{i-1}<\pi_i>\pi_{i+1}$ and we let $P(\pi)=\{i \in \{1, 2, \ldots, n\} \, \vert \, \mbox{$i$ is a peak of $\pi$}\}$.…

A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…

In previous work of this author it was conjectured that the sum of power sums $p_\lambda,$ for partitions $\lambda$ ranging over an interval $[(1^n), \mu]$ in reverse lexicographic order, is Schur-positive. Here we investigate this…

Let $\sigma=(\sigma_1,..., \sigma_N)$, where $\sigma_i =\pm 1$, and let $C(\sigma)$ denote the number of permutations $\pi$ of $1,2,..., N+1,$ whose up-down signature $\mathrm{sign}(\pi(i+1)-\pi(i))=\sigma_i$, for $i=1,...,N$. We prove that…

Drawing on a problem posed by Hertzsprung in 1887, we say that a given permutation $\pi\in\mathcal{S}_n$ contains the Hertzsprung pattern $\sigma\in\mathcal{S}_k$ if there is factor $\pi(d+1)\pi(d+2)\cdots\pi(d+k)$ of $\pi$ such that…

A permutation $\pi$ contains a permutation $\sigma$ as a pattern if it contains a subsequence of length $|\sigma|$ whose elements are in the same relative order as in the permutation $\sigma$. This notion plays a major role in enumerative…

In this paper we study combinatorial aspects of permutations of $\{1,\ldots,n\}$ and related topics. In particular, we prove that there is a unique permutation $\pi$ of $\{1,\ldots,n\}$ such that all the numbers $k+\pi(k)$ ($k=1,\ldots,n$)…

Given an integer $n\geq 1$ and an irreducible character $\chi_{\lambda}$ of $S_{n}$ for some partition $\lambda$ of $n$, the immanant $\mathrm{imm}_{\lambda}:\mathbb{C}^{n\times n}\to\mathbb{C}$ maps matrices $A\in\mathbb{C}^{n\times n}$ to…

The cycle polynomial of a finite permutation group $G$ is the generating function for the number of elements of $G$ with a given number of cycles: \[F_G(x) = \sum_{g\in G}x^{c(g)},\] where $c(g)$ is the number of cycles of $g$ on $\Omega$.…

In a recent paper Zheng et al. characterized the coefficients of $ f(x) = x + a_1x^{s_1(2m-1)+1} + a_2x^{s_2(2m-1)+1} + a_3x^{s_3(2m-1)+1} $ over $\mathbb{ F}_2^{2m}$ that lead $ f(x) $ to be a permutation of $\mathbb{ F}_2^{2m}$ for $…

Let $D$ be a subset of a finite commutative ring $R$ with identity. Let $f(x)\in R[x]$ be a polynomial of positive degree $d$. For integer $0\leq k \leq |D|$, we study the number $N_f(D,k,b)$ of $k$-subsets $S\subseteq D$ such that…