Density of smooth maps in Wk, p(M, N) for a close to critical domain dimension

Assuming m − 1 < kp < m, we prove that the space C ^∞(M, N) of smooth mappings between compact Riemannian manifolds M, N (m = dim M) is dense in the Sobolev space W ^k,p (M, N) if and only if π _m−1(N) = {0}. If π _m−1(N) ≠ {0}, then every mapping in W ^k,p (M, N) can still be approximated by mappings M → N which are smooth except in finitely many points.     

Transfers of metabelian p-groups

Explicit expressions for the transfers V _i from a metabelian p-group G of coclass cc(G) = 1 to its maximal normal subgroups M ₁, . . . , M _p+1 are derived by means of relations for generators. The expressions for the exceptional case p = 2 differ significantly from the standard case of odd primes p ≥ 3. In both cases the transfer kernels Ker(V _i ) are calculated and the principalisation type of the metabelian p-group is determined, if G is realised as the Galois group Gal(F_p²(K)|K){{\rm{Gal}}({F}_p^2(K)\vert K)} of the second Hilbert p-class field F_p²(K){{F}_p^2(K)} of an algebraic number field K. For certain metabelian 3-groups G with abelianisation G/G′ of type (3, 3) and of coclass cc(G) = r ≥ 3, it is shown that the principalisation type determines the position of G on the coclass graph G(3,r){\mathcal{G}(3,r)} in the sense of Eick and Leedham-Green.     

L∞-upper bound of L2-projections onto splines at a geometric mesh

