Strong law for the bootstrap

Let X₁, X₂, X₃, … be i.i.d. r.v. with E|X₁| < ∞, E X₁ = μ. Given a realization X = (X₁,X₂,…) and integers n and m, construct Y_n,i, i = 1, 2, …, m as i.i.d. r.v. with conditional distribution $\text{P}{}^1\text{(Y}{}_{\mathrm{n,i}}\text{= X}{}_{\mathrm{j}}\text{) =}\text{1}\text{n}$ for 1 ? j ? n. ($\text{P}{}^1$ denotes conditional distribution given X). Conditions relating the growth rate of m with n and the moments of X₁ are given to ensure the almost sure convergence of $\text{(}\text{1}\text{m}\text{)Σ}{}^{\mathrm{m}}{}_{\mathrm{i=1}}\text{Y}{}_{\mathrm{n,i}}$ toμ. This equation is of some relevance in the theory of Bootstrap as developed by Efron (1979) and Bickel and Freedman (1981).     

Decomposable bilinear numerical radii

Let A be an n-square normal matrix over $\text{C}$, and Q_{m, n} be the set of strictly increasing integer sequences of length m chosen from 1,…, n. For α,β∈Q_{m, n} denote by A[α|β] the submatrix obtained from A by using rows numbered α and columns numbered β. For k∈{0,1,…,m} write z.sfnc;α∩β|=k if there exists a rearrangement of 1,…,m, say i₁,…,i_k, i_k+1,…,i_m, such that α(i_j)=β(i_j), j=1,…,k, and {α(i_k+1),…,α(i_m)};∩{β(i_k+1),…,β(i_m)}=ø. Let

be the group of n-square unitary matrices. Define the nonnegative number

$\text{?}{}_{\mathrm{k}}\text{(A)=}\text{max}\text{U∈}\textcolor{red}{}\text{|}\text{det}\text{(U}{}^1\text{AU) [α|β]|}$

, where |α∩β|=k. Theorem 1 establishes a bound for ?_k(A), 0?k<m?1, in terms of a classical variational inequality due to Fermat. Let A be positive semidefinite Hermitian, n?2m. Theorem 2 leads to an interlacing inequality which, in the case n=4, m=2, resolves in the affirmative the conjecture that

$\text{?}{}_{\mathrm{m}}\text{(A)??}{}_{\mathrm{m?1}}\text{(A)????}{}_0\text{(A)}$

.     

Unitary interpolants,factorization indices and infinite Hankel block matrices

The existence, uniqueness, and construction of unitary n × n matrix valued functions $\text{?(ζ) = ∑}{}_{\mathrm{j\; =\; ?\infty }}{}^{\mathrm{\infty }}\text{?}{}_{\mathrm{j}}\text{ζ}{}^{\mathrm{j}}$ in Wiener-like algebras on the circle with prescribed matrix Fourier coefficients $\text{?}{}_{\mathrm{j}}\text{= γ}{}_{\mathrm{j}}$ for j ? 0 are studied. In particular, if $\text{Σ ¦γ}{}_{\mathrm{j}}\text{¦ < ∞}$, then such an ? exists with $\text{Σ ¦?}{}_{\mathrm{j}}\text{¦ < ∞}$ if and only if ∥Γ₀∥ ? 1, where Γ_v, denotes the infinite block Hankel matrix (γ_{j + k + v}), j, k = 0, 1,…, acting in the sequence space l_n². One of the main results is that the nonnegative factorization indices of every such ? are uniquely determined by the given data in terms of the dimensions of the kernels of $\text{I ? Γ}{}_{\mathrm{v}}{}^1\text{Γ}{}_{\mathrm{v}}$, whereas the negative factorization indices are arbitrary. It is also shown that there is a unique such ? if and only if the data forces all the factorization indices to be nonnegative and simple conditions for that and a formula for ? in terms of certain Schmidt pairs of Γ₀ are given. The results depend upon a fine analysis of the structure of the kernels of $\text{I ? Γ}{}_{\mathrm{v}}{}^1\text{Γ}{}_{\mathrm{v}}$ and of the one step extension problem of Adamjan, Arov, and Krein (Funct. Anal. Appl.2 (1968), 1–18). Isometric interpolants for the nonsquare case are also considered.     

