English
Related papers

Related papers: On arithmetic and asymptotic properties of up-down…

200 papers

We say that a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$ has a peak at index $i$ if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $\mathcal{P}(\pi)$ denote the set of indices where $\pi$ has a peak. Given a set $S$ of positive…

Combinatorics · Mathematics 2016-05-06 Alexander Diaz-Lopez , Pamela E. Harris , Erik Insko , Mohamed Omar

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

We consider $\Phi(x)=x^{-\frac{1}{4}}\left[1-2\sqrt{x}\Sigma e^{-p^2\pi x}\ln p\right]$ on $x>0$, where the sum is over all primes $p$. If $\Phi$ is bounded on $x>0$, then the Riemann hypothesis is true or there are infinitely many zeros…

Number Theory · Mathematics 2014-05-13 Maurice H. P. M. van Putten

Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…

Combinatorics · Mathematics 2019-07-16 Sergi Elizalde , Justin M. Troyka

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

Combinatorics · Mathematics 2007-05-23 E. Rodney Canfield , Herbert S. Wilf

Let W be an affine PI algebra over a field of characteristic zero graded by a finite group G. We show that there exist $\alpha_{1},\alpha_{2}\in\mathbb{R}, \beta\in\frac{1}{2}\mathbb{Z}$, and $l\in\mathbb{N}$ such that…

Rings and Algebras · Mathematics 2015-04-03 Yuval Shpigelman

We consider the asymptotic evaluation of the integral transform $\int_0^\infty f(x) \, \sin^n(\lambda x)/x^n \,\text{d} x$ of an exponential type function $f(x)$ of type $\tau>0$, for large values of the parameter $\lambda$, where $n$ is a…

Classical Analysis and ODEs · Mathematics 2025-05-07 Nathalie Liezel R. Rojas , Eric A. Galapon

We show that any smooth permutation $\sigma\in S_n$ is characterized by the set ${\mathbf{C}}(\sigma)$ of transpositions and $3$-cycles in the Bruhat interval $(S_n)_{\leq\sigma}$, and that $\sigma$ is the product (in a certain order) of…

Combinatorics · Mathematics 2021-07-21 Shoni Gilboa , Erez Lapid

Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^\omega(a))$…

Combinatorics · Mathematics 2016-04-18 Emilie Charlier , Julien Leroy , Michel Rigo

Let $f$ be a $C^{1+\alpha}$ diffeomorphism of a compact Riemannian manifold and $\mu$ an ergodic hyperbolic measure with positive entropy. We prove that for every continuous potential $\phi$ there exists a sequence of basic sets $\Omega_n$…

Dynamical Systems · Mathematics 2015-10-21 Fernando José Sánchez-Salas

Let $\Sigma=(\Gamma, \sigma)$ is a signed graph(or sigraph in short), where $\Gamma$ is a underlying graph of $\Sigma$ and $\sigma:E\longrightarrow \{+, -\}$ is a function. Consider $\Gamma=Cay(\mathbb{Z}_{p_{1}}\times…

Combinatorics · Mathematics 2020-11-12 Mohammad A. Iranmanesh , Nasrin Moghaddami

We identify a surprising inequality satisfied by elementary symmetric polynomials under the action of the fixed point measure of a random permutation. Concretely, for any collection of $n$ non-negative real numbers $a_1, \dots, a_n \in…

Combinatorics · Mathematics 2025-05-20 Ayush Khaitan , Ishan Mata , Bhargav Narayanan

A permutation array $A$ is a set of permutations on a finite set $\Omega$, say of size $n$. Given distinct permutations $\pi, \sigma\in \Omega$, we let $hd(\pi, \sigma) = |\{ x\in \Omega: \pi(x) \ne \sigma(x) \}|$, called the Hamming…

Combinatorics · Mathematics 2018-09-12 Sergey Bereg , Zevi Miller , Luis Gerardo Mojica , Linda Morales , I. H. Sudborough

Let $A$ and $C$ be two unital simple C*-algebas with tracial rank zero. Suppose that $C$ is amenable and satisfies the Universal Coefficient Theorem. Denote by ${{KK}}_e(C,A)^{++}$ the set of those $\kappa$ for which…

Operator Algebras · Mathematics 2008-03-10 Huaxin Lin , Zhuang Niu

For $\sigma \in S_n$, let $D(\sigma) = \{i : \sigma_{i} > \sigma_{i+1}\}$ denote the descent set of $\sigma$. The length of the permutation is the number of inversions, denoted by $inv(\sigma) = \big | \{(i,j) : i<j, \sigma_i > \sigma_j\}…

Combinatorics · Mathematics 2007-05-23 Mike Zabrocki

Let C represent an irreducible algebraic space curve defined by the real polynomials fi(x1, x2, x3) for i = 1, 2. It is a recognized fact that a birational relationship invariably exists between the points on C and those on an associated…

Algebraic Geometry · Mathematics 2025-03-06 Sonia Pérez-Díaz , Li-Yong Shen , Xin-Yu Wang , R. Magdalena-Benedicto

We call a permutation $\sigma=[\sigma_1,\dots,\sigma_n] \in S_n$ a {\em cylindrical king permutation} if $ |\sigma_i-\sigma_{i+1}|>1$ for each $1\leq i \leq n-1$ and $|\sigma_1-\sigma_n|>1$. We present some results regarding the…

Combinatorics · Mathematics 2020-01-10 Eli Bagno , Estrella Eisenberg , Shulamit Reches , Moriah Sigron

We prove an upper bound for characters of the symmetric groups. Namely, we show that there exists a constant a>0 with a property that for every Young diagram \lambda with n boxes, r(\lambda) rows and c(\lambda) columns |Tr \rho^\lambda(\pi)…

Representation Theory · Mathematics 2011-03-22 Valentin Féray , Piotr Sniady

Let $\Sigma$ be a compact, orientable surface of genus $g$, and let $\Gamma$ be a relation on $\pi_0(\partial \Sigma)$ such that the prescribed arc graph $\mathcal{A}(\Sigma,\Gamma)$ is Gromov-hyperbolic and non-trivial. We show that…

Geometric Topology · Mathematics 2025-08-08 Michael C. Kopreski

We study statistical properties of the random variables $X_{\sigma}(\pi)$, the number of occurrences of the pattern $\sigma$ in the permutation $\pi$. We present two contrasting approaches to this problem: traditional probability theory and…

Combinatorics · Mathematics 2013-12-17 Svante Janson , Brian Nakamura , Doron Zeilberger