On page 184, in section 10.3 of Alon and Spencer (The Probabilistic Method, 4th Edition), line -8, it is written: "Then
$$n = \sqrt{2}^{k(1+o(1))}, ..."$$
At this point in the text, what is this implication based on? Is "$k$" meant to be "$k_0$" in that expression (if so, could you explain why this asymptotic statement holds for $k_0$)? Otherwise, what is $k$?
I am confused, since $k$ was not related to $n$ before this "then" statement.
2026-03-27 04:34:15.1774586055
Relation between $k$ and $n$ in Alon and Spencer, 4th Edition, Section 10.3
95 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 COLORING
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Orbit counting lemma hexagon
- difference between colouring number and chromatic number
- Is it a tetrahedron, 5-cell, or something else?
- Distance of closest neighbor points in a vectorspace ${\mathbb R}^n$ (infinitesimal or zero)?
- How to uniquely label a connected graph?
- Graph coloring: $G$ is a graph where the number of vertices with degree of at least $k$, is at most $k$. Prove $χ(G) \le k$
- Complete graphs in the plane with colored edges where an edge don't cross edges with same color
- 4-chromatic unit distance graph with no 4-cycles.
Related Questions in RANDOM-GRAPHS
- Bound degrees of sparse random graphs
- Connectivity of random graphs - proof $\frac{logn}{n}$ is threshold
- In weighed random graph where the edge weight is restricted to $[0,1]$, what are the usual assumptions of edge weight distribution?
- Upper Bound on Vertices in SCC Graph of Directed Random Graph
- The degree of a vertex in $G(n,m)$ is approx. Poisson
- What is the expected length of the diameter of a special random graph?
- Clique numbers and Theorem 4.5.1 in "The Probabilistic Method" by Alon and Spencer
- Expected global clustering coefficient for Erdős–Rényi graph
- Probability of having a path of a given length in a random graph?
- Correlation for random graph (Erdos-Renyi)
Related Questions in PROBABILISTIC-METHOD
- Proof by probabilistic method for coins on chessboard puzzle
- Proving lower bound of row/column occurencies of numbers in 2D n-element grid
- Translating an Arithmetic Progression in $\mathbf Z/p\mathbf Z^*$, how much Overlap is Possible?
- Clique numbers and Theorem 4.5.1 in "The Probabilistic Method" by Alon and Spencer
- $\frac{N}{n}$; probability
- Why a randomly chosen element of a class satisfying property `p`, implies existence of an element of said class that satisfies `p`?
- Expected number of hamiltonian paths in a tournament
- Finding threshold for Erdos-Renyi random graph to be connected using branching process
- Theorem of Hardy & Ramanujan - second moment Method
- Deviating from the mean +-1 variables
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?
Yes, it is meant to be $k_0$, or alternatively we can switch the two clauses and say
If the statement $n = \sqrt{2}^{k(1+o(1))}$ holds for $k = k_0$, it automatically holds when $k \sim k_0$ (when $k = k_0(1+o(1))$), so I'll show that when $k = k_0$, $n = \sqrt{2}^{k(1+o(1))}$.
We have $f(k-1) > 1$ so $\binom{n}{k-1} 2^{-\binom{k-1}{2}} > 1$, or $\binom{n}{k-1} > 2^{\binom{k-1}{2}}$. Therefore $$ n^{k-1} \ge \binom{n}{k-1} > 2^{(k-1)(k-2)/2} \implies n > 2^{(k-2)/2} = \sqrt2^{k-2}. $$ We also have $f(k) < 1$ so $\binom nk 2^{-\binom k2} < 1$, or $\binom nk < 2^{\binom k2}$. Therefore $$ \left(\frac nk\right)^k \le \binom nk < 2^{k(k-1)/2} \implies \frac nk < 2^{(k-1)/2} = \sqrt2^{k-1}. $$ So we have sandwiched $n$: $\sqrt2^{k-2} < n < k \sqrt2^{k-1}$. In other words, $n$ is off from $\sqrt 2^k$ by a factor of between $2$ and $k \sqrt 2$, which is well within our error margin of $\sqrt 2^{o(k)}$.