An extremal problem for sets with applications to graph theory

Let X₁, …, X_n be n disjoint sets. For 1 ? i ? n and 1 ? j ? h let A_ij and B_ij be subsets of X_i that satisfy |A_ij| ? r_i and |B_ij| ? s_i for 1 ? i ? n, 1 ? j ? h, $\text{(∪}{}_{\mathrm{i}}\text{A}{}_{\mathrm{ij}}\text{) ∩ (∪}{}_{\mathrm{i}}\text{B}{}_{\mathrm{ij}}\text{) = ?}$ for 1 ? j ? h, $\text{(∪}{}_{\mathrm{i}}\text{A}{}_{\mathrm{ij}}\text{) ∩ (∪}{}_{\mathrm{i}}\text{B}{}_{\mathrm{il}}\text{) ≠ ?}$ for 1 ? j < l ? h. We prove that $\text{h?}\text{Π}\text{i=1}\text{n}\text{r}{}_{\mathrm{i}}\text{+s}{}_{\mathrm{i}}\text{r}{}_{\mathrm{i}}$. This result is best possible and has some interesting consequences. Its proof uses multilinear techniques (exterior algebra).     

Sperner systems consisting of pairs of complementary subsets

It was proved by Erdös, Ko, and Radó (Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser.12 (1961), 313–320.) that if $\text{A}$ = {;A₁,…, A_l}; consists of k-subsets of a set with n > 2k elements such that A_i ∩ A_j ≠ ? for all i, j then l ? (_k?1^n?1). Schönheim proved that if A₁, …, A_l are subsets of a set S with n elements such that A_i ? A_j, A_i ∩ A_j ≠ ø and A_i ∪ A_j ≠ S for all i ≠ j then $\text{l ? (}{}_{\mathrm{<mtext>[</mtext><mtext>n</mtext><mtext>2</mtext><mtext>]\; ?\; 1</mtext>}}{}^{\mathrm{n\; ?\; 1}}\text{)}$. In this note we prove a common strengthening of these results.     

A complete set of invariants for finite groups and other results

For a finite group G and a set I ? {1, 2,…, n} let

${}_{\mathrm{G}}\text{(n,I) = ∑}{}_{\mathrm{g\; \in \; G}}\text{ε}{}_1\text{(g)?ε}{}_2\text{(g)???ε}{}_{\mathrm{n}}\text{(g)}$

,where

$\text{ε}{}_{\mathrm{i}}\text{(g)=g}\text{if}\text{i=∈ I,}$

$\text{ε}{}_{\mathrm{l}}\text{(g)=l}\text{if}\text{i=∈ I.}$

We prove, among other results, that the positive integers

$\text{tr}\text{(e}{}_{\mathrm{G}}\text{(n,I}{}_1\text{)+?+e}{}_{\mathrm{G}}\text{(n,I}{}_{\mathrm{r}}\text{))}{}^{\mathrm{k}}\text{:n,r,k,?1, I}{}_{\mathrm{j}}\text{?{1,…,n}, 1?|i}{}_{\mathrm{j}}\text{|?3}$

for 1 ? j ? r, I_j1 ∩ I_j2 ∩ I_j3 ∩ I_j4 = Ø for any 1 ? j₁ <j₂ <j₃ <j₄ ? r, determine G up to isomorphism. We also show that under certain assumptions finite groups are determined up to isomorphism by the number of their subgroups.     

Multiplicativity of lp norms for matrices. II

For 1 ? p ? ∞, let

$\text{|A|}{}_{\mathrm{p}}\text{=}\text{Σ}\text{i=1}\text{m}\text{Σ}\text{j=1}\text{n}\text{, |α}{}_{\mathrm{ij}}\text{|}{}^{\mathrm{p}}{}^{\mathrm{<mtext>1</mtext><mtext>p</mtext>}}$

, be the l_p norm of an m × n complex A = (α_ij) ?C_{m × n}. The main purpose of this paper is to find, for any p, q ? 1, the best (smallest) possible constants τ(m, k, n, p, q) and σ(m, k, n, p, q) for which inequalities of the form

$\text{|AB|}{}_{\mathrm{p}}\text{? τ(m, k, n, p, q) |A|}{}_{\mathrm{p}}\text{|B|}{}_{\mathrm{q}}\text{, |AB|}{}_{\mathrm{p}}\text{? σ (m, k, n, p, q)|A|}{}_{\mathrm{q}}\text{|B|}{}_{\mathrm{p}}$

