Adjacency preserving functions on symmetric elements and linear preservers of non-zero decomposable symmetric tensors

Let A be a non-empty set and m be a positive integer. Let ≡ be the equivalence relation defined on A ^m such that (x ₁, …, x _m ) ≡ (y ₁, …, y _m ) if there exists a permutation σ on {1, …, m} such that y _σ(i) = x _i for all i. Let A ^(m) denote the set of all equivalence classes determined by ≡. Two elements X and Y in A ^(m) are said to be adjacent if (x ₁, …, x _m?1, a) ∈ X and (x ₁, …, x _m?1, b) ∈ Y for some x ₁, …, x _m?1 ∈ A and some distinct elements a, b ∈ A. We study the structure of functions from A ^(m) to B ⁽ⁿ⁾ that send adjacent elements to adjacent elements when A has at least n + 2 elements and its application to linear preservers of non-zero decomposable symmetric tensors.     

Prophet Regions for Discounted,Uniformly Bounded Random Variables

Abstract

Let X ₁, X ₂,… be any sequence of [0,1]-valued random variables. A complete comparison is made between the expected maximum E(max _j≤n Y _j ) and the stop rule supremum sup _t E Y _t for two types of discounted sequences: (i) Y _j  = b _j X _j , where {b _j } is a nonincreasing sequence of positive numbers with b ₁ = 1; and (ii) Y _j  = B ₁… B _j?1 X _j , where B ₁, B ₂,… are independent [0,1]-valued random variables that are independent of the X _j , having a common mean β. For instance, it is shown that the set of points {(x, y): x = sup _t E Y _{{(x, y): x=sup t E Y} and y = E(max _j≤n Y _j ), for some sequence X ₁,…,X _n and Y _j  = b _j X _j }, is precisely the convex closure of the union of the sets {(b _j x, b _j y): (x, y) ∈ C _j }, j = 1,…,n, where C _j  = {(x, y):0 ≤ x ≤ 1, x ≤ y ≤ x[1 + (j ? 1)(1 ? x ^1/(j?1))]} is the prophet region for undiscounted random variables given by Hill and Kertz [8 Hill , T.P. , and R.P. Kertz . 1983 . Stop rule inequalities for uniformly bounded sequences of random variables . Trans. Amer. Math. Soc. 278 : 197 – 207 . [CSA]  [Google Scholar]]. As a special case, it is shown that the maximum possible difference E(max _j≤n β ^j?1 X _j ) ? sup _t E(β ^t?1 X _t ) is attained by independent random variables when β ≤ 27/32, but by a martingale-like sequence when β > 27/32. Prophet regions for infinite sequences are given also.     

Multiple Symmetric Solutions for Discrete Lidstone Boundary Value Problems

We offer criteria for the existence of single, double and multiple positive symmetric solutions for the boundary value problem ?^{2m y(k-m)= f(y(k), ?²y(k-1)….,?SUP>2i y(k-i),…,?2(m-1)} y(k-(m-1))), k∈{a+1,…,b+1} ?²ⁱ y(a+1-m)=?²ⁱ y(b+1+m-2i)=0, 0≤i≤m-1 where m ≥ 1 and (-1)^m f can either be positive or the condition can be relaxed.     

On properties of entire solutions of linear differential equations with polynomial coefficients

We investigate properties of entire solutions of differential equations of the form

Boundedness of multilinear commutators of generalized fractional integrals

Let L be the infinitesimal generator of an analytic semigroup on L²(?ⁿ ) with Gaussian kernel bound, and let L^{–α /2} be the fractional integral of L for 0 < α < n. Suppose that b = (b₁, b₂, …, b_m ) is a finite family of locally integral functions, then the multilinear commutator generated by b and L^{–α /2} is defined by L^{–α /2} _b f = [b_m , …, [b₂, [b₁, L^{–α /2}]], …, ] f, where m ∈ ?⁺. When b₁, b₂, …, b_m ∈ BMO or b_j ∈ Λ (0 < β_j < 1) for 1 ≤ j ≤ m, the authors study the boundedness of L^{–α /2} _b . (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Disjoint skolem sequences and related disjoint structures

A Skolem sequence of order n is a sequence S = (s₁, s₂…, s²ⁿ) of 2n integers satisfying the following conditions: (1) for every k ∈ {1, 2,… n} there exist exactly two elements s_i,S_j such that S_i = S_j = k; (2) If s_i = s_j = k,i < j then j ? i = k. In this article we show the existence of disjoint Skolem, disjoint hooked Skolem, and disjoint near-Skolem sequences. Then we apply these concepts to the existence problems of disjoint cyclic Steiner and Mendelsohn triple systems and the existence of disjoint 1-covering designs. © 1993 John Wiley & Sons, Inc.     

Construction of Williamson type matrices

Recent advances in the construction of Hadamard matrices have depeaded on the existence of Baumert-Hall arrays and four (1, ?1) matrices A B C Dof order m which are of Williamson type, that is they pair-wise satisfy

i) MN^T = NM^T , ∈ {A B C D} and

ii) AA^T + BB^T + CC^T + DD^T = 4mI_m .

