On the simpleness of zeros of Stokes multipliers

The aim of this paper is to discuss the simpleness of zeros of Stokes multipliers associated with the differential equation -Φ^″(X)+W(X)Φ(X)=0, where W(X)=X^m+a₁X^m-1+?+a_m is a real monic polynomial. We show that, under a suitable hypothesis on the coefficients a_k, all the zeros of the Stokes multipliers are simple.     

On stronger conjectures that imply the Erd?s-Moser conjecture

The Erd?s-Moser conjecture states that the Diophantine equation Sk(m)=mk, where Sk(m)=k¹+k²+?+k(m−1), has no solution for positive integers k and m with k?2. We show that stronger conjectures about consecutive values of the function Sk, that seem to be more naturally, imply the Erd?s-Moser conjecture.     

Unextendible product bases and 1-factorization of complete graphs

Let f(k₁,…,k_m) be the minimal value of size of all possible unextendible product bases in the tensor product space . We have trivial lower bounds and upper bound k₁?k_m. Alon and Lovász determined all cases such that f(k₁,…,k_m)=n(k₁,…,k_m). In this paper we determine all cases such that f(k₁,…,k_m)=k₁?k_m by presenting a sharper upper bound. We also determine several cases such that f(k₁,…,k_m)=n(k₁,…,k_m)+1 by using a result on 1-factorization of complete graphs.     

Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank

Let M_m,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra with two elements. Let k be a positive integer such that 2?k?min(m,n). Let B(m,n,k) denote the subsemimodule of M_m,n(B) spanned by the set of all rank k matrices. We show that if T is a bijective linear mapping on B(m,n,k), then there exist permutation matrices P and Q such that T(A)=PAQ for all A∈B(m,n,k) or m=n and T(A)=PA^tQ for all A∈B(m,n,k). This result follows from a more general theorem we prove concerning the structure of linear mappings on B(m,n,k) that preserve both the weight of each matrix and rank one matrices of weight k². Here the weight of a Boolean matrix is the number of its nonzero entries.     

The pexiderized Go?a?b-Schinzel functional equation

Let X be a linear space over a commutative field K. We characterize a general solution f,g,h,k:X→K of the pexiderized Go?a?b-Schinzel equation f(x+g(x)y)=h(x)k(y), as well as real continuous solutions of the equation.     

An existence-convergence theorem for a class of iterative methods