hold for all A?C_{m × k}, B?C_{k × n}. This leads to upper bounds for inner products on C^k and for ordinary l_p operator norms on C_{m × n}.     

A partition identity

Let n₁+n₂+?+n_m=n where the n_i's are integers (possibly negative or greater than n). Let p=(k₁,…,k_m), where k₁+k₂+?+k_m=k, be a partition of the nonnegative integer k into m nonnegative integers and let P denote the set of all such partitions. For m?2, we prove the combinatorial identity

$\text{∑}\text{p∈P}\text{∏}\text{i=1}\text{m}\text{n}{}_{\mathrm{i}}\text{+1?k}{}_{\mathrm{i}}\text{k}{}_{\mathrm{i}}\text{=}\text{∑}\text{i?0}\text{j+m?2}\text{m?2}\text{n+1?k?2}{}_{\mathrm{j}}\text{k?2}{}_{\mathrm{j}}$

which implies the surprising result that the left side of the above equation depends on n but not on the n_i's.     

On fair coin-tossing games

Let Ω be a finite set with k elements and for each integer $\text{n ≧ 1}$ let $\text{Ω}{}_{\mathrm{n}}\text{= Ω × Ω × … × Ω}$ (n-tuple) and $\text{Ω}{}_{\mathrm{n}}\text{= {(a}{}_1\text{, a}{}_2\text{,…, a}{}_{\mathrm{n}}\text{) | (a}{}_1\text{, a}{}_2\text{,…, a}{}_{\mathrm{n}}\text{) ∈ Ω}{}_{\mathrm{n}}$ and a_j ≠ a_j+1 for some 1 ≦ j ≦ n ? 1}. Let {Y_m} be a sequence of independent and identically distributed random variables such that P(Y₁ = a) = k^?1 for all a in Ω. In this paper, we obtain some very surprising and interesting results about the first occurrence of elements in $\text{Ω}{}_{\mathrm{n}}$ and in Ω?_n with respect to the stochastic process {Y_m}. The results here provide us with a better and deeper understanding of the fair coin-tossing (k-sided) process.     

The Dirichlet problem for the Kohn Laplacian on the Heisenberg group,I

For (x,y,t)∈$\text{R}$ⁿ × $\text{R}$ⁿ × $\text{R}$, denote $\text{X}{}_{\mathrm{j}}\text{=}\text{?}\text{?x}{}_{\mathrm{j}}\text{+ 2y}{}_{\mathrm{j}}\text{?}\text{?t}\text{, y}{}_{\mathrm{j}}\text{=}\text{?}\text{?y}{}_{\mathrm{j}}\text{? 2x}{}_{\mathrm{j}}\text{?}\text{?t}$ and $\text{L}{}_{\mathrm{\alpha }}\text{=?}\text{1}\text{4}\text{∑}\text{j=1}\text{n}\text{X}{}_{\mathrm{j}}{}^2\text{+ Y}{}_{\mathrm{j}}{}^2\text{+}\text{?}\text{?t}$. When α = n ? 2q, $\text{L}$_a represents the action of the Kohn Laplacian □_b on q-forms on the Heisenberg group. For ?n < α < n, we construct a parametrix for the Dirichlet problem in smooth domains D near non-characteristic points of ?D. A point w of ?D is non-characteristic if one of X₁,…, X_n, Y₁,…, Y_n is transverse to ?D at w. This yields sharp local estimates in the Dirichlet problem in the appropriate non-isotropic Lipschitz classes. The main new tool is a “convolution calculus” of pseudo-differential operators that can be applied to the relevant layer potentials, for which the usual asymptotic composition formula is false. Characteristic points are treated in Part II.     

Arithmetic in generalized Artin-Schreier extensions of k(x)

