Related papers: Quasi-Stirling Permutations on Multisets

The diffraction image of a quasicrystal admits a finite group G as a symmetry group, and the quasicrystal can be regarded as a quasiperiodic packing of copies of a G-cluster C, joined by glue atoms. The physical space E containing C can be…

Given a permutation $\pi$, let $\text{Av}_n(\pi)$ be the number of permutations of length $n$ that avoid $\pi$ as a subpermutation. The celebrated resolution of the Stanley-Wilf conjecture by Marcus and Tardos confirmed that the limit…

It was shown in Bj\"orn--Bj\"orn--Korte ("Minima of quasisuperminimizers", Nonlinear Anal. 155 (2017), 264-284) that $u:=\min\{u_1,u_2\}$ is a $\overline{Q}$-quasisuperminimizer if $u_1$ and $u_2$ are $Q$-quasisuperminimizers and…

We present study of finite-size scaling and universality of crossing probabilities for the $q$-state Potts model. Crossing probabilities of the Potts model are similar ones in percolation problem. We numerically investigated scaling of…

We consider well-quasi-order for classes of permutation graphs which omit both a path and a clique. Our principle result is that the class of permutation graphs omitting $P_5$ and a clique of any size is well-quasi-ordered. This is proved…

We prove that permutations with few inversions exhibit a local-global dichotomy in the following sense. Suppose ${\boldsymbol\sigma}$ is a permutation chosen uniformly at random from the set of all permutations of $[n]$ with exactly…

Let $s$ be West's deterministic stack-sorting map. A well-known result (West) is that any length $n$ permutation can be sorted with $n-1$ iterations of $s.$ In 2020, Defant introduced the notion of highly-sorted permutations -- permutations…

Generalizing stack sorting and $c$-sorting for permutations, we define the permutree sorting algorithm. Given two disjoint subsets $U$ and $D$ of $\{2, \dots, n-1\}$, the $(U,D)$-permutree sorting tries to sort the permutation $\pi \in…

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…

A set of permutations $I \subset S_n$ is said to be {\em k-intersecting} if any two permutations in $I$ agree on at least $k$ points. We show that for any $k \in \mathbb{N}$, if $n$ is sufficiently large depending on $k$, then the largest…

We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…

Let S(n) be the symmetric group on n points. A subset S of S(n) is intersecting if for any pair of permutations \pi, \sigma in S there is a point i in {1,...,n} such that \pi(i)=\sigma(i). Deza and Frankl \cite{MR0439648} proved that if S a…

A skew-morphism of a finite group $G$ is a permutation $\s$ on $G$ fixing the identity element, and for which there exists an integer function $\pi$ on $G$ such that $\s(xy)=\s(x)\s^{\pi(x)}(y)$ for all $x,y\in G$. It has been known that…

We prove that the enumerative polynomials of generalized Stirling permutations by the statistics of plateaux, descents and ascents are partial $\gamma$-positive. Specialization of our result to the Jacobi-Stirling permutations confirms a…

A family of permutations $\mathcal{F} \subset S_{n}$ is said to be $t$-intersecting if any two permutations in $\mathcal{F}$ agree on at least $t$ points. It is said to be $(t-1)$-intersection-free if no two permutations in $\mathcal{F}$…

For a permutation $\pi$, let $S_{n}(\pi)$ be the number of permutations on $n$ letters avoiding $\pi$. Marcus and Tardos proved the celebrated Stanley-Wilf conjecture that $L(\pi)= \lim_{n \to \infty} S_n(\pi)^{1/n}$ exists and is finite.…

We show that a cut-and-paste model to mimic a trial-and-error process of adaptation displays two pairs of percolation and depinning transitions, one for persistence and the other for efficiency. The percolation transition signals the onset…

Let $\mathcal{S}_n(\pi)$ (resp. $\mathcal{I}_n(\pi)$ and $\mathcal{AI}_n(\pi)$) denote the set of permutations (resp. involutions and alternating involutions) of length $n$ which avoid the permutation pattern $\pi$. For $k,m\geq 1$,…

Let $K/k$ be a finite Galois extension and $\pi = \fn{Gal}(K/k)$. An algebraic torus $T$ defined over $k$ is called a $\pi$-torus if $T\times_{\fn{Spec}(k)} \fn{Spec}(K)\simeq \bm{G}_{m,K}^n$ for some integer $n$. The set of all algebraic…

Define a permutation to be any sequence of distinct positive integers. Given two permutations p and s on disjoint underlying sets, we denote by p sh s the set of shuffles of p and s (the set of all permutations obtained by interleaving the…