It is shown that Williamson type matrices exist for the orders m = s(4 ? 1)m = s(4s + 3) for s∈ {1, 3, 5, …, 25} and also for m = 93. This gives Williamson matrices for several new orders including 33, 95,189.

These results mean there are Hadamard matrices of order

i) 4s(4s ?1)t, 20s(4s ? 1)t,s ∈ {1, 3, 5, …, 25};

ii) 4s(4:s + 3)t, 20s(4s + 3)t s ∈ {1, 3, 5, …, 25};

iii) 4.93t, 20.93t

for

t ∈ {1, 3, 5, … , 61} ∪ {1 + 2 ^a 10 ^b 26 ^c a b c nonnegative integers}, which are new infinite families.

Also, it is shown by considering eight-Williamson-type matrices, that there exist Hadamard matrices of order 4(p + 1)(2p + l)r and 4(p + l)(2p + 5)r when p ≡ 1 (mod 4) is a prime power, 8ris the order of a Plotkin array, and, in the second case 2p + 6 is the order of a symmetric Hadamard matrix. These classes are new.     

A connection between Schur multiplication and Fourier interpolation. II

Given m × n matrices A = [a_jk ] and B = [b_jk ], their Schur product is the m × n matrix A ○ B = [a_jkb_jk ]. For any matrix T, define ‖T‖ _S = max_{X ≠O} ‖T ○ X ‖/‖X ‖ (where ‖·‖ denotes the usual matrix norm). For any complex (2n – 1)‐tuple μ = (μ _{–n +1}, μ _{–n +2}, …, μ _{n –1}), let T_μ be the Hankel matrix [μ –_{n +j +k –1}]_j,k and define ??_μ = {f ∈ L ₁[–π, π] : f? (2j ) = μ_j for –n + 1 ≤ j ≤ n – 1} . It is known that ‖T_μ‖ _S ≤ infequation/tex2gif-inf-18.gif ‖f ‖₁. When equality holds, we say T_μ is distinguished. Suppose now that μ _j ∈ ? for all j and hence that T_μ is hermitian. Then there is a real n × n hermitian unitary X and a real unit vector y such that 〈(T_μ ○ X )y, y 〉 = ‖T_μ ‖_S . We call such a pair a norming pair for T_μ . In this paper, we study norming pairs for real Hankel matrices. Specifically, we characterize the pairs that norm some distinguished Schur multiplier T_μ . We do this by giving necessary and suf.cient conditions for (X, y ) to be a norming pair in the n ‐dimensional case. We then consider the 2‐ and 3‐dimensional cases and obtain further results. These include a new and simpler proof that all real 2 × 2 Hankel matrices are distinguished, and the identi.cation of new classes of 3 × 3 distinguished matrices. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

