Related papers: Revisiting pattern avoidance and quasisymmetric fu…
For $\eta\in S_3$, let $S_n^{\text{av}(\eta)}$ denote the set of permutations in $S_n$ that avoid the pattern $\eta$, and let $E_n^{\text{av}(\eta)}$ denote the expectation with respect to the uniform probability measure on…
Fix an integer partition lambda that has no more than n parts. Let beta be a weakly increasing n-tuple with entries from {1,..,n}. The flagged Schur function indexed by lambda and beta is a polynomial generating function in x_1, .., x_n for…
FPSAC 2013 Extended Abstract. We introduce a new basis of the non-commutative symmetric functions whose elements have Schur functions as their commutative images. Dually, we build a basis of the quasi-symmetric functions which expand…
We study the number $P(n)$ of partitions of an integer $n$ into sums of distinct squares and derive an integral representation of the function $P(n)$. Using semi-classical and quantum statistical methods, we determine its asymptotic average…
The pattern avoidance problem seeks to construct a set with large fractal dimension that avoids a prescribed pattern, such as three term arithmetic progressions, or more general patterns, such as finding a set whose Cartesian product avoids…
We consider asymptotics of set partition pattern avoidance in the sense of Klazar. One of the results of this paper extends work of Alweiss, and finds a classification for set partitions $\pi$ such that the number of set partitions of $[n]$…
We investigate pairs of permutations $F,G$ of $\mathbb{F}_{p^n}$ such that $F(x+a)-G(x)$ is a permutation for every $a\in\mathbb{F}_{p^n}$. We show that necessarily $G(x) = \wp(F(x))$ for some complete mapping $-\wp$ of $\mathbb{F}_{p^n}$,…
We consider the convexity properties of distortion functionals, particularly the linear distortion, defined for homeomorphisms of domains in Euclidean $n$-spaces, $n\geq 3$. The inner and outer distortion functionals are lower…
A function is called quasiperiodic if its fundamental frequencies are linearly independent over the rationals. With appropriate parameters, the sliding window point clouds of such functions can be shown to be dense in tori with dimension…
In this paper we give a new semiprimality test and we construct a new formula for $\pi ^{(2)}(N)$, the function that counts the number of semiprimes not exceeding a given number $N$. We also present new formulas to identify the $n^{th}$…
Let $\Gamma_{g}$ be the fundamental group of a closed connected orientable surface of genus $g\geq2$. We develop a new method for integrating over the representation space $\mathbb{X}_{g,n}=\mathrm{Hom}(\Gamma_{g},S_{n})$ where $S_{n}$ is…
We express some general type of infinite series such as $$ \sum^\infty_{n=1}\frac{F(H_n^{(m)}(z),H_n^{(2m)}(z),\ldots,H_n^{(\ell m)}(z))} {(n+z)^{s_1}(n+1+z)^{s_2}\cdots (n+k-1+z)^{s_k}}, $$ where $F(x_1,\ldots,x_\ell)\in\mathbb…
Pattern-avoiding permutations are a central object of study in both combinatorics and theoretical computer science. In this paper we design a data structure that can store any size-$n$ permutation $\tau$ that avoids an arbitrary (and…
The classical algebra $\Lambda$ of symmetric functions has a remarkable deformation $\Lambda^*$, which we call the algebra of shifted symmetric functions. In the latter algebra, there is a distinguished basis formed by shifted Schur…
The aim of this work is to study the quotient ring R_n of the ring Q[x_1,...,x_n] over the ideal J_n generated by non-constant homogeneous quasi-symmetric functions. We prove here that the dimension of R_n is given by C_n, the n-th Catalan…
In this paper, we introduce the definitions of simsun succession, simsun cycle succession and simsun pattern. In particular, the ordinary simsun permutations are permutations avoiding simsun pattern 321. We study the descent and peak…
The partly symmetric real Ginibre ensemble consists of matrices formed as linear combinations of real symmetric and real anti-symmetric Gaussian random matrices. Such matrices typically have both real and complex eigenvalues. For a fixed…
Quasi-Yamanouchi tableaux are a subset of semistandard Young tableaux and refine standard Young tableaux. They are closely tied to the descent set of standard Young tableaux and were introduced by Assaf and Searles to tighten Gessel's…
In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…
We study permutations $p$ such that both $p$ and $p^2$ avoid a given pattern $q$. We obtain a generating function for the case of $q=312$ (equivalently, $q=231$), we prove that if $q$ is monotone increasing, then above a certain length,…