On the robustness of balanced fractional 2m factorial designs of resolution 2l+1 in the presence of outliers

Summary By use of the algebraic structure, we obtain a simplified expression for the outlier-insensitivity factor for balanced fractional 2^m factorial (2^m-BFF) designs of resolution 2l+1 derived from simple arrays (S-arrays), whose measure has been introduced by Ghosh and Kipnegeno (1985,J. Statist. Plann. Inference,11, 119–129). It is defined by use of the measure suggested by Box and Draper (1975,Biometrika, 62 (2), 347–352). As examples, we study the sensitivity ofA-optimal 2^m-BFF designs of resolution VII (i.e.,l=3) given by Shirakura (1976,Ann. Statist.,4, 515–531; 1977,Hiroshima Math. J.,7, 217–285). We observe that these designs are robust in the sense that they have low sensitivities. Research supported in part by Grant 59530012 (C) and 60530014 (C), Japan.     

Osculating Degeneration of Curves

Abstract

The main objects of this paper are osculating spaces of order mto smooth algebraic curves, with the property of meeting the curve again. We prove that the only irreducible curves with an infinite number of this type of osculating spaces of order mare curves in P ^m+1whose degree nis greater than m + 1. This is a generalization of the result and proof of Kaji (Kaji, H. (1986). On the tangentially degenerate curves. J. London Math. Soc.33(2):430–440) that corresponds to the case m = 1. We also obtain an enumerative formula for the number of those osculating spaces to curves in P ^m+2. The case m = 1 of it is a classical formula proved with modern techniques by Le Barz (Le Barz, P. (1982). Formules multisécantes pour les courbes gauches quelconques. In: Enumerative Geometry and Classical Algebraic Geometry. Prog. in Mathematics 24, Birkhäuser, pp. 165–197).     

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.     

Equipartition of a continuous mass distribution

Here are three samples of results. (1) Let m be a finite (absolutely) continuous mass distribution in ℝ², and let ℓ = {ℓ₁, ..., ℓ₅ ⊂ ℝ²} be a quintuple of rays with common origin such that any two adjacent angles between them make a sum of at most π. Then an affine image of ℓ subdivides m into five parts with any prescribed ratios. (2) For each finite continuous mass distribution m in ℝⁿ, there exist n mutually orthogonal hyperplanes any two of which quarter m. (3) Let m and m′ be two finite continuous mass distributions in ℝRⁿ with common center of symmetry O. Then there exist n hyperplanes through O any two of which quarter both m and m′. Bibliography: 9 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 329, 2005, pp. 92–106.     

Interpolation by holomorphic automorphisms and embeddings in Cn

Let n > 1 and let C ⁿ denote the complex n-dimensional Euclidean space. We prove several jet-interpolation results for nowhere degenerate entire mappings F:C ⁿ →C ⁿ and for holomorphic automorphisms of C ⁿ on discrete subsets of C ⁿ.We also prove an interpolation theorem for proper holomorphic embeddings of Stein manifolds into C ⁿ.For each closed complex submanifold (or subvariety) M ⊂ C ⁿ of complex dimension m < n we construct a domain Ω ⊂C ⁿ containing M and a biholomorphic map F: Ω → C ⁿ onto C ⁿ with J F ≡ 1such that F(M) intersects the image of any nondegenerate entire map G:C ^n−m →C ⁿ at infinitely many points. If m = n − 1, we construct F as above such that C ⁿ ∖F(M) is hyperbolic. In particular, for each m ≥ 1we construct proper holomorphic embeddings F:C ^m →C ^m−1 such that the complement C ^m+1 ∖F(C ^m )is hyperbolic.     

On the Kronecker pairing for mixed cusp forms

LetG⊃PSL(2,R) be a Fuchsian group of the first kind with no elements of finite order, and letS ^2m V be the 2m-fold symmetric power of the standard representationV ofSL(2,R) on C². We determine the value of the Kronecker pairing between the canonical image of a mixed cusp formf of type (2,2m) inH ¹(G, S ^2m V) and a cycleg ⊗Q _g ^m inH ₁ (G, (S ^2m V)^*) for eachg inG, whereQ _g ^m is an element of (S ^2m V)^* associated tog, m and a monodromy representation ofG.     

A small embedding for partial even-cycle systems

Let m = 2k. We show that for some 0 ≤ ξ <1, a partial directed m-cycle system of order n can be embedded in a directed m-cycle system of order (mn)/2 + (2m² 1) √(8n + 1)/4 + 4m^{3 2} + 4 + 1/2. For fixed m, this is asymptotic in n to (mn)/2 and so for large n is roughly one-fourth the best known bound of 2mn + 1. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 205–215, 1999     

Congruence theorems for compact hypersurfaces of a riemannian manifold