3-(v, 4, 1) covering designs with chromatic numbers 2 and 3

A t-(v, k, λ) covering design is a pair (X, B) where X is a v-set and B is a collection of k-sets in X, called blocks, such that every t element subset of X is contained in at least λ blocks of B. The covering number, C_λ(t, k, v), is the minimum number of blocks a t-(v, k, λ) covering design may have. The chromatic number of (X, B) is the smallest m for which there exists a map φ: X → Z_m such that ∣φ((β)∣ ≥2 for all β ∈ B, where φ(β) = {φ(x): x ∈ β}. The system (X, B) is equitably m-chromatic if there is a proper coloring φ with minimal m for which the numbers ∣φ^?1(c)∣ c ∈ Z_m differ from each other by at most 1. In this article we show that minimum, (i.e., ∣B∣ = C λ (t, k, v)) equitably 3-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0 (mod 6), v ≥ 18 for v ≥ 1, 13 (mod 36), v ≡ 13 and for all numbers v = n, n + 1, where n ≡ 4, 8, 10 (mod 12), n ≥ 16; and n = 6.5^a 13^b 17^c ?4, a + b + c > 0, and n = 14, 62. We also show that minimum, equitably 2-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0, 5, 9 (mod 12), v ≥ 0, v = 2.5^a 13^b 17^c + 1, a + b + c > 0, and v = 23. © 1993 John Wiley & Sons, Inc.     

Multiplicative infinite loop space theory

Let G be a finitely presented group given by its pre-abelian presentation <X1,…,Xm; Xe11ζ1,…,Xemmζ,ζm+1,…>, where ei≥0 for i = 1,…, m and ζj?G′ for j≥1. Let N be the subgroup of G generated by the normal subgroups [xeii, G] for i = 1,…, m. Then Dn+2(G)≡γn+2(G) (modNG′) for all n≥0, where G” is the second commutator subgroup of G,γn+2(G) is the (n+2)th term of the lower central series of G and Dn+2(G) = G∩(1+△n+2(G)) is the (n+2)th dimension subgroup of G.     

On the form of homomorphisms into the differential group Ls 1 and their extensibility

Let L_s ¹ (s ∈ ?) be the s-th differential group, that is the set {(x1,…,x_s): x₁ ≠ 0, x_n ∈ K, n =1,2,…,s} (K ∈ {?,?}) together with the group operation which describes the chain rules (up to order s) for C^s-functions with fixed point 0. We consider homomorphisms Φ_s, Φ_s = (f₁,…,f_s) from an abelian group (G,+) into L_s ¹ such that f₁ = 1, f₂ = … = f_p+2 = 0, 0_p+2 ≠ 0 for a fixed, but arbitrary p ≥ 0 such that p + 2 ≤ s (then f_p+2 is necessarily a homomorphism from (G, +) to (K, +). Let l ∈ ? or l = ∞. We present a criterion for the extensibility of Φ_s to a homomorphism Φ_s+l from (G, +) to L_s+1 ¹ (L_∞ ¹, if l = ∞), by proving that such an extension (continuation) exists iff the component functions f_n of Φ_s with s - p ≤ n ≤ min(s - p + l - 1,s) are certain polynomials in f_P+2 (see Theorem 1). We also formulate the problem in the language of truncated formal power series in one indeterminate X over K. The somewhat easier situation f ₁ ≠ 1 will be studied in a separate paper.     

Almost sure central limit theorem for partial sums and maxima

Let X, X₁, X₂, … be i.i.d. random variables with nondegenerate common distribution function F, satisfying EX = 0, EX² = 1. Let X_i and M_n = max{X_i, 1 ≤ i ≤ n }. Suppose there exists constants a_n > 0, b_n ∈ R and a nondegenrate distribution G (y) such that Then, we have almost surely, where f (x, y) denotes the bounded Lipschitz 1 function and Φ(x) is the standard normal distribution function (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Prophet Regions for Independent [0, 1]-Valued Random Variables with Random Discounting

Abstract

Let X ₁, X ₂… and B ₁, B ₂… be mutually independent [0, 1]-valued random variables, with EB _j  = β > 0 for all j. Let Y _j  = B ₁ … sB _j?1 X _j for j ≥ 1. A complete comparison is made between the optimal stopping value V(Y ₁,…,Y _n ):=sup{EY _τ:τ is a stopping rule for Y ₁,…,Y _n } and E(max _1≤j≤n Y _j ). It is shown that the set of ordered pairs {(x, y):x = V(Y ₁,…,Y _n ), y = E(max _1≤j≤n Y _j ) for some sequence Y ₁,…,Y _n obtained as described} is precisely the set {(x, y):0 ≤ x ≤ 1, x ≤ y ≤ Ψ _{n, β}(x)}, where Ψ _{n, β}(x) = [(1 ? β)n + 2β]x ? β^?(n?2) x ² if x ≤ β ^n?1, and Ψ _{n, β}(x) = min _j≥1{(1 ? β)jx + β ^j } otherwise. Sharp difference and ratio prophet inequalities are derived from this result, and an analogous comparison for infinite sequences is obtained.     

On a question of Sárközy on gaps of product sequences

Motivated by a question of Sárközy, we study the gaps in the product sequence B = A · A = {b ₁ < b ₂ < …} of all products a _i a _j with a _i , a _j ∈ A when A has upper Banach density α > 0. We prove that there are infinitely many gaps b _n+1 ? b _n ? α ^?3 and that for t ≥ 2 there are infinitely many t-gaps b _n+t ? b _n ? t ² α ^?4. Furthermore, we prove that these estimates are best possible.We also discuss a related question about the cardinality of the quotient set A/A = {a _i /a _j , a _i , a _j ∈ A} when A ? {1, …, N} and |A| = αN.     

Cycloidal algebras

In this paper we introduce for an arbitrary algebra (groupoid, binary system) (X; *) a sequence of algebras (X; *) _n = (X; °), where x ° y = [x * y] _n = x * [x * y] _n?1, [x * y]₀ = y. For several classes of examples we study the cycloidal index (m, n) of (X; *), where (X; *) _m = (X; *) _n for m > n and m is minimal with this property. We show that (X; *) satisfies the left cancellation law, then if (X; *) _m = (X; *) _n , then also (X; *) _m?n = (X; *)₀, the right zero semigroup. Finite algebras are shown to have cycloidal indices (as expected). B-algebras are considered in greater detail. For commutative rings R with identity, x * y = ax + by + c, a, b, c ∈ ? defines a linear product and for such linear products the commutativity condition [x * y] _n = [y * x] _n is observed to be related to the golden section, the classical one obtained for ?, the real numbers, n = 2 and a = 1 as the coefficient b.     

Circuits including a given set of vertices

Let G = (V, E) be a digraph of order n, satisfying Woodall's condition ? x, y ∈ V, if (x, y) ? E, then d⁺(x) + d^?(y) ≥ n. Let S be a subset of V of cardinality s. Then there exists a circuit including S and of length at most Min(n, 2s). In the case of oriented graphs we obtain the same result under the weaker condition d⁺(x) + d^?(y) ≥ n – 2 (which implies hamiltonism).     

On the equivalence of the Euler-Pommier operators in spaces of analytic functions

In the space A (θ) of all one-valued functions f(z) analytic in an arbitrary region G ? ? (0 ∈ G) with the topology of compact convergence, we establish necessary and sufficient conditions for the equivalence of the operators L ₁=α _n z ⁿ Δ ⁿ + ... + α₁ zΔ+α₀ E and L ₂= z ⁿ a _n (z)Δ ⁿ + ... + za ₁(z)Δ+a ₀(z)E, where δ: (Δ?)(z)=(f(z)-?(0))/z is the Pommier operator in A(G), n ∈ ?, α _n ∈ ?, a _k (z) ∈ A(G), 0≤k≤n, and the following condition is satisfied: Σ _j=s ^n?1 α _j+1 ∈ 0, s=0,1,...,n?1. We also prove that the operators z ^s+1Δ+β(z)E, β(z) ∈ A _R , s ∈ ?, and z ^s+1 are equivalent in the spaces A _R, 0?R?-∞, if and only if β(z) = 0.     

Legendre polynomial kernel estimation of a density function with censored observations and an application to clinical trials

Let f(x), x ∈ ?^M, M ≥ 1, be a density function on ?^M, and X₁, …., X_n a sample of independent random vectors with this common density. For a rectangle B in ?^M, suppose that the X's are censored outside B, that is, the value X_k is observed only if X_k ∈ B. The restriction of f(x) to x ∈ B is clearly estimable by established methods on the basis of the censored observations. The purpose of this paper is to show how to extrapolate a particular estimator, based on the censored sample, from the rectangle B to a specified rectangle C containing B. The results are stated explicitly for M = 1, 2, and are directly extendible to M ≥ 3. For M = 2, the extrapolation from the rectangle B to the rectangle C is extended to the case where B and C are triangles. This is done by means of an elementary mapping of the positive quarter‐plane onto the strip {(u, v): 0 ≤ u ≤ 1, v > 0}. This particular extrapolation is applied to the estimation of the survival distribution based on censored observations in clinical trials. It represents a generalization of a method proposed in 2001 by the author [2]. The extrapolator has the following form: For m ≥ 1 and n ≥ 1, let K_{m, n}(x) be the classical kernel estimator of f(x), x ∈ B, based on the orthonormal Legendre polynomial kernel of degree m and a sample of n observed vectors censored outside B. The main result, stated in the cases M = 1, 2, is an explicit bound for E|K_{m, n}(x) ? f(x)| for x ∈ C, which represents the expected absolute error of extrapolation to C. It is shown that the extrapolator is a consistent estimator of f(x), x ∈ C, if f is sufficiently smooth and if m and n both tend to ∞ in a way that n increases sufficiently rapidly relative to m. © 2006 Wiley Periodicals, Inc.     

A new model updating method for damped structural systems

In this paper, the following two are considered: Problem IQEP Given M_a∈ SR ^n×n, Λ=diag{λ₁, …, λ_p}∈ C ^p×p, X=[x₁, …, x_p]∈ C ^n×p, and both Λ and X are closed under complex conjugation in the sense that $\lambda_{2j} = \bar{\lambda}_{2j-1} \in {\mathbf{C}}In this paper, the following two are considered: Problem IQEP Given M_a∈ SR ^n×n, Λ=diag{λ₁, …, λ_p}∈ C ^p×p, X=[x₁, …, x_p]∈ C ^n×p, and both Λ and X are closed under complex conjugation in the sense that $\lambda_{2j} = \bar{\lambda}_{2j-1} \in {\mathbf{C}}$, x_2j=x?_2j?1∈ C ⁿ for j = 1,…,l, and λ_k∈ R , x_k∈ R ⁿ for k=2l+1,…,p, find real‐valued symmetric (2r+1)‐diagonal matrices D and K such that ∥M_aXΛ²+DXΛ+KX∥=min. Problem II Given real‐valued symmetric (2r+1)‐diagonal matrices D_a, K_a∈ R ^n×n, find $(\hat{D},\hat{K}) \in {\mathscr{S}}_{DK}$ such that $\|\hat{D}-D_a \|^2+ \| \hat{K}-K_a \|^2=\rm{inf}_{(D,K) \in {\mathscr{S}}_{DK}}(\|D-D_a\|^2+\|K-K_a\|^2)$, where ??_DK is the solution set of IQEP. By applying the Kronecker product and the stretching function of matrices, the general form of the solution of Problem IQEP is presented. The expression of the unique solution of Problem II is derived. A numerical algorithm for solving Problem II is provided. Copyright © 2009 John Wiley & Sons, Ltd.