Related papers: A relation on 132-avoiding permutation patterns
This article examines the nontrivial solutions of the congruence \[ (p-1)\cdots(p-r) \equiv -1 \pmod p. \] We discuss heuristics for the proportion of primes $p$ that have exactly $N$ solutions to this congruence. We supply numerical…
We consider the class of ring $Q$-homeomorphisms with respect to $p$-modulus in $\mathbb{R}^{n}$ with $p > n$, and obtain lower bounds for limsups of the distance distortions under such mappings. These estimates can be treated as…
For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3} \rfloor + e_k, where e_k \in {-1,0} for…
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 prove the Tree Alternative Conjecture for the topological minor relation: letting $[T]$ denote the equivalence class of $T$ under the topological minor relation we show that: $|[T]| = 1$ or $|[T]|\geq \aleph_0$ and $\forall r\in V(T)$,…
A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…
We use the p-adic local Langlands correspondence for GL_2(Q_p) to find the reduction modulo p of certain two-dimensional crystalline Galois representations. In particular, we resolve a conjecture of Breuil, Buzzard, and Emerton in the case…
We consider the class $S_n(1324)$ of permutations of size $n$ that avoid the pattern 1324 and examine the subset $S_n^{a\prec n}(1324)$ of elements for which $a\prec n\prec [a-1]$, $a\ge 1$. This notation means that, when written in one…
We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n symbols). It has been conjectured that the shortest…
We prove that if $A$ is a string algebra then there are not three irreducible morphisms between indecomposable $A$-modules such that its composition belongs to $\Re^{6} \backslash \Re^{7}$, whenever the compositions of two of them are not…
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…
A {\it superpattern} is a string of characters of length $n$ that contains as a subsequence, and in a sense that depends on the context, all the smaller strings of length $k$ in a certain class. We prove structural and probabilistic results…
Let $\Bbb F_q$ be the finite field with $q$ elements and let $p=\text{char}\,\Bbb F_q$. It was conjectured that for integers $e\ge 2$ and $1\le a\le pe-2$, the polynomial $X^{q-2}+X^{q^2-2}+\cdots+X^{q^a-2}$ is a permutation polynomial of…
We show that the spectral set conjecture by Fuglede holds in the setting of cyclic groups of order $p^n q$, where $p$, $q$ are distinct primes and $n\geq1$. This means that a subset $E$ of such a group $G$ tiles the group by translation…
Let $p$ and $q$ be probability vectors with the same entropy $h$. Denote by $B(p)$ the Bernoulli shift indexed by $\Z$ with marginal distribution $p$. Suppose that $\phi$ is a measure preserving homomorphism from $B(p)$ to $B(q)$. We prove…
In this paper we present a topological framework for studying signed permutations and their reversal distance. As a result we can give an alternative approach and interpretation of the Hannenhalli-Pevzner formula for the reversal distance…
We study the $q$-deformation of the Demazure product model from arXiv:2407.21653. Consider the longest element $w_0$ in $S_n$ written as a reduced word in simple transpositions. Independently delete each transposition with probability $1-p$…
For q > 2, Carlitz proved that the group of permutation polynomials (PPs) over F_q is generated by linear polynomials and x^{q-2}. Based on this result, this note points out a simple method for representing all PPs with full cycle over the…
We study the number of 231-avoiding permutations with $j$-descents and maximum drop is less than or equal to $k$ which we denote by $a_{n,231,j}^{(k)}$. We show that $a_{n,231,j}^{(k)}$ also counts the number of Dyck paths of length $2n$…
We prove that for any prime $p>2$, $q=p^\nu$ a power of $p$, $n\ge p$ and $G=S_n$ or $G=A_n$ (symmetric or alternating group) there exists a Galois extension $K/\mathbb F_q(T)$ ramified only over $\infty$ with $\mathrm{Gal}(K/\mathbb…