Summary Let M^m, ^m be two m-dimensional compact oriented hypersurfaces of class C³ immersed in a Riemannian manifold R^m+1 of constant sectional curvature. Suppose that R^m+1 admits a one-parameter continuous group G of conformal transformations satisfying a certain condition (which holds automatically when G is a group of isometric transformations). Suppose further that there is a1 − 1 transformation T_τ ∈ G between M^m and ^m such that for each P ∈ M^m and each ^m. If the r-th mean curvature for any r, 1 ⩽ r ⩽ m, of M^m at each point P ∈ M^m is equal to that of ^m at the corresponding point , together with other conditions, then M^m and ^m are congruent mod G. This is a generalization of a joint theorem ofH. Hopf andY. Katsurada [5] in which G is a group of isometric transformations. Entrata in Redazione il 13 Giugno 1975. The first author was partially supported by the National Science Foundation grant GP-33944.     

Self-packing of centrally symmetric convex bodies in ℝ2

LetB be a compact convex body symmetric around0 in ℝ² which has nonempty interior, i.e., the unit ball of a two-dimensional Minkowski space. The self-packing radiusρ(m,B) is the smallestt such thatt B can be packed withm translates of the interior ofB. Form≤6 we show that the self-packing radiusρ(m,B)=1+2/α(m,B) whereα(m,B) is the Minkowski length of the side of the largest equilateralm-gon inscribed inB (measured in the Minkowski metric determined byB). We showρ(6,B)=ρ(7,B)=3 for allB, and determine most of the largest and smallest values ofρ(m,B) form≤7. For allm we have

Simultaneous approximation in number fields

Summary We present here the solution of a problem of J.-J. Sansuc together with a natural generalization of it. This problem of Sansuc is, given a number fieldk, to find the smallest positive integerm for which there exists a finitely generated subgroup of rankm ofk ^x having a dense image in (R _Q k)^x under the canonical embedding. This integer is the number of archimedean places ofk plus one.Oblatum 28-I-1992This work was partially supported by NSERC and FCAR grants     

On nonnegatively curved 4-manifolds with discrete symmetry

Let M be the closed, simply connected, 4-manifold with nonnegative sectional curvature, called a nonnegatively curved 4-manifold, with an effective and isometric Z _m -action for a positive integer m ≧ 61⁷. Assume that Z _m acts trivially on the homology of M. The goal of this short paper is to prove that if the fixed point set of any nontrivial element of Z _m has at most one two-dimensional component, then M is homeomorphic to S ⁴, # _i ^l =1S ² × S ², l = 1, 2, or # _j ^k = 1 ± CP ², k = 1, 2, 3, 4, 5. The main strategy of this paper is to give an upper bound of the Euler characteristic χ(M) under the homological assumption of a Z _m -action as above by using the Lefschetz fixed point formula.     

A characterization ofC 1-convex sets in Sobolev spaces

In this paper we prove that, ifK is a closed subset ofW ₀ ^1,p (Ω,R ^m ) with 1<p<+∞ andm≥1, thenK is stable under convex combinations withC ¹ coefficients if and only if there exists a closed and convex valued multifunction from Ω toR ^m such that The casem=1 has already been studied by using truncation arguments which rely on the order structure ofR (see [2]). In the casem>1 a different approach is needed, and new techniques involving suitable Lipschitz projections onto convex sets are developed. Our results are used to prove the stability, with respect to the convergence in the sense of Mosco, of the class of convex sets of the form (*); this property may be useful in the study of the limit behaviour of a sequence of variational problems of obstacle type. This article was processed by the author using the Springer-Verlag TEX mamath macro package 1990     

Boundedness of Calderón-Zygmund operators in product Hardy spaces

By means of vector-valued product Calderón-Zygmund operators and some subtle estimates,the boundedness in product Hardy spaces on R^n × R^m of Calderón-Zygmund operators introduced by J.L. Journé is established.     

Separation by a codimension-1 map with a normal crossing point

Letf:M ^n–1N ⁿ be an immersion with normal crossings of a closed orientable (n–1)-manifold into an orientablen-manifold. We show, under a certain homological condition, that iff has a multiple point of multiplicitym, then the number of connected components ofN–f(M) is greater than or equal tom+1, generalizing results of Biasi and Romero Fuster (Illinois J. Math. 36 (1992), 500–504) and Biasi, Motta and Saeki (Topology Appl. 52 (1993), 81–87). In fact, this result holds more generally for every codimension-1 continuous map with a normal crossing point of multiplicitym. We also give various geometrical applications of this theorem, among which is an application to the topology of generic space curves.     

Young symmetrizers and additive theory