If k is a perfect field of characteristic p ≠ 0 and k(x) is the rational function field over k, it is possible to construct cyclic extensions K_n over k(x) such that [K : k(x)] = pⁿ using the concept of Witt vectors. This is accomplished in the following way; if [β₁, β₂,…, β_n] is a Witt vector over k(x) = K₀, then the Witt equation $\text{y}{}^{\mathrm{p}}\text{?}\text{y}\text{= β}$ generates a tower of extensions through $\text{K}{}_{\mathrm{i}}\text{= K}{}_{\mathrm{i?1}}\text{(}\text{y}{}_{\mathrm{i}}\text{)}$ where $\text{y}\text{= [}\text{y}{}_1\text{,}\text{y}{}_2\text{,…,}\text{y}{}_{\mathrm{n}}\text{]}$. In this paper, it is shown that there exists an alternate method of generating this tower which lends itself better for further constructions in K_n. This alternate generation has the form K_i = K_i?1(y_i); y_i^p ? y_i = B_i, where, as a divisor in K_i?1, B_i has the form . In this form q is prime to Πp_j^λ_j and each λ_j is positive and prime to p. As an application of this, the alternate generation is used to construct a lower-triangular form of the Hasse-Witt matrix of such a field K_n over an algebraically closed field of constants.     

On permutations,convex hulls,and normal operators

A spectral characterization is obtained for those normal operators which belong to the convex hull of the unitary orbit of a given normal operator on a finite-dimensional space. This is used to prove the following: if A and B are normal operators on an n-dimensional complex Hilbert space H with eigenvalues given by α₁,…,α_n and β₁,…, β_n respectively, and if A ? B is also normal, then $\text{6A ? B6 ?}\text{max}\text{σ ? S}{}_{\mathrm{n}}\text{6}\text{diag}\text{(α}{}_{\mathrm{k}}\text{?β}{}_{\mathrm{\sigma (k)}}\text{)6}$ for any unitarily invariant norm on L(H).     

The minimal generating space of a polynomial