For an integer k 1 and a geometric mesh (qⁱ)_−∞^∞ with q ε (0, ∞), let M_i,k(x): = k[q^{i + k}](· − x)₊^{k − 1}, N_i,k(x): = (q^{i + k} − qⁱM_i,k(x)/k, and let A_k(q) be the Gram matrix (∝M_i,kN_j,k)_i,jεz. It is known that A_k(q)⁻¹_∞ is bounded independently of q. In this paper it is shown that A_k(q)⁻¹_∞ is strictly decreasing for q in [1, ∞). In particular, the sharp upper bound and lower bound for A_k (q)⁻¹ are obtained: for all q ε (0, ∞).     

Some estimations for the least degree of identities of subspaces M1(m,k) (F) of the matrix superalgebra M(m,k)(F)

We estimate the least degree of identities of subspaces M ₁^(m,k) (F) of the matrix superalgebra M ^(m,k)(F) over the field F for arbitrary m and k. For subspaces M ₁^(m,1) (F) (m≥1) and M ₁^(2,2) (F) we obtain concrete minimal identities.     

On p-rank representations

The p-rank of an algebraic curve X over an algebraically closed field k of characteristic p>0 is the dimension of the vector space H¹(X_et,F_p). We study the representations of finite subgroups GAut(X) induced on H¹(X_et,F_p)k, and obtain two main results.First, the sum of the nonprojective direct summands of the representation, i.e., its core, is determined explicitly by local data given by the fixed point structure of the group acting on the curve. As a corollary, we derive a congruence formula for the p-rank.Secondly, the multiplicities of the projective direct summands of quotient curves, i.e., their Borne invariants, are calculated in terms of the Borne invariants of the original curve and ramification data. In particular, this is a generalization of both Nakajima's equivariant Deuring–Shafarevich formula and a previous result of Borne in the case of free actions.     

On improved estimators of the generalized variance

Treated in this paper is the problem of estimating with squared error loss the generalized variance | Σ | from a Wishart random matrix S: p × p W_p(n, Σ) and an independent normal random matrix X: p × k N(ξ, Σ I_k) with ξ(p × k) unknown. Denote the columns of X by X₍₁₎ ,…, X_(k) and set ψ⁽⁰⁾(S, X) = {(n − p + 2)!/(n + 2)!} | S |, ψ⁽ⁱ⁾(X, X) = min[ψ⁽ⁱ⁻¹⁾(S, X), {(n − p + i + 2)!/(n + i + 2)!} | S + X₍₁₎ X′₍₁₎ + + X_(i) X′_(i) |] and Ψ⁽ⁱ⁾(S, X) = min[ψ⁽⁰⁾(S, X), {(n − p + i + 2)!/(n + i + 2)!}| S + X₍₁₎ X′₍₁₎ + + X_(i) X′_(i) |], i = 1,…,k. Our result is that the minimax, best affine equivariant estimator ψ⁽⁰⁾(S, X) is dominated by each of Ψ⁽ⁱ⁾(S, X), i = 1,…,k and for every i, ψ⁽ⁱ⁾(S, X) is better than ψ⁽ⁱ⁻¹⁾(S, X). In particular, ψ^(k)(S, X) = min[{(n − p + 2)!/(n + 2)!} | S |, {(n − p + 2)!/(n + 2)!} | S + X₍₁₎X′₍₁₎|,…,| {(n − p + k + 2)!/(n + k + 2)!} | S + X₍₁₎X′₍₁₎ + + X_(k)X′_(k)|] dominates all other ψ's. It is obtained by considering a multivariate extension of Stein's result (Ann. Inst. Statist. Math. 16, 155–160 (1964)) on the estimation of the normal variance.     

On a conjecture by B. Grünbaum

Denote by p_k(M) or υ_k(M) the number of k-gonal faces or k-valent of the convex 3-polytope M, respectively. Completely solving a problem by B. Grünbaum, the following theorem is proved: Given sequences of nonnegative integers p = (p₃, p₄,…p_m), υ = (υ₃, υ₄,…,υ_n) satisfying ∑_k?3(6−k)p_k + 2∑_k?3(3−k)υ_k = 12, there exists a convex 3-polytope M with p_k(M) = p_k for all k ≠ 6 and υ_k for all k ≠ 3 if and only if for the sequences p, υ the following does not hold: ∑p_i = 0 for i odd and ∑υ_i = 1 for i ? 0 (mod 3).     

Minimal cyclic codes of length pq

Explicit expressions for all the 3n+2 primitive idempotents in the ring R_pⁿq=GF(ℓ)[x]/(x^pnq−1), where p,q,ℓ are distinct odd primes, ℓ is a primitive root modulo pⁿ and q both, , are obtained. The dimension, generating polynomials and the minimum distance of the minimal cyclic codes of length pⁿq over GF(ℓ) are also discussed.     

Ordered overlaps in disordered mean-field models

Let M(N) be a sequence of integers with M→∞ as N→∞ and M=o(N). For bounded i.i.d. r.v. ξ _i ^k and bounded i.i.d. r.v. σ _i , we study the large deviation of the family of (ordered) scalar products X ^k =N ⁻¹∑ _{i =1} ^N σ _i ξ _i ^k ,k≤M, under the distribution conditioned on the ξ _i ^k 's. To get a full large deviation principle, it is necessary to specify also the total norm(∑ _{k ≤ M} (X ^k )²)^1/2, which turns to be associated with some extra Gaussian distribution. Our results apply to disordered, mean-field systems, including generalized Hopfield models in the regime of a sublinear number of patterns. We build also a class of examples where this norm is the crucial order parameter. Received: 6 April 1999 / Revised version: 29 May 2000 /?Published online: 24 July 2001     

On number system constructions

We investigate various number system constructions. After summarizing earlier results we prove that for a given lattice Λ and expansive matrix M: Λ → Λ if ρ(M ⁻¹) < 1/2 then there always exists a suitable digit set D for which (Λ, M, D) is a number system. Here ρ means the spectral radius of M ⁻¹. We shall prove further that if the polynomial f(x) = c ₀ + c ₁ x + ··· + c _k x ^k ∈ Z[x], c _k = 1 satisfies the condition |c ₀| > 2 Σ _i=1 ^k |c _i | then there is a suitable digit set D for which (Z ^k , M, D) is a number system, where M is the companion matrix of f(x). The research was supported by OTKA-T043657 and Bolyai Fellowship Committee.     

Selection in Monotone Matrices and Computingkth Nearest Neighbors

Anm×nmatrix =(a_{i, j}), 1≤i≤mand 1≤j≤n, is called atotally monotonematrix if for alli₁, i₂, j₁, j₂, satisfying 1≤i₁<i₂≤m, 1≤j₁<j₂≤n.[formula]We present an[formula]time algorithm to select thekth smallest item from anm×ntotally monotone matrix for anyk≤mn. This is the first subquadratic algorithm for selecting an item from a totally monotone matrix. Our method also yields an algorithm of the same time complexity for ageneralized row-selection problemin monotone matrices. Given a setS={p₁,…, p_n} ofnpoints in convex position and a vectork={k₁,…, k_n}, we also present anO(n^4/3log^c n) algorithm to compute thek_ith nearest neighbor ofp_ifor everyi≤n; herecis an appropriate constant. This algorithm is considerably faster than the one based on a row-selection algorithm for monotone matrices. If the points ofSare arbitrary, then thek_ith nearest neighbor ofp_i, for alli≤n, can be computed in timeO(n^7/5 log^c n), which also improves upon the previously best-known result.     

On the k-error linear complexity of sequences with period 2pn over GF(q)

In this paper, we first optimize the structure of the Wei–Xiao–Chen algorithm for the linear complexity of sequences over GF(q) with period N =  2p ⁿ , where p and q are odd primes, and q is a primitive root modulo p ². The second, an union cost is proposed, so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2p ⁿ over GF(q) is derived, where p and q are odd primes, and q is a primitive root modulo p ². The third, we give a validity of the proposed algorithm, and also prove that there exists an error sequence e ^N , where the Hamming weight of e ^N is not greater than k, such that the linear complexity of (s + e) ^N reaches the k-error linear complexity c. We also present a numerical example to illustrate the algorithm. Finally, we present the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.     

Strong Sperner property of the subgroup lattice of an Abelianp-group

Letn andk be arbitrary positive integers,p a prime number and L_(k ⁿ)(p) the subgroup lattice of the Abelianp-group (Z/p ^k ) ⁿ . Then there is a positive integerN(n,k) such that whenp N(n,k),L _(k ^N )(p) has the strong Sperner property.     

Extended iterative methods for the solution of operator equations

Summary Given an iterative methodM ₀, characterized byx ^(k+1=G ₀(x( ^k )) (k0) (x(⁰) prescribed) for the solution of the operator equationF(x)=0, whereF:XX is a given operator andX is a Banach space, it is shown how to obtain a family of methodsM _p characterized byx ^(k+1=G _p (x( ^k )) (k0) (x(⁰) prescribed) with order of convergence higher than that ofM _o. The infinite dimensional multipoint methods of Bosarge and Falb [2] are a special case, in whichM ₀ is Newton's method.Analogues of Theorems 2.3 and 2.36 of [2] are proved for the methodsM _p, which are referred to as extensions ofM ₀. A number of methods with order of convergence greater than two are discussed and existence-convergence theorems for some of them are proved.Finally some computational results are presented which illustrate the behaviour of the methods and their extensions when used to solve systems of nonlinear algebraic equations, and some applications currently being investigated are mentioned.     

Asymptotic joint distribution of the largest roots of several multivariate F matrices I. Quasi-independent case

An asymptotic expansion of the joint distribution of k largest characteristic roots C_M⁽ⁱ⁾(S_iS₀^?1), i = 1,…, k, is given, where S'_is and S₀ are independent Wishart matrices with common covariance matrix Σ. The modified second-approximation procedure to the upper percentage points of the maximum of C_M⁽ⁱ⁾(S_iS₀^?1), i = 1,…, k, is also considered. The evaluation of the expansion is based on the idea for studentization due to Welch and James with the use of differential operators and of the perturbation procedure.     

Characterizability of the Group ^2Dp（3） by its Order Components,Where p ≥ 5 is a Prime Number Not of the Form 2^m ＋ 1

The author will prove that the group ^2Dp（3） can be uniquely determined by its order components, where p ≠ 2^m ＋ 1 is a prime number, p ≥ 5. More precisely, if OC（G） denotes the set of order components of G, we will prove OC（G） = OC（^2Dp（3）） if and only if G is isomorphic to ^2Dp（3）. A main consequence of our result is the validity of Thompson＇s conjecture for the groups under consideration.     

Isoperimetric inequalities,isometric actions and the higher Newman numbers

M will be a compact connected n-dimensional Riemannian manifold. If M contains a closed connected k-dimensional, 2 k < n, minimal immersed submanifold of M, we define the kth isoperimetric number of M, Ñ _k (M), as the infimum of the volumes of all such submanifolds. We obtain a number of interesting estimates for Ñ _k (M), for both general and special manifolds, which appear to be new.Next we turn to isometric actions and a 1931 theorem of M. H. A. Newman involving the size of orbits of group actions on manifolds. We introduce the higher Newman numbers N _k (M), 1 k n. Roughly speaking, if M admits isometric actions of compact connected Lie groups with k-dimensional principal orbits, N _k (M) is defined as the infimum over all such actions of the maximum volume of all maximal dimensional orbits. We observe that N _k (M) Ñ _k (M), 2 k < n, provided N _k (M) is defined; hence our prior estimates for the isoperimetric numbers of M apply directly to the higher Newman numbers.As a best possible candidate we conjecture that N _k (M) vol S ^k (i(M)/), 1 k n, where i(M) denotes the radius of injectivity of M and S ^k (i(M)/) denotes the standard k-sphere of radius i(M)/. We verify the conjecture for various special cases. We conclude the paper by studying Newman's theorem for compact connected Lie groups with invariant metrics and obtaining a lower bound for the size of small subgroups.     

Prophet regions and sharp inequalities for pth absolute moments of martingales

Exact comparisons are made relating E|Y₀|^p, E|Y_n−1|^p, and E(max_j≤n−1 |Y_j|^p), valid for all martingales Y₀,…,Y_n−1, for each p ≥ 1. Specifically, for p > 1, the set of ordered triples {(x, y, z) : X = E|Y₀|^p, Y = E |Y_n−1|^p, and Z = E(max_j≤n−1 |Y_j|^p) for some martingale Y₀,…,Y_n−1} is precisely the set {(x, y, z) : 0≤x≤y≤z≤Ψ_n,p(x, y)}, where Ψ_n,p(x, y) = xψ_n,p(y/x) if x > 0, and = a_n−1,py if x = 0; here ψ_n,p is a specific recursively defined function. The result yields families of sharp inequalities, such as E(max_j≤n−1 |Y_j|^p) + ψ_n,p^*(a) E |Y₀|^p ≤ aE |Y_n−1|^p, valid for all martingales Y₀,…,Y_n−1, where ψ_n,p^* is the concave conjugate function of ψ_n,p. Both the finite sequence and infinite sequence cases are developed. Proofs utilize moment theory, induction, conjugate function theory, and functional equation analysis.     

OD-characterization of Almost Simple Groups Related to U3（5）

Let G be a finite group with order ｜G｜=p1^α1p2^α2……pk^αk, where p1 〈 p2 〈……〈 Pk are prime numbers. One of the well-known simple graphs associated with G is the prime graph （or Gruenberg- Kegel graph） denoted .by г（G） （or GK（G））. This graph is constructed as follows： The vertex set of it is π（G） = {p1,p2,…,pk} and two vertices pi, pj with i≠j are adjacent by an edge （and we write pi - pj） if and only if G contains an element of order pipj. The degree deg（pi） of a vertex pj ∈π（G） is the number of edges incident on pi. We define D（G） ：= （deg（p1）, deg（p2）,..., deg（pk））, which is called the degree pattern of G. A group G is called k-fold OD-characterizable if there exist exactly k non- isomorphic groups H such that ｜H｜ = ｜G｜ and D（H） = D（G）. Moreover, a 1-fold OD-characterizable group is simply called OD-characterizable. Let L ：= U3（5） be the projective special unitary group. In this paper, we classify groups with the same order and degree pattern as an almost simple group related to L. In fact, we obtain that L and L.2 are OD-characterizable; L.3 is 3-fold OD-characterizable; L.S3 is 6-fold OD-characterizable.     

On the evaluation of the Eigenvalues of a banded toeplitz block matrix

Let A = (a_ij) be an n × n Toeplitz matrix with bandwidth k + 1, K = r + s, that is, a_ij = a_j−i, i, J = 1,… ,n, a_i = 0 if i > s and if i < -r. We compute p(λ)= det(A - λI), as well as p(λ)/p′(λ), where p′(λ) is the first derivative of p(λ), by using O(k log k log n) arithmetic operations. Moreover, if a_i are m × m matrices, so that A is a banded Toeplitz block matrix, then we compute p(λ), as well as p(λ)/p′(λ), by using O(m³k(log² k + log n) + m²k log k log n) arithmetic operations. The algorithms can be extended to the computation of det(A − λB) and of its first derivative, where both A and B are banded Toeplitz matrices. The algorithms may be used as a basis for iterative solution of the eigenvalue problem for the matrix A and of the generalized eigenvalue problem for A and B.