English
Related papers

Related papers: S\'os Permutations

200 papers

For a positive integer $n$, let $$ F_n^*(X, Y) = \prod\limits_{k = 1}^n\left(X\sin\left(\frac{k\pi}{n}\right) -Y\cos\left(\frac{k\pi}{n}\right)\right). $$ In 2000 Bean and Laugesen proved that for every $n \geq 3$ the area bounded by the…

Number Theory · Mathematics 2021-01-22 Anton Mosunov

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

Number Theory · Mathematics 2017-01-11 Zhi-Wei Sun

Permutons are probability measures on the unit square with uniform marginals that provide a natural way to describe limits of permutations. We are interested in the permuton limits for permutations sampled uniformly from certain…

Probability · Mathematics 2026-02-25 Kaitlyn Hohmeier , Erik Slivken

Any permutation statistic $f:\sym\to\CC$ may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: $f= \Sigma_\tau\lambda_f(\tau)\tau$. To provide explicit expansions for certain…

Combinatorics · Mathematics 2011-03-08 Petter Brändén , Anders Claesson

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

Number Theory · Mathematics 2021-07-12 Asif Zaman

In this note we present a simplified and slightly generalized version of a lemma the authors published in 1987. The lemma as stated here asserts that if the order of a permutation of $n$ elements is greater than $n^{\alpha}$ then some…

Combinatorics · Mathematics 2014-01-03 László Babai , Ákos Seress

We define a suffixient set for a text $T [1..n]$ to be a set $S$ of positions between 1 and $n$ such that, for any edge descending from a node $u$ to a node $v$ in the suffix tree of $T$, there is an element $s \in S$ such that $u$'s path…

Data Structures and Algorithms · Computer Science 2024-06-06 Lore Depuydt , Travis Gagie , Ben Langmead , Giovanni Manzini , Nicola Prezza

Permutation $\sigma$ appears in permutation $\pi$ if there exists a subsequence of $\pi$ that is order-isomorphic to $\sigma$. The natural question is to check if $\sigma$ appears in $\pi$, and if so count the number of occurrences. We know…

Data Structures and Algorithms · Computer Science 2020-10-02 Bartłomiej Dudek , Paweł Gawrychowski

The three gap theorem (or Steinhaus conjecture) asserts that there are at most three distinct gap lengths in the fractional parts of the sequence $\alpha,2\alpha,\ldots,N\alpha$, for any integer $N$ and real number $\alpha$. This statement…

Number Theory · Mathematics 2017-06-23 Jens Marklof , Andreas Strömbergsson

We build the first examples of diffeomorphisms that are distorted in a group of $C^r$ diffeomorphisms yet undistorted in the corresponding group of $C^s$ diffeomorphisms, where $r < s$. This explicit construction is performed for the closed…

Group Theory · Mathematics 2020-07-28 Andrés Navas

We study the behavior of West's stack-sorting map $s$ on permutations whose last entry is also their least. Let $S_{n}':=\{\pi0\mid \pi\in S_n\}$ where $\pi0$ denotes the concatenation of $\pi$ and $0$. For each permutation $\pi\in S_n'$,…

Combinatorics · Mathematics 2026-04-17 Jerry Zhang

A mapping of $k$-bit strings into $n$-bit strings is called an $(\alpha,\beta)$-map if $k$-bit strings which are more than $\alpha k$ apart are mapped to $n$-bit strings that are more than $\beta n$ apart. This is a relaxation of the…

Combinatorics · Mathematics 2016-05-03 Yury Polyanskiy

Two permutations $(x_1,\dots,x_w)$ and $(y_1,\dots,y_w)$ are weakly similar if $x_i<x_{i+1}$ if and only if $y_i<y_{i+1}$ for all $1\leqslant i \leqslant w$. Let $\pi$ be a permutation of the set $[n]=\{1,2,\dots, n\}$ and let $wt(\pi)$…

Combinatorics · Mathematics 2020-12-22 Andrzej Dudek , Jarosław Grytczuk , Andrzej Ruciński

In this note we consider the question how the set of inversions of a permutation $\pi \in S_n$ can be partitioned into two subset, such that those are itself inversion sets of permutations. This is archived by exploiting a connection to a…

Combinatorics · Mathematics 2013-02-27 Lukas Katthän

In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…

Probability · Mathematics 2018-01-30 Enes Ozel

The circular peak set of a permutation $\sigma$ is the set $\{\sigma(i)\mid \sigma(i-1)<\sigma(i)>\sigma(i+1)\}$. In this paper, we focus on the enumeration problems for permutations by circular peak sets. Let $cp_n(S)$ denote the number of…

Combinatorics · Mathematics 2008-06-05 Pierre Bouchard , Hungyung Chang , Jun Ma , Jean Yeh

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

Number Theory · Mathematics 2025-08-29 Omkar Baraskar , Ingrid Vukusic

Let $S$ be the sphere of dimension $n-1, n\geq 4$. Let $(\pi_{\lambda})_{\lambda\in \mathbb C}$ be the scalar principle series of representations of the conformal group $SO_0(1,n)$, realized on $\mathcal C^\infty(S)$. For $\boldsymbol…

Representation Theory · Mathematics 2017-10-24 Jean-Louis Clerc

Let $\varepsilon>0$. We construct an explicit, full-measure set of $\alpha \in[0,1]$ such that if $\gamma \in \mathbb{R}$ then, for almost all $\beta \in[0,1]$, if $\delta \in \mathbb{R}$ then there are infinitely many integers $n\geq 1$…

Number Theory · Mathematics 2023-07-28 Sam Chow , Niclas Technau

We solve an open problem concerning the well-known $(\alpha,\beta,\gamma)$-derivations, proving that the spaces of $(\alpha,1,0)$-derivations of any Lie algebra are isomorphic ($\alpha\neq 0,1$). Also, we prove sharp bounds for the…

Rings and Algebras · Mathematics 2024-02-27 Edison Alberto Fernández-Culma