Related papers: The M\"obius function of permutations with an inde…

Simple upper and lower bounds are established for the integral $\int_0^x\mathrm{e}^{-\beta t}t^\nu \mathbf{L}_\nu(t)\,\mathrm{d}t$, where $x>0$, $\nu>-1$, $0<\beta<1$ and $\mathbf{L}_\nu(x)$ is the modified Struve function of the first…

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…

The Mertens function, $M(x) := \sum_{n \leq x} \mu(n)$, is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function $g(n) := (\omega+1)^{-1}(n)$ is defined in terms of the shifted strongly…

We investigate Sarnak's conjecture on the M\"obius function in the special case when the test function is the indicator of the set of integers for which a real additive function assumes a given value.

We introduce a formal definition of a pattern poset which encompasses several previously studied posets in the literature. Using this definition we present some general results on the M\"obius function and topology of such pattern posets.…

Let $G$ be the simple group ${\rm PSU}(2,2^{2^n})$, $n>0$. For any subgroup $H$ of $G$, we compute the M\"obius function $\mu_L(H,G)$ of $H$ in the subgroup lattice $L$ of $G$, and the M\"obius function $\mu_{\bar L}([H],[G])$ of $[H]$ in…

We give an estimate for sums appearing in the Nyman-Beurling criterion for the Riemann Hypothesis containing the M\"obius function. The estimate is remarkably sharp in comparison to estimates of other sums containing the M\"obius function.…

This paper introduces and develops M\"obius homology, a homology theory for representations of finite posets into abelian categories. Although the connection between poset topology and M\"obius functions is classical, we go further by…

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.

Using the stratifications of Deligne-Mumford moduli spaces $\overline{\mathcal M}_{g,n}$ indexed by stable graphs, we introduce a partially ordered set of stable graphs by defining a partial ordering on the set of connected stable graphs of…

Using geometric methods, we improve on the function field version of the Burgess bound, and show that, when restricted to certain special subspaces, the M\"{o}bius function over $\mathbb F_q[T]$ can be mimicked by Dirichlet characters.…

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$…

A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary…

Let $\mu(n)$ be the M\"{o}bius function and $e(\alpha)=e^{2\pi i\alpha}$. In this paper, we study upper bounds of the classical sum $$S(x,\alpha):=\sum_{1\leq n\leq x}\mu(n)e(\alpha n).$$ We can improve some classical results of Baker and…

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

The conservation of the intrinsic transverse momentum during parton fragmentation imposes non-trivial constraints on T-odd fragmentation functions. These significantly enhance the differences between the favoured and unfavoured…

We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…

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.…

This paper shows how to construct a discrete Morse function with a relatively small number of critical cells for the order complex of any finite poset with $\hat{0} $ and $\hat{1}$ from any lexicographic order on its maximal chains.…

The classical rearrangement inequality provides bounds for the sum of products of two sequences under permutations of terms and show that similarly ordered sequences provide the largest value whereas opposite ordered sequences provide the…