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

The behaviour of (k,…,kn,n−ik)ci/i! is asymptotically normal

Let N(n,i) = (k,…,kⁿ,n?ik)c^i/i, i = O.…,[n/k]. We prove that the random variable X_n such that $\text{P(X}{}_{\mathrm{<mtext>n</mtext>}}\text{= i) =}\text{N(n, i)}\text{Σ}{}_{\mathrm{<mtext>j</mtext>}}\text{N(n, j)}$ has asymptotically (n → ∞) a normal distribution and we give some combinatorial applications of this result.We also improve a result of Godsil [3] dealing with matchings in graph.     

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}$.     

Some limit results for longest common subsequences

The length l_n of a longest common subsequence before time n sequences (B₁₁, B₁₂, …) (B₂₁, B₂₂, …) is the cardinality of the largest increasing set of pairs of integers {(j_1α, j_2α)}

$\text{l?}\text{j}{}_{11}\text{<}\text{j}{}_{12}\text{<·<}\text{j}{}_{11}{}_{\mathrm{n}}\text{?}\text{n}\text{l?}\text{j}{}_{21}\text{<}\text{j}{}_{22}\text{<·<}\text{j}{}_{21}{}_{\mathrm{n}}\text{?}\text{n}$

such that ?1?α?l_n, (B_1j1α=B_2j2α). If B₁ and B₂ are independent random sequences with co-ordinates i.i.d. uniform on {1, 2, …, k}, it follows from Kingman's subadditive ergodic theorem that the ratio l_n/n converges to a constant c_k a.s. A method of deriving lower bounds for the constants c_k is given, the bounds obtained improving known lower bounds, for k>2. The rate of decrease of c_k with k is shown to be no faster than 1/√k, contrasting with P{B_1i?B_2i}=1/k. Finally, an alternative method of deriving lower bounds is given and used to improve the lower bound for c₂.     

Commuting self-adjoint partial differential operators and a group theoretic problem

In Rⁿ let Ω denote a Nikodym region (= a connected open set on which every distribution of finite Dirichlet integral is itself in $\text{L}{}^2\text{(Ω))}$. The existence of n commuting self-adjoint operators $\text{H}{}_1\text{,…, H}{}_{\mathrm{n}}\text{in}\text{L}{}^2\text{(Ω)}$ such that each H_j is a restriction of $\text{?i β}\text{βx}{}_{\mathrm{j}}$ (acting in the distribution sense) is shown to be equivalent to the existence of a set Λ ?Rⁿ such that the restrictions to Ω of the functions exp i ∑ λ_jx_j form a total orthogonal family in $\text{L}{}^2\text{(Ω)}$. If it is required, in addition, that the unitary groups generated by H₁,…, H_n act multiplicatively on $\text{L}{}^2\text{(Ω)}$, then this is shown to correspond to the requirement that Λ can be chosen as a subgroup of the additive group Rⁿ. The measurable sets Ω ?Rⁿ (of finite Lebesgue measure) for which there exists a subgroup Λ ?Rⁿ as stated are precisely those measurable sets which (after a correction by a null set) form a system of representatives for the quotient of Rⁿ by some subgroup Γ (essentially the dual of Λ).     

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.     

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

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.     

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.     

Solution of a system of functional-differential equations arising from an optimization problem

In connection with an optimization problem, all functions ?: Iⁿ → $\text{R}$ with continuous nonzero partial derivatives and satisfying

$\text{??}\text{?x,}{}_{\mathrm{i}}\text{??}\text{?x}{}_{\mathrm{j}}$

for all x_i, x_j ≠ I, i, j = 1,2,…, n (n > 2) are determined (I is an interval of positive real numbers).     

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)}$

.     

Limit laws for record values

{X_n,n?1} are i.i.d. random variables with continuous d.f. F(x). X_j is a record value of this sequence if X_j>max{X₁,…,X_j?1}. Consider the sequence of such record values {X_Ln,n?1}. Set R(x)=-log(1?F(x)). There exist B_n > 0 such that . in probability (i.p.) iff i.p. iff $\text{{R(kx)?R(x)}}\text{R}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{(kx)}$ → ∞ as x→∞ for all k>1. Similar criteria hold for the existence of constants A_n such that X_Ln?A_n → 0 i.p. Limiting record value distributions are of the form N(-log(-logG(x))) where G(·) is an extreme value distribution and N(·) is the standard normal distribution. Domain of attraction criteria for each of the three types of limit laws can be derived by appealing to a duality theorem relating the limiting record value distributions to the extreme value distributions. Repeated use is made of the following lemma: If $\text{P}\text{{X}{}_{\mathrm{n}}\text{?x}=1?e}{}^{\mathrm{-x}}\text{,x?0}$, then X_Ln=Y₀+…+Y_n where the Y_j's are i.i.d. and $\text{P}\text{{Y}{}_{\mathrm{j}}\text{?x}=1?e}{}^{\mathrm{-x}}$.     

A process of runs and its convergence to the brownian motion

Let X₁,X₂,… be i.i.d. random variables with a continuous distribution function. Let R₀=0, R_k=min{j>R_k?1, such that X_j>X_j+1}, k?1. We prove that all finite-dimensional distributions of a process $\text{W}{}^{\mathrm{(n)}}\text{(t)=}\text{(R}{}_{\mathrm{[nt]}}\text{?2[nt])}\text{2}\text{3}\text{n}\text{, t ? [0,1]}$, converge to those of the standard Brownian motion.     

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.     

Enumeration of rises and falls by position