Given a polynomial $\text{P(X}{}_1\text{,…,X}{}_{\mathrm{N}}\text{)∈}\text{R}\text{[}\text{X}\text{]}$, we calculate a subspace G_p of the linear space 〈X〉 generated by the indeterminates which is minimal with respect to the property $\text{P∈}\text{R}\text{[}\text{G}{}_{\mathrm{p}}\text{]}$ (the algebra generated by G_p, and prove its uniqueness. Furthermore, we use this result to characterize the pairs (P,Q) of polynomials P(X₁,…,X_n) and Q(X₁,…,X_n) for which there exists an isomorphism T:〈X〉 →〈X〉 that “separates P from Q,” i.e., such that for some k(1<k<n) we can write P and Q as $\text{P}{}^1\text{(Y}{}_1\text{,…,Y}{}_{\mathrm{k}}\text{)}$ and $\text{Q}{}^1\text{(Y}{}_{\mathrm{<mtext>k+</mtext><mtext>1</mtext>}}\text{,…,Y}{}_{\mathrm{n}}\text{)}$ respectively, where $\text{Y}\text{=T}\text{X}$.     

A determinant of symmetric forms

Let Δ(α + β) = |H_λ2?r+1| where H_r is the complete symmetric function in (α₁ + β₁), (α₂ + β₂), …, (α_n + β_n). It is proved that Δ(α + β) ? Δ(α) + Δ(β). This inequality is generalised for certain symmetric functions defined by Littlewood. Let . Then we prove that Ω(α + β) ? Ω(α) + Ω(β). Here λ₁, λ₂, λ₃, …, λ_n is a partition such that λ_n > λ_n?1 > ··· > λ₂ > λ₁.     

An extremal result for sum-free sequences

Let a₁ < a₂ < … be a sequence of positive integers such that no a_k is a sum of distinct other terms. Erdös conjectured that if a₁ ≥ n, then $\text{Σ1}\text{a}{}_{\mathrm{k}}\text{<}\text{log}\text{2 + ?}{}_{\mathrm{n}}$, where, ?_n → 0 as n → ∞. This result, which is the best possible, is established in this paper.     

Extension de quelques theoremes sur les densites de series d'elements de n a des series de sous-ensembles finis de n

For a sequence A = {A_k} of finite subsets of N we introduce: $\text{δ(A) =}\text{inf}{}_{\mathrm{m?n}}\text{A(m)}\text{2}{}^{\mathrm{n}}$, $\text{d(A) =}\text{lim inf}{}_{\mathrm{n\to \infty }}\text{A(n)}\text{2}{}^{\mathrm{n}}$, where A(m) is the number of subsets A_k ? {1, 2, …, m}.The collection of all subsets of {1, …, n} together with the operation $\text{a ∪ b, (a ∩ b), (a 1 b = a ∪ b ? a ∩ b)}$ constitutes a finite semi-group N^∪ (semi-group N^∩) (group $\text{N}{}^1$). For N^∪, N^∩ we prove analogues of the Erdös-Landau theorem: δ(A+B) ? δ(A)(1+(2λ)^?1(1?δ(A>))), where B is a base of N of the average order λ. We prove for $\text{N}{}^{\mathrm{\cup }}\text{, N}{}^{\mathrm{\cap }}\text{, N}{}^1$ analogues of Schnirelmann's theorem (that δ(A) + δ(B) > 1 implies δ(A + B) = 1) and the inequalities λ ? 2h, where h is the order of the base.We introduce the concept of divisibility of subsets: a|b if b is a continuation of a. We prove an analog of the Davenport-Erdös theorem: if d(A) > 0, then there exists an infinite sequence {A_kr}, where A_kr | A_kr+1 for r = 1, 2, …. In Section 6 we consider for $\text{N∪, N∩, N1}$ analogues of Rohrbach inequality: $\text{2n}\text{? g(n) ? 2}\text{n}$, where g(n) = min k over the subsets {a₁ < … < a_k} ? {0, 1, 2, …, n}, such that every m? {0, 1, 2, …, n} can be expressed as m = a_i + a_j.Pour une série A = {A_k} de sous-ensembles finis de N on introduit les densités: $\text{δ(A) =}\text{inf}{}_{\mathrm{m?n}}\text{A(m)}\text{2}{}^{\mathrm{m}}$, $\text{d(A) =}\text{lim inf}{}_{\mathrm{n\to \infty }}\text{A(n)}\text{2}{}^{\mathrm{n}}$ où A(m) est le nombre d'ensembles A_k ? {1, 2, …, m}. L'ensemble de toutes les parties de {1, 2, …, n} devient, pour les opérations $\text{a ∪ b, a ∩ b, a 1 b = a ∪ b ? a ∩ b}$, un semi-groupe fini N^∪, N^∩ ou un groupe N¹ respectivement. Pour N^∪, N^∩ on démontre l'analogue du théorème de Erdös-Landau: δ(A + B) ? δ(A)(1 + (2λ)^?1(1?δ(A))), où B est une base de N d'ordre moyen λ. On démontre pour $\text{N}{}^{\mathrm{\cup }}\text{, N}{}^{\mathrm{\cap }}\text{, N}{}^1$ l'analogue du théorème de Schnirelmann (si δ(A) + δ(B) > 1, alors δ(A + B) = 1) et les inégalités λ ? 2h, où h est l'ordre de base. On introduit le rapport de divisibilité des enembles: a|b, si b est une continuation de a. On démontre l'analogue du théorème de Davenport-Erdös: si d(A) > 0, alors il existe une sous-série infinie {A_kr}, où A_kr|A_kr+1, pour r = 1, 2, … . Dans le Paragraphe 6 on envisage pour N^∪, $\text{N}{}^{\mathrm{\cap }}\text{, N}{}^1$ les analogues de l'inégalité de Rohrbach: $\text{2n}\text{? g(n) ? 2}\text{n}$, où g(n) = min k pour les ensembles {a₁ < … < a_k} ? {0, 1, 2, …, n} tels que pour tout m? {0, 1, 2, …, n} on a m = a_i + a_j.     

Numerical approximation of product integrals

A technique for the numerical approximation of matrix-valued Riemann product integrals is developed. For a ? x < y ? b, I_m(x, y) denotes

$\text{∫}\text{χ}\text{y}\text{∫}\text{χ}\text{v}{}_2\text{?}\text{∫}\text{χ}\text{v}{}_2\text{∏}\text{i=1}\text{m}\text{F(ν}{}_{\mathrm{i}}\text{)dν}{}_1\text{dν}{}_2\text{?dν}{}_{\mathrm{m}}$

, and A_m(x, y) denotes an approximation of I_m(x, y) of the form

$\text{(y?x)}{}^{\mathrm{m}}\text{∑}\text{k=1}\text{n}\text{a}{}_{\mathrm{k}}\text{∏}\text{i=1}\text{m}\text{F(χ}{}_{\mathrm{ik}}\text{)}$

, where a_k and y_ik are fixed numbers for i = 1, 2,…, m and k = 1, 2,…, N and x_ik = x + (y ? x)y_ik. The following result is established. If p is a positive integer, F is a function from the real numbers to the set of w × w matrices with real elements and F⁽¹⁾ exists and is continuous on [a, b], then there exists a bounded interval function H such that, if n, r, and s are positive integers, $\text{(b ? a)}\text{n}\text{= h < 1, x}{}_{\mathrm{i}}\text{= a + hi}\text{for}\text{i = 0, 1,…, n}\text{and}\text{0 < r ? s ? n}$, then

$\text{∏}\text{χ}{}_{\mathrm{r?}}\text{χ}{}_{\mathrm{s}}\text{(I+F dχ)?}\text{∏}\text{i=r}\text{s}\text{I+}\text{∑}\text{j=1}\text{p}\text{I}{}_{\mathrm{j}}\text{(χ}{}_{\mathrm{i?1}}\text{,χ}{}_{\mathrm{i}}\text{)}$

$\text{=h}{}^{\mathrm{p}}\text{H(χ}{}_{\mathrm{r?1}}\text{,χ}{}_{\mathrm{s}}\text{)+O(h}{}^{\mathrm{p+1}}\text{)}$

Further, if F^(j) exists and is continuous on [a, b] for j = 1, 2,…, p + 1 and A is exact for polynomials of degree less than p + 1 ? j for j = 1, 2,…, p, then the preceding result remains valid when A_j is substituted for I_j.     

On a conjecture by D. Ž. D̄okovic

It is shown that if $\text{A?Ω}{}_{\mathrm{n}}\text{?{J}{}_{\mathrm{n}}\text{}}$ satisfies

$\text{nkσ}{}_{\mathrm{k}}\text{(A)?(n?k+1)}{}^2\text{σ}{}_{\mathrm{k?1}}\text{(A)}$

$\text{(k=1,2,…,n)}$

, where σ_k(A) denotes the sum of all kth order subpermanent of A, then Per[λJ_n+(1?λ)A] is strictly decreasing in the interval 0<λ<1.     

On the fair coin tossing process

Let Ω = {1, 0} and for each integer n ≥ 1 let $\text{Ω}{}_{\mathrm{n}}\text{= Ω × Ω × … × Ω}$ (n-tuple) and $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}\text{= {(a}{}_1\text{, a}{}_2\text{, …, a}{}_{\mathrm{n}}\text{)|(a}{}_1\text{, a}{}_2\text{, … , a}{}_{\mathrm{n}}\text{) ? Ω}{}_{\mathrm{n}}\text{and}\text{Σ}{}_{\mathrm{i=1}}{}^{\mathrm{n}}\text{a}{}_{\mathrm{i}}\text{= k}}$ for all k = 0,1,…,n. Let {Y_m}_m≥1 be a sequence of i.i.d. random variables such that $\text{P(Y}{}_1\text{= 0) = P(Y}{}_1\text{= 1) =}\text{1}\text{2}$. For each A in $\text{Ω}{}_{\mathrm{n}}$, let T_A be the first occurrence time of A with respect to the stochastic process {Y_m}_m≥1. R. Chen and A.Zame (1979, J. Multivariate Anal. 9, 150–157) prove that if n ≥ 3, then for each element A in $\text{Ω}{}_{\mathrm{n}}$, there is an element B in $\text{Ω}{}_{\mathrm{n}}$ such that the probability that T_B is less than T_A is greater than $\text{1}\text{2}$. This result is sharpened as follows: (I) for n ≥ 4 and 1 ≤ k ≤ n ? 1, each element A in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$, there is an element B also in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$ such that the probability that T_B is less than T_A is greater than $\text{1}\text{2}$; (II) for n ≥ 4 and 1 ≤ k ≤ n ? 1, each element A = (a₁, a₂,…,a_n) in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$, there is an element C also in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$ such that the probability that T_A is less than T_C is greater than $\text{1}\text{2}$ if n ≠ 2m or n = 2m but a_i = a_{i + 1} for some 1 ≤ i ≤ n?1. These new results provide us with a better and deeper understanding of the fair coin tossing process.