English
Related papers

Related papers: On the M\"obius Function of Permutations With One …

200 papers

We study the growth rate of the summatory function of the M\"obius function in the context of an algebraic curve over a finite field. Our work shows a strong resemblance to its number field counterpart, which was proved by Ng in 2004. We…

Number Theory · Mathematics 2011-11-16 Byungchul Cha

We consider the zeta and M\"obius functions of a partial order on integer compositions first studied by Bergeron, Bousquet-M\'elou, and Dulucq. The M\"obius function of this poset was determined by Sagan and Vatter. We prove rationality of…

Combinatorics · Mathematics 2007-05-23 Anders Björner , Bruce E. Sagan

Apostol's Mobius functions of order k are generalized to depend on a second integer parameter m. Asymptotic formulas are obtained for the partial sums of these generalized functions.

Number Theory · Mathematics 2009-07-31 Antal Bege

In this paper we consider the rank generating function of a separable permutation $\pi$ in the weak Bruhat order on the two intervals $[\text{id}, \pi]$ and $[\pi, w_0]$, where $w_0 = n,(n-1),..., 1$. We show a surprising result that the…

Combinatorics · Mathematics 2010-09-30 Fan Wei

We give a short proof of "Pellet's Formula" for the M\"{o}bius Function on $\mathbb{F}_q[T]$, deriving an intermediate formula (which we call "Proto-Pellet's Formula") along the way. We then construct and prove an analogous "Proto-Pellet's…

Number Theory · Mathematics 2020-01-21 Ardavan Afshar

We consider the space $C_{\lambda}$ of all continuous interval maps preserving the Lebesgue measure $\lambda$. A continuous function $f\colon~[0,1]\to \mathbb R$ is called Besicovitch if it does not have any finite or infinite unilateral…

Dynamical Systems · Mathematics 2026-02-24 Jozef Bobok , Jernej Činč , Piotr Oprocha , Serge Troubetzkoy

A signed permutation \pi = \pi_1\pi_2 \ldots \pi_n in the hyperoctahedral group B_n is a word such that each \pi_i \in {-n, \ldots, -1, 1, \ldots, n} and {|\pi_1|, |\pi_2|, \ldots, |\pi_n|} = {1,2,\ldots,n}. An index i is a peak of \pi if…

Combinatorics · Mathematics 2013-09-02 Francis Castro-Velez , Alexander Diaz-Lopez , Rosa Orellana , Jose Pastrana , Rita Zevallos

The move structure represents a permutation $\pi$ of $[0,n)$ as a covering set of $O(r)$ disjoint intervals (contiguous subsets of $[0,n)$), where $r$ is the minimum number of intervals whose values permute together. Formally, $r = 1 +…

Data Structures and Algorithms · Computer Science 2026-04-27 Nathaniel K. Brown , Ahsan Sanaullah , Shaojie Zhang , Ben Langmead

This article studies the poset of simple permutations with respect to the pattern involvement. We specify results on critically indecomposable posets obtained by Schmerl and Trotter to simple permutations and prove that if $\sigma, \pi$ are…

Discrete Mathematics · Computer Science 2012-01-17 Pierrot Adeline , Rossin Dominique

The minimal representation $\pi$ of the indefinite orthogonal group $O(m+1,2)$ is realized on the Hilbert space of square integrable functions on $\mathbb R^m$ with respect to the measure $|x|^{-1} dx_1... dx_m$. This article gives an…

Representation Theory · Mathematics 2011-06-23 Toshiyuki Kobayashi , Gen Mano

This paper introduces permutation-invariant Niven numbers--a novel class of Niven numbers where all digit permutations (with leading zeros automatically ignored) must retain the Niven property. We demonstrate that there exist infinitely…

Combinatorics · Mathematics 2026-02-17 Hui-Ling Wu , S. Y. Lou

In this paper, we present a fixed point method for high-precision computation of number $\pi$ based on the sine function. Let $P\in \mathbb{N}$. We define the function: \[ S\left(x\right) =x+\sum_{k=1}^{P}\left(\prod_{\ell=1}^{k-1}\frac…

General Mathematics · Mathematics 2026-03-18 Alois Schiessl

Using a sieve procedure akin to the sieve of Eratosthenes we show how for each prime $p$ to build the corresponding M\"obius prime-function, which in the limit of infinitely large primes becomes identical to the original M\"obius function.…

General Mathematics · Mathematics 2011-09-28 R. M. Abrarov , S. M. Abrarov

We define a partial order $\mathcal{P}_n$ on permutations of any given size $n$, which is the image of a natural partial order on inversion sequences. We call this the ``middle order''. We demonstrate that the poset $\mathcal{P}_n$ refines…

Combinatorics · Mathematics 2024-08-30 Mathilde Bouvel , Luca Ferrari , Bridget Eileen Tenner

We establish asymptotic estimates for exact upper bounds of uniform approximations by Fourier sums on the classes of $2\pi$-periodic functions, which are represented by convolutions of functions $\varphi (\varphi\bot 1)$ from unit ball of…

Classical Analysis and ODEs · Mathematics 2020-01-03 A. S. Serdyuk , T. A. Stepanyuk

We present some tools for providing situations where the generalised Rota formula of arXiv:1801.07504 applies. As an example of this, we compute the M\"obius function of the incidence algebra of any directed restriction species, free…

Algebraic Topology · Mathematics 2018-12-27 Louis Carlier

A poset $P = (X,\prec)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_x$ so that $x \prec y$ in $P$ if and only if $I_x$ lies completely to the left of $I_y$. Such orders are called \emph{interval…

Combinatorics · Mathematics 2017-07-26 Simona Boyadzhiyska , Garth Isaak , Ann N Trenk

We give the exact upper and lower bounds of the M{\"o}bius inverse of monotone and normalized set functions (a.k.a. normalized capacities) on a finite set of n elements. We find that the absolute value of the bounds tend to 4 n/2 $\sqrt$…

Discrete Mathematics · Computer Science 2015-03-31 Michel Grabisch , Pedro Miranda

We investigate the avoidability of unary patterns of size of four with morphic permutations. More precisely, we show that, for the positive integers $i,j,k$, the sizes of the alphabets over which a pattern $x \pi ^ {i} (x) \pi^{j}(x)…

Combinatorics · Mathematics 2019-03-25 Kamellia Reshadi

In this paper we study combinatorial aspects of permutations of $\{1,\ldots,n\}$ and related topics. In particular, we prove that there is a unique permutation $\pi$ of $\{1,\ldots,n\}$ such that all the numbers $k+\pi(k)$ ($k=1,\ldots,n$)…

Combinatorics · Mathematics 2021-03-25 Zhi-Wei Sun