LetM ₀, characterized byx _k+1=G ₀(x _k),k?0,x ₀ prescribed, be an iterative method for the solution of the operator equationF(x)=0, whereF:X → X is a given operator andX is a Banach space. Let ω:X → X be a given operator, and let the methodM _mbe characterized byx _x+1,m =G _m(x _k,m),k?0,x _0,m prescribed, where $$G_i (x) = G_0 (x) - \sum\limits_{j = 0}^{i - 1} { F'(\omega (x))^{ - 1} F(G_j (x)), i = 1, . . . ,m,} $$ in whichG ₀:X → X is a given operator andF′:X → L(X) is the Fréchet derivative ofF. Sufficient conditions for the existence of a solutionx* _m ofF(x)=0 to which the sequence (x _k,m) generated from methodM _mconverges are given, together with a rate-of-convergence estimate.     

An extremal problem on non-full colorable graphs

For a given graph G of order n, a k-L(2,1)-labelling is defined as a function f:V(G)→{0,1,2,…k} such that |f(u)-f(v)|?2 when d_G(u,v)=1 and |f(u)-f(v)|?1 when d_G(u,v)=2. The L(2,1)-labelling number of G, denoted by λ(G), is the smallest number k such that G has a k-L(2,1)-labelling. The hole index ρ(G) of G is the minimum number of integers not used in a λ(G)-L(2,1)-labelling of G. We say G is full-colorable if ρ(G)=0; otherwise, it will be called non-full colorable. In this paper, we consider the graphs with λ(G)=2m and ρ(G)=m, where m is a positive integer. Our main work generalized a result by Fishburn and Roberts [No-hole L(2,1)-colorings, Discrete Appl. Math. 130 (2003) 513-519].     

Mixing for positive operators in Banach lattices

In this paper we extend M. Lin's definition of mixing for positive contractions in L₁(X,Σ,m) with m(X)=1 to positive operators in Banach lattices with weak-order units, and we generalize Lin's Theorem 2.1 (Z. Wahrsch. Verw. Gebiete 19 (1971) 231-249) to the case of power-bounded positive operators in KB-spaces. In the particular case of weakly compact power-bounded positive operators, the same theorem is extended to Banach lattices with order-continuous norms.     

Blocker sets, orthogonal arrays and their application to combination locks

Let A denote a set of order m and let X be a subset of A^k+1. Then X will be called a blocker (of A^k+1) if for any element say (a₁,a₂,…,a_k,a_k+1) of A^k+1, there is some element (x₁,x₂,…,x_k,x_k+1) of X such that x_i equals a_i for at least two i. The smallest size of a blocker set X will be denoted by α(m,k)and the corresponding blocker set will be called a minimal blocker. Honsberger (who credits Schellenberg for the result) essentially proved that α(2n,2) equals 2n² for all n. Using orthogonal arrays, we obtain precise numbers α(m,k) (and lower bounds in other cases) for a large number of values of both k and m. The case k=2 that is three coordinate places (and small m) corresponds to the usual combination lock. Supposing that we have a defective combination lock with k+1 coordinate places that would open if any two coordinates are correct, the numbers α(m,k) obtained here give the smallest number of attempts that will have to be made to ensure that the lock can be opened. It is quite obvious that a trivial upper bound for α(m,k) is m² since allowing the first two coordinates to take all the possible values in A will certainly obtain a blocker set. The results in this paper essentially prove that α(m,k) is no more than about m²/k in many cases and that the upper bound cannot be improved. The paper also obtains precise values of α(m,k) whenever suitable orthogonal arrays of strength two (that is, mutually orthogonal Latin squares) exist.     

On the average number of records for sequences of not identically distributed random variables

The scheme of n series of independent random variables X ₁₁, X ₂₁, …, X _k1, X ₁₂, X ₂₂, …, X _k2, …, X _1n , X _2n , …, X _kn is considered. Each of these successive series X _1m , X _2m , …, X _km , m = 1, 2, …, n consists of k variables with continuous distribution functions F ₁, F ₂, …, F _k , which are the same for all series. Let N(nk) be the number of upper records of the given nk random variables, and EN(nk) be the corresponding expected value. For EN(nk) exact upper and lower estimates are obtained. Examples are given of the sets of distribution functions for which these estimates are attained.     

On additive polynomials and certain maximal curves

We show that a maximal curve over F_q² given by an equation A(X)=F(Y), where A(X)∈F_q²[X] is additive and separable and where F(Y)∈F_q²[Y] has degree m prime to the characteristic p, is such that all roots of A(X) belong to F_q². In the particular case where F(Y)=Y^m, we show that the degree m is a divisor of q+1.     

Forbidden (0,1)-Vectors in Hyperplanes of ℝ n : The Restricted Case

In this paper we continue our investigation on “Extremal problems under dimension constraint” introduced in [2]. Let E(n, k) be the set of (0,1)-vectors in ? ⁿ with k one's. Given 1 ≤ m, w ≤ n let X ? E(n, m) satisfy span (X) ∩ E(n, w) = ?. How big can |X| be? This is the main problem studied in this paper. We solve this problem for all parameters 1 ≤ m, w ≤ n and n > n ₀(m, w).     

Lelek maps and n-dimensional maps from compacta to polyhedra

For a natural number m?0, a map from a compactum X to a metric space Y is an m-dimensional Lelek map if the union of all non-trivial continua contained in the fibers of f is of dimension ?m. In [M. Levin, Certain finite-dimensional maps and their application to hyperspaces, Israel J. Math. 105 (1998) 257-262], Levin proved that in the space C(X,I) of all maps of an n-dimensional compactum X to the unit interval I=[0,1], almost all maps are (n−1)-dimensional Lelek maps. Moreover, he showed that in the space C(X,Ik) of all maps of an n-dimensional compactum X to the k-dimensional cube Ik (k?1), almost all maps are (n−k)-dimensional Lelek maps. In this paper, we generalize Levin's result. For any (separable) metric space Y, we define the piecewise embedding dimension ped(Y) of Y and we prove that in the space C(X,Y) of all maps of an n-dimensional compactum X to a complete metric ANR Y, almost all maps are (n−k)-dimensional Lelek maps, where k=ped(Y). As a corollary, we prove that in the space C(X,Y) of all maps of an n-dimensional compactum X to a Peano curve Y, almost all maps are (n−1)-dimensional Lelek maps and in the space C(X,M) of all maps of an n-dimensional compactum X to a k-dimensional Menger manifold M, almost all maps are (n−k)-dimensional Lelek maps. It is known that k-dimensional Lelek maps are k-dimensional maps for k?0.     

Realizing cohomology classes as Euler classes

For a space X, let E _k (X), E _k ^s (X) and E _k ^?? (X) denote respectively the set of Euler classes of oriented k-plane bundles over X, the set of Euler classes of stably trivial k-plane bundles over X and the spherical classes in H ^k (X; ?). We prove some general facts about the sets E _k (X), E _k ^s (X) and E _k ^?? (X). We also compute these sets in the cases where X is a projective space, the Dold manifold P(m, 1) and obtain partial computations in the case that X is a product of spheres.     

On three-designs of small order

For positive integers t?k?v and λ we define a t-design, denoted B_i[k,λ;v], to be a pair (X,B) where X is a set of points and B is a family, (B_i:i?I), of subsets of X, called blocks, which satisfy the following conditions: (i) |X|=v, the order of the design, (ii) |B_i|=k for each i?I, and (iii) every t-subset of X is contained in precisely λ blocks. The purpose of this paper is to investigate the existence of 3-designs with 3?k?v?32 and λ>0.Wilson has shown that there exists a constant N(t, k, v) such that designs B_t[k,λ;v] exist provided λ>N(t,k,v) and λ satisfies the trivial necessary conditions. We show that N(3,k,v)=0 for most of the cases under consideration and we give a numerical upper bound on N(3, k, v) for all 3?k?v?32. We give explicit constructions for all the designs needed.     

A conjecture of Palamodov about the functors Ext in the category of locally convex spaces

In 1971 Palamodov proved that in the category of locally convex spaces the derived functors Ext^k(E,X) of Hom(E,·) all vanish if E is a (DF)-space, X is a Fréchet space, and one of them is nuclear. He conjectured a “dual result”, namely that Ext^k(E,X)=0 for all if E is a metrizable locally convex space, X is a complete (DF)-space, and one of them is nuclear. Assuming the continuum hypothesis we give a complete answer to this conjecture: If X is an infinite-dimensional nuclear (DF)-space, then

(1)

There is a normed space E such that Ext¹(E,X)≠0.

(2)

where is a countable product of lines.

(3)

Ext^k(E,X)=0 for all k?3 and all locally convex spaces E.

     

Galois closure of essentially finite morphisms

Let X be a reduced connected k-scheme pointed at a rational point x∈X(k). By using tannakian techniques we construct the Galois closure of an essentially finite k-morphism f:Y→X satisfying the condition H⁰(Y,O_Y)=k; this Galois closure is a torsor dominating f by an X-morphism and universal for this property. Moreover, we show that is a torsor under some finite group scheme we describe. Furthermore we prove that the direct image of an essentially finite vector bundle over Y is still an essentially finite vector bundle over X. We develop for torsors and essentially finite morphisms a Galois correspondence similar to the usual one. As an application we show that for any pointed torsor f:Y→X under a finite group scheme satisfying the condition H⁰(Y,O_Y)=k, Y has a fundamental group scheme π₁(Y,y) fitting in a short exact sequence with π₁(X,x).     

Higher-order recurrences for Bernoulli numbers

Euler's well-known nonlinear relation for Bernoulli numbers, which can be written in symbolic notation as n(B₀+B₀)=−nBn−1−(n−1)Bn, is extended to n(Bk₁+?+Bkm) for m?2 and arbitrary fixed integers k₁,…,km?0. In the general case we prove an existence theorem for Euler-type formulas, and for m=3 we obtain explicit expressions. This extends the authors' previous work for m=2.     

On Fox?s m-dimensional category and theorems of Bochner type

We show that catm(X)=cat(jm), where catm(X) is Fox?s m-dimensional category, jm:X→X[m] is the mth Postnikov section of X and cat(X) is the Lusternik-Schnirelmann category of X. This characterization is used to give new “Bochner-type” bounds on the rank of the Gottlieb group and the first Betti number for manifolds of non-negative Ricci curvature. Finally, we apply these methods to obtain Bochner-type theorems for manifolds of almost non-negative sectional curvature.     

A continuum with no prime shape factors

As the main result of this paper, we prove that there exists a continuum with non-trivial shape without any prime factor. This answers a question of K. Borsuk [K. Borsuk, Concerning the notion of the shape of compacta, in: Proc. Internat. Symposium on Topology and Its Applications, Herceg-Novi, 1968, pp. 98-104]. We also show that for each integer n?3 there exists a continuum X such that Sh(X,x)=Shn(X,x), but Sh(X,x)≠Shn−1(X,x). Therefore we obtain the negative answer to another question of K. Borsuk [K. Borsuk, Some remarks concerning the shape of pointed compacta, Fund. Math. 67 (1970) 221-240]: Does Sh(X,x)=Shn(X,x), for a compactum X and some integer n?3, implie that Sh(X,x)=Sh²(X,x)?