For λ partition of m and A finite nonempty subset of a field we define the set of λ-restricted sums of m-tuples of elements of A, ∧ ^m λA, and using Additive Number Theory results from [J.A. Dias da Silva and Y.O. Hamidoune (<citeref rid="bib7">1990</citeref>). A note on the minimal polynomial of the Kronecker sum of two linear operators. Linear Algebra Appl., 141, 283-287; J.A. Dias da Silva and Y.O. Hamidoune (<citeref rid="bib8">1994</citeref>). Cyclic spaces for Grassmann derivatives and additive theory. Bull. London Math. Soc., 26, 140-146] we obtain a lower bound for its cardinality. Next, using results and techniques from [J.A. Dias da Silva and Y.O. Hamidoune (<citeref rid="bib7">1990</citeref>). A note on the minimal polynomial of the Kronecker sum of two linear operators. Linear Algebra Appl., 141, 283-287; J.A. Dias da Silva and Y.O. Hamidoune (<citeref rid="bib8">1994</citeref>). Cyclic spaces for Grassmann derivatives and additive theory. Bull. London Math. Soc., 26, 140-146] we obtain lower bounds for the degrees of minimal polynomials of restrictions of derivations to ranges of Young symmetrizers and to the symmetry class of tensors V _λ, and we show that the lower bound for the cardinality of ∧ ^m λA can also be obtained from these lower bounds.     

The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items

The First-Fit-Decreasing (FFD) algorithm is one of the most famous and most studied methods for an approximative solution of the bin-packing problem. The question on the parametric behavior of the FFD heuristic for small items was raised in D. S. Johnson's thesis (1973, MIT, Cambridge, MA) and in E. G. Coffman et al. (1987, SIAM J. Comput.7, 1–17): what is the asymptotic worst-case ratio for FFD when restricted to lists with item sizes in the interval (0, α] for α ≤ . Let R^∞_FFD(α) denote the asymptotic worst-case ratio for these lists. In his thesis, Johnson gave the values of R^∞_FFD(α) for and he conjectured that

Full-size image

for all integers m ≥ 4. J. Csirik (1993, J. Algorithms15, 1–28) proved that, for all integers m ≥ 5, this conjecture is true when m is even. When m is odd, he further showed where G_m ≡ 1 + (m² + m − 1)/(m(m + 1)(m + 2)) = F_m + 1/(m(m + 1)(m + 2)). These results leave open the values of R^∞_FFD(α) for 0 < α < 1/5 that are not the reciprocals of integers. In this paper we resolve the remaining open cases.     

Expression for restricted partition function through Bernoulli polynomials

Explicit expressions for restricted partition function W(s,d ^m ) and its quasiperiodic components W _j (s,d ^m ) (called Sylvester waves) for a set of positive integers d ^m ={d ₁,d ₂,…,d _m } are derived. The formulas are represented in a form of a finite sum over Bernoulli polynomials of higher order with periodic coefficients.      

Commutativity of Rings with Constraints Involving a Subset

Suppose that R is an associative ring with identity 1, J(R) the Jacobson radical of R, and N(R) the set of nilpotent elements of R. Let m 1 be a fixed positive integer and R an m-torsion-free ring with identity 1. The main result of the present paper asserts that R is commutative if R satisfies both the conditions(i) [x ^m, y ^m] = 0 for all and(ii) [(xy) ^m + y ^m x ^m, x] = 0 = [(yx) ^m + x ^m y ^m, x], for all This result is also valid if (i) and (ii) are replaced by (i) [x ^m, y ^m] = 0 for all and (ii) [(xy) ^m + y ^m x ^m, x] = 0 = [(yx) ^m + x ^m y ^m, x] for all Other similar commutativity theorems are also discussed.     

Two composition methods for solving certain systems of linear equations

Summary This note is concerned with the following problem: Given a systemA·x=b of linear equations and knowing that certains of its subsystemsA ¹·x ¹=b ¹, ...,A ^m ·x ^m =b ^m can be solved uniquely what can be said about the regularity ofA and how to find the solutionx fromx ¹, ...,x ^m ? This question is of particular interest for establishing methods computing certain linear or quasilinear sequence transformations recursively [7, 13, 15].Work performed under NATO Research Grant 027-81     

A Family of Binary (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">m</Emphasis>,<Emphasis Type="Italic">s</Emphasis>)-Nets of Strength 5

(t,m,s)-Nets were defined by Niederreiter [Monatshefte fur Mathematik, Vol. 104 (1987) pp. 273–337], based on earlier work by Sobol’ [Zh. Vychisl Mat. i mat. Fiz, Vol. 7 (1967) pp. 784–802], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in combinatorial/coding theoretic terms a binary linear (m−k,m,s)₂-net is a family of ks vectors in F₂^m satisfying certain linear independence conditions (s is the length, m the dimension and k the strength: certain subsets of k vectors must be linearly independent). Helleseth et al. [5] recently constructed (2r−3,2r+2,2^r−1)₂-nets for every r. In this paper, we give a direct and elementary construction for (2r−3,2r+2,2^r+1)₂-nets based on a family of binary linear codes of minimum distance 6.Communicated by: T. Helleseth