Let π=(π₁, π₂,…,π_n) denote a permutation of Z_n = {1, 2,…, n}. The pair (π_i, π_i+1) is a rise if π_i<π_i+1 or a fall if π_i>π_i+1. Also a conventional rise is counted at the beginning of π and a conventional fall at the end. Let k be a fixed integer ≥ 1. The rise π_i,π_i+1 is said to be in a in a j (mod k) position if i ≡ j (mod k); similarly for a fall. The conventional rise at the beginning is in a 0 (mod k) position, while the conventional fall at the end is in an n (mod k) position. Let $\text{P}{}_{\mathrm{n}}\text{≡P}{}_{\mathrm{n}}\text{(r}{}_0\text{,…,r}{}_{\mathrm{k}}\text{?1,?}{}_0\text{,…,?;}{}_{\mathrm{k}}\text{?1)}$ denote the number of permutations having r_i rises i (mod k) positions and ?;_i falls in i (mod k) positions. A generating function for P_n is obtained. In particular, for k = 2 the generating function is quite explicit and also, for certain special cases when k = 4.     

Three problems on the lengths of increasing runs

Let U₁, U₂,… be a sequence of independent, uniform (0, 1) r.v.'s and let R₁, R₂,… be the lengths of increasing runs of {U_i}, i.e., X₁=R₁=inf{i:U_i+1<U_i},…, X_n=R₁+R₂+?+R_n=inf{i:i>X_n?1,U_i+1<U_i}. The first theorem states that the sequence $\text{(}\text{3}\text{2}\text{n)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{(X}{}_{\mathrm{n}}\text{?2n)}$ can be approximated by a Wiener process in strong sense.Let τ(n) be the largest integer for which R₁+R₂+?+R_τ(n)?n, $\text{R}{}^1{}_{\mathrm{n}}\text{=n?(R}{}_1\text{+R}{}_2\text{+?+R}{}_{\mathrm{\tau (n)}}\text{)}$ and $\text{M}{}_{\mathrm{n}}\text{=}\text{max}\text{{R}{}_1\text{,R}{}_2\text{,…,R}{}_{\mathrm{\tau (n)}}\text{,R}{}^1{}_{\mathrm{n}}\text{}}$. Here M_n is the length of the longest increasing block. A strong theorem is given to characterize the limit behaviour of M_n.The limit distribution of the lengths of increasing runs is our third problem.     

Hermite series estimates of a probability density and its derivatives

The following estimate of the pth derivative of a probability density function is examined: $\text{Σ}{}_{\mathrm{k\; =\; 0}}{}^{\mathrm{N}}\text{a}\text{?}{}_{\mathrm{k}}\text{h}{}_{\mathrm{k}}\text{(x)}$, where h_k is the kth Hermite function and $\text{a}\text{?}{}_{\mathrm{k}}\text{= (}\text{(?1)}{}^{\mathrm{p}}\text{n}\text{)}$Σ_{i = 1}ⁿh_k^(p)(X_i) is calculated from a sequence X₁,…, X_n of independent random variables having the common unknown density. If the density has r derivatives the integrated square error converges to zero in the mean and almost completely as rapidly as O(n^?α) and O(n^?α log n), respectively, where $\text{α =}\text{2(r ? p)}\text{(2r + 1)}$. Rates for the uniform convergence both in the mean square and almost complete are also given. For any finite interval they are O(n^?β) and $\text{O(n}{}^{\mathrm{<mtext>?\beta </mtext><mtext>2</mtext>}}\text{log}\text{n)}$, respectively, where $\text{β =}\text{(2(r ? p) ? 1)}\text{(2r + 1)}$.     

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

Let L = ∑_{j = 1}^mX_j² be sum of squares of vector fields in $\text{R}$ⁿ satisfying a Hörmander condition of order 2: span{X_j, [X_i, X_j]} is the full tangent space at each point. A point x??D of a smooth domain D is characteristic if X₁,…, X_m are all tangent to ?D at x. We prove sharp estimates in non-isotropic Lipschitz classes for the Dirichlet problem near (generic) isolated characteristic points in two special cases: (a) The Grushin operator $\text{?}{}^2\text{?x}{}^2\text{+ x}{}^2\text{?}{}^2\text{?t}{}^2$ in $\text{R}$². (b) The real part of the Kohn Laplacian on the Heisenberg group $\text{∑}{}_{\mathrm{j\; ?\; 1}}{}^{\mathrm{n}}\text{(}\text{?}\text{?x}{}_{\mathrm{j}}\text{+ 2y}{}_{\mathrm{j}}\text{?}\text{?t}\text{)}{}^2\text{+ (}\text{?}\text{?y}{}_{\mathrm{j}}\text{? 2x}{}_{\mathrm{j}}\text{?}\text{?t}\text{)}{}^2$ in $\text{R}$^{2n + 1}. In contrast to non-characteristic points, C^∞ regularity may fail at a characteristic point. The precise order of regularity depends on the shape of ?D at x.     

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.     

On the rate for uniform strong consistency of empirical distributions of independent nonidentically distributed multivariate random variables

Let X_j = (X_1j ,…, X_pj), j = 1,…, n be n independent random vectors. For x = (x₁ ,…, x_p) in R^p and for α in [0, 1], let F_j${}^1$(x) = αI(X_1j < x₁ ,…, X_pj < x_p) + (1 ? α) I(X_1j ≤ x₁ ,…, X_pj ≤ x_p), where I(A) is the indicator random variable of the event A. Let F_j(x) = E(F_j${}^1$(x)) and D_n = sup_{x, α} max_{1 ≤ N ≤ n} |Σ₀ⁿ(F_j${}^1$(x) ? F_j(x))|. It is shown that P[D_n ≥ L] < 4pL exp{?2(L²n^?1 ? 1)} for each positive integer n and for all L² ≥ n; and, as n → ∞, $\text{D}{}_{\mathrm{n}}\text{= 0((n}\text{log}\text{n)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{)}$ with probability one.