Let $\phi:\mathbb{N}\rightarrow\mathbb{N}$ be a bijection. Consider $D_N=\biggr\lvert\sum_{n=0}^N(\phi_n-n)\biggr\lvert.$ Are there any well established upper bounds on this value in the limit? It seems reasonable to me that $D_N=o(N),$ essentially saying that the mean of $(\phi_n-n)$ is 0. Are there even stronger claims? Perhaps $D_N=o(N^\epsilon),$ for any $\epsilon>0?$ The problem seems kind of inaccessible to me, so forgive me if the answer is obvious.
2026-03-26 17:31:45.1774546305
Upper Bound On the Average Of $(\phi_n-n)$ For $\phi\in S_\infty$
28 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in PERMUTATIONS
- A weird automorphism
- List Conjugacy Classes in GAP?
- Permutation does not change if we multiply by left by another group element?
- Validating a solution to a combinatorics problem
- Selection of at least one vowel and one consonant
- How to get the missing brick of the proof $A \circ P_\sigma = P_\sigma \circ A$ using permutations?
- Probability of a candidate being selected for a job.
- $S_3$ action on the splitting field of $\mathbb{Q}[x]/(x^3 - x - 1)$
- Expected "overlap" between permutations of a multiset
- Selecting balls from infinite sample with certain conditions
Related Questions in ASYMPTOTICS
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- How to find the asymptotic behaviour of $(y'')^2=y'+y$ as $x$ tends to $\infty$?
- Correct way to prove Big O statement
- Proving big theta notation?
- Asymptotics for partial sum of product of binomial coefficients
- Little oh notation
- Recurrence Relation for Towers of Hanoi
- proving sigma = BigTheta (BigΘ)
- What's wrong with the boundary condition of this $1$st order ODE?
- Every linearly-ordered real-parametrized family of asymptotic classes is nowhere dense?
Related Questions in INFINITE-GROUPS
- Subgroup of index p in an infinite p-group?
- For general $n \in \Bbb N$ , how to determine all groups (both finite and infinite) having exactly $n$ conjugacy classes?
- Geometrical interpretation of a group
- Is there a good example of a subgroup of an infinitely generated abelian group that is not isomorphic to a quotient of that group?
- An infinite polycyclic group has a free abelian normal subgroup
- Orbits of $X$ under $N\triangleleft G$ are of equal length
- Infinite case: Let $N$ be a normal subgroup of index m in $G$. Prove that $a^{m}\in N$ for all $a\in G$
- Show that the infinite cyclic group is not isomorphic to a direct product of two nontrivial cyclic groups.
- If an infinite group acts freely on two sets then the sets are bijective via an action preserving bijection?
- If an infinite group $G$ acts freely on two sets of same cardinality $> |G|$, then the sets are bijective via an action preserving bijection?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Let $f:\ \Bbb{N}\ \longrightarrow\ \Bbb{N}$ be any strictly increasing function. Define $[n]:=\{0,\ldots,n-1\}$ and $$\phi(n):=\begin{cases}f(n)&\text{ if }\ \phi([n])=[n]\\n-1&\text{ if }\ \phi([n])\neq[n]\end{cases}$$ Then $\phi$ is a bijection and $\phi(n)=f(n)$ infinitely often, and for these $n$ you have $D_n=f(n)-n$. This means that $\lim\sup D_n$ is not bounded above by any function of $n$, and also illustrates that $\lim D_n$ need not exist.