English
Related papers

Related papers: The Moebius function of separable and decomposable…

200 papers

Define a permutation $\sigma$ to be coprime if $\gcd(m,\sigma(m)) = 1$ for $m\in[n]$. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on $[n]$ is $n!\cdot (c+o(1))^n$ where \[c =…

Number Theory · Mathematics 2022-03-30 Ashwin Sah , Mehtaab Sawhney

We tensorize the Faber spline system from [14] to prove sequence space isomorphisms for multivariate function spaces with higher mixed regularity. The respective basis coefficients are local linear combinations of discrete function values…

Functional Analysis · Mathematics 2020-04-08 Nadiia Derevianko , Tino Ullrich

We introduce vincular pattern posets, then we consider in particular the quasi-consecutive pattern poset, which is defined by declaring $\sigma \leq \tau$ whenever the permutation $\tau$ contains an occurrence of the permutation $\sigma$ in…

Combinatorics · Mathematics 2015-11-06 Antonio Bernini , Luca Ferrari

In this paper a new integral for the remainder of $\pi(x)$ is obtained. It is proved that there is an infinite set of the formulae containing miscellaneous parts of this integral.

Classical Analysis and ODEs · Mathematics 2011-05-26 Jan Moser

It is well known that a continuously differentiable function is monotone in an interval $[a,b]$ if and only if its first derivative does not change its sign there. We prove that this is equivalent to requiring that the Caputo derivatives of…

Classical Analysis and ODEs · Mathematics 2016-05-09 Kai Diethelm

We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly…

Combinatorics · Mathematics 2017-03-13 Mark Karpilovskij

We determine the behavior of multiplicative functions vanishing at a positive proportion of prime numbers in almost all short intervals. Furthermore we quantify "almost all" with uniform power-saving upper bounds, that is, we save a power…

Number Theory · Mathematics 2020-07-09 Kaisa Matomäki , Maksym Radziwiłł

Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…

Number Theory · Mathematics 2022-04-19 Yujiao Jiang , Guangshi Lü

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

Number Theory · Mathematics 2016-01-27 Nikos Frantzikinakis , Bernard Host

In this paper we give a new semiprimality test and we construct a new formula for $\pi ^{(2)}(N)$, the function that counts the number of semiprimes not exceeding a given number $N$. We also present new formulas to identify the $n^{th}$…

Number Theory · Mathematics 2016-08-22 Issam Kaddoura , Samih Abdul-Nabi , Khadija Al-Akhrass

For a word $\pi$ and integer $i$, we define $L^i(\pi)$ to be the length of the longest subsequence of the form $i(i+1)\cdots j$, and we let $L(\pi):=\max_i L^i(\pi)$. In this paper we estimate the expected values of $L^1(\pi)$ and $L(\pi)$…

Combinatorics · Mathematics 2021-10-22 Alexander Clifton , Bishal Deb , Yifeng Huang , Sam Spiro , Semin Yoo

We call an objective function or algorithm symmetric with respect to an input if after swapping two parts of the input in any algorithm, the solution of the algorithm and the output remain the same. More formally, for a permutation $\pi$ of…

Data Structures and Algorithms · Computer Science 2021-01-14 Sepideh Aghamolaei

For a permutation $\pi: [K]\rightarrow [K]$, a sequence $f: \{1,2,\cdots, n\}\rightarrow \mathbb R$ contains a $\pi$-pattern of size $K$, if there is a sequence of indices $(i_1, i_2, \cdots, i_K)$ ($i_1<i_2<\cdots<i_K$), satisfying that…

Data Structures and Algorithms · Computer Science 2024-01-05 Xiaojin Zhang

Recently Albert and Bousquet-M\'elou \cite{AB15} obtained the solution to the long-standing problem of the number of permutations sortable by two stacks in parallel (tsip). Their solution was expressed in terms of functional equations. We…

Combinatorics · Mathematics 2020-02-18 Andrew Elvey Price , Anthony J. Guttmann

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

In this note we consider functions with Moebius-periodic rational coefficients. These functions under some conditions take algebraic values and can be recovered by theta functions and the Dedekind eta function. Special cases are the…

General Mathematics · Mathematics 2014-03-28 Nikos Bagis

A multiplicative function $f$ is said to be resembling the M\"{o}bius function if $f$ is supported on the square-free integers, and $f(p)=\pm 1$ for each prime $p$. We prove $O$- and $\Omega$-results for the summatory function $\sum_{n\leq…

Number Theory · Mathematics 2022-06-10 Qingyang Liu

Motivated by partition regularity problems of homogeneous quadratic equations, we prove multiple recurrence and convergence results for multiplicative measure preserving actions with iterates given by rational sequences involving…

Dynamical Systems · Mathematics 2025-07-17 Nikos Frantzikinakis

Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming $\omega$-string transducers as well as deterministic two-way transducers with look-ahead. In their one-way restriction, the…

Formal Languages and Automata Theory · Computer Science 2024-09-19 V. Dave , E. Filiot , S. Krishna , N. Lhote

In this paper we introduce the prime index function \begin{align}\iota(n)=(-1)^{\pi(n)},\nonumber \end{align} where $\pi(n)$ is the prime counting function. We study some elementary properties and theories associated with the partial sums…

General Mathematics · Mathematics 2021-08-24 Theophilus Agama