On eigenfunctions of nonlinear heat generation

Summary We consider the equation u+ expu=0, >0,u(boundary)0 in the formv= exp (K,v), whereK ^–1=–. We give bounds on for the latter equation to be solvable by the contraction mapping principle, and estimate theL ² norm of the solution so obtained. We also give a bound on for the topological index of the solution to be non-zero and apply Krasnoselskii's results to the least squares method of approximating the solution.

---

Sommario Consideriamo l'equazione u+ expu=0, >0,u(frontiera)=0 nella formav= exp (Kv), doveK ^–1=–. In questo lavoro diamo limitazioni per per cui la seconda equazione e risolubile col metodo delle contrazioni, e diamo una stima della norma inL ² della soluzione cosi ottenuta. Diamo anche una limitazione per per cui l'indice topologico della soluzione diventa non zero, e applichiamo i risultati di Krasnoselskii al metodo dei minimi quadrati per approssimare la soluzione.

     

Quasi-symmetric 3-designs with triangle-free graph

The following result is proved: Let D be a quasi-symmetric 3-design with intersection numbers x, y(0x<y<k). D has no three distinct blocks such that any two of them intersect in x points if and only if D is a Hadamard 3-design, or D has a parameter set (v, k, ) where v=(+2)(²+4+2)+1, k=²+3+2 and =1,2,..., or D is a complement of one of these designs.     

Algebraic systems of quadratic forms of number fields and function fields

In this paper we examine for which Witt classes ,..., _n over a number field or a function fieldF there exist a finite extensionL/F and ₂,..., _n L^* such thatT _L/F ()=1 andTr _L/F (_i)=_i fori=2,...n.     

A Proof of the Jungnickel-Tonchev Conjecture on Quasi-Multiple Quasi-Symmetric Designs

A proof of the following conjecture of Jungnickel and Tonchev on quasi-multiple quasi-symmetric designs is given: Let D be a design whose parameter set (v,b,r,k,) equals (v,sv,sk,k, s) for some positive integer s and for some integers v,k, that satisfy (v-1) = k(k-1) (that is, these integers satisfy the parametric feasibility conditions for a symmetric (v,k,)-design). Further assume that D is a quasi-symmetric design, that is D has at most two block intersection numbers. If (k, (s-1)) = 1, then the only way D can be constructed is by taking multiple copies of a symmetric (v,k, )-design.     

Sensitivity analysis of the greatest eigenvalue of a symmetric matrix via the ɛ-subdifferential of the associated convex quadratic form

LetA(·) be ann × n symmetric affine matrix-valued function of a parameteruR ^m , and let (u) be the greatest eigenvalue ofA(u). Recently, there has been interest in calculating (u), the subdifferential of atu, which is useful for both the construction of efficient algorithms for the minimization of (u) and the sensitivity analysis of (u), namely, the perturbation theory of (u). In this paper, more generally, we investigate the Legendre-Fenchel conjugate function of (·) and the -subdifferential (u) of atu. Then, we discuss relations between the set (u) and some perturbation bounds for (u).The author is deeply indebted to Professor J. B. Hiriart-Urruty who suggested this study and provided helpful advice and constant encouragement. The author also thanks the referees and the editors for their substantial help in the improvement of this paper.     

A Note on Common Zeroes of Laplace–Beltrami Eigenfunctions

Let u+u=v+v= 0, where isthe Laplace–Beltrami operator on a compact connected smoothmanifold M and > 0. If H ¹(M) = 0then there exists pM such that u(p)=v(p) = 0 For homogeneous M,H ¹(M) 0 implies the existence of a pair u,v as above that has no common zero.     

Regularity of ∫Ω|∇u|2 + λ∫Ω|u−f{2 and some gap phenomenon

We study the regularity of the minimizer u for the functional F (u,f)=|u|² + |u–f{² over all maps uH ¹(, S ²). We prove that for some suitable functions f every minimizer u is smooth in if ₀ and for the same functions f, u has singularities when is large enough.

---

Résumé On étudie la régularité des minimiseurs u du problème de minimisation min_ueH ¹(,S²)(|u|² + |u–f{². On montre que pour certaines fonctions f, u est régulière lorsque ₀ et pour les mêmes f, si est assez grand, alors u possède des singularités.

     

A nonlinear equation for linear programming

We present a characterization of the normal optimal solution of the linear program given in canonical form max{c ^tx: Ax = b, x 0}. (P) We show thatx ^* is the optimal solution of (P), of minimal norm, if and only if there exists anR > 0 such that, for eachr R, we havex ^* = (rc – A^t_r)₊. Thus, we can findx ^* by solving the following equation for _r A(rc – A^t_r)₊ = b. Moreover,(1/r) _r then converges to a solution of the dual program.On leave from The University of Alberta, Edmonton, Canada. Research partially supported by the National Science and Engineering Research Council of Canada.     

Reflecting stationary sets and successors of singular cardinals

REF is the statement that every stationary subset of a cardinal reflects, unless it fails to do so for a trivial reason. The main theorem, presented in Sect. 0, is that under suitable assumptions it is consistent that REF and there is a which is ⁺ⁿ -supercompact. The main concepts defined in Sect. 1 are PT, which is a certain statement about the existence of transversals, and the bad stationary set. It is shown that supercompactness (and even the failure of PT) implies the existence of non-reflecting stationary sets. E.g., if REF then for many PT(, ₁). In Sect. 2 it is shown that Easton-support iteration of suitable Levy collapses yield a universe with REF if for every singular which is a limit of supercompacts the bad stationary set concentrates on the right cofinalities. In Sect. 3 the use of oracle c.c. (and oracle proper—see [Sh-b, Chap. IV] and [Sh 100, Sect. 4]) is adapted to replacing the diamond by the Laver diamond. Using this, a universe as needed in Sect. 2 is forced, where one starts, and ends, with a universe with a proper class of supercompacts. In Sect. 4 bad sets are handled in ZFC. For a regular {<⁺ : cf<} is good. It is proved in ZFC that if=cf>₁ then {<⁺ : cf<} is the union of sets on which there are squares.     

The Real Period Function of A3 Singularity and Perturbations of the Spherical Pendulum

We prove that the Hessian matrix of the real period function () associated with the real versal deformation f (x)=±x ⁴+₂ x ²+₁ x+₀ of a singularity of type A ₃, is nondegenerate, provided that ³ does not belong to the discriminant set of the singularity. We explain the relation between this result and the perturbations of the spherical pendulum.     

Problème aux limites non-linéairey″ + λ2 f(y)=0:existence d'une solution et bornes pour λ2 (évaluations de la valeur critique)

Summary Le problème aux limites non-linéaire (1.1) possède une (ou plusieurs) solution seulement si < ^* = valeur critique. On donne dans cet article des bornes inférieures et supérieures de ^*. Pour certainsf, on détermine exactement ^*.Summary The nonlinear boundary value problem (1.1) possess one (or more) solution only if < ^* = critical value. We give in this paper lower and upper bounds of ^*. For somef, we determine ^* exactly.     

Asymptotics for the wiener sausage with drift

Summary A particle is considered which moves in ^d according to a Brownian motion with drifth0. The space is assumed to contain random traps. The probability of survival of the particle up to timeT decays exponentially asT with a positive decay rate . is shown to be a non-analytic function of |h|. For small |h| the decay rate is given by (h)=1/2|h|²; but if |h| exceeds a certain critical value, (h) depends also on the parameters describing trapping. Upper and lower bounds for (h) are given, which imply the asymptotic linearity of (h) for large |h|. The critical point marks a transition from localized to delocalized behavior. A variational formula for the decay rate is given on the level of generalized processes, which elucidates the mathematical mechanism behind observations made earlier by Grassberger and Procaccia on the basis of computer simulations.Supported by Deutsche Forschungsgemeinschaft     

A Remark on Real Parameter Global Bifurcation

We study the nonlinear eigenvalue problem F(x,) = L()x +R(x,) = 0 where F : X × R X with X a Hilbert space. IfL() is a polynomial in , then it is shown that 0> 0 is a global bifurcation point of the eigenvalue problem provided astandard transversality condition is satisfied, the dimension of the nullspace of L(0) is an odd number and L() is composed of asequence of positive operators on the finite dimensional null space ofL(0).     

A sandwich theorem and Hyers—Ulam stability of affine functions

It is shown that two real functionsf andg, defined on a real intervalI, satisfy the inequalitiesf(x + (1 – )y) g(x) + (1 – )g(y) andg(x + (1 – )y) f(x) + (1 – )f(y) for allx, y I and [0, 1], iff there exists an affine functionh: I such thatf h g. As a consequence we obtain a stability result of Hyers—Ulam type for affine functions.     

Eigenvalues of convex processes and convergence properties of differential inclusions

In this paper, we study (real) eigenvalues and eigenvectors of convex processes, and provide conditions for the existence of eigenvectors in a given convex coneK ⁿ . It is established that the maximal eigenvalue ofG(·) inK is expressed by (whereK ⁰ is the polar cone ofK) provided that the minimum is attained in intK ⁰. This result is applied to study the asymptotic behaviour of certain differential inclusions{G(x(t)). We extend some known results for the von Neumann-Gale model to our more general framework. We prove that ifx ₀ is the unique eigenvector corresponding to the maximal eigenvalue ₀ ofG(·) inK, then the nonexistence of solutions of a certain special trigonometric form is necessary and sufficient for every viable solutionx(·) to satisfy^- ₀ ^t x(t)cx ₀ ast for somec0. Our method is to study the family of convex conesW =cl{v–x :xK,vG(x) where is any real number. We characterize the maximal eigenvalue ₀ as the minimal for whichW can be separated fromK.The research was supported in part by a grant from the ministry of science and the Maagara special project for the absorption of new immigrants in the Department of Mathematics at Technion.     

Most block-transitivet-designs are point-primitive

We prove that, in at-(v,k,) design with 2tk, a block-transitive automorphism group is point-primitive as soon asv>(( _k ² )–1)².     

On certain indestructibility of strong cardinals and a question of Hajnal

A model in which strongness of is indestructible under ⁺ -weakly closed forcing notions satisfying the Prikry condition is constructed. This is applied to solve a question of Hajnal on the number of elements of { |2 <}.     

Building Symmetric Designs With Building Sets

We introduce a uniform technique for constructing a family of symmetric designs with parameters (v(q ^m+1-1)/(q-1), kq ^m ,q ^m), where m is any positive integer, (v, k, ) are parameters of an abelian difference set, and q = k ²/(k - ) is a prime power. We utilize the Davis and Jedwab approach to constructing difference sets to show that our construction works whenever (v, k, ) are parameters of a McFarland difference set or its complement, a Spence difference set or its complement, a Davis–Jedwab difference set or its complement, or a Hadamard difference set of order 9 · 4 ^d , thus obtaining seven infinite families of symmetric designs.     

Geometrical Characterization of Strict Suns in ℓ∞(n)

A subset M of a normed linear space X is called a strict sun if, for any x X\M, the set of its nearest points from M is nonempty and for any point y M which is nearest to x, the point y is a nearest point from M to any point of the ray {x + (1 - )y | > 0\}. We give an intrinsic geometrical characterization of strict suns in the space (n).     

A technique for constructing divisible difference sets

An (m, n, k, ₁,₂) divisible difference set in a groupG of ordermn relative to a subgroupN of ordern is ak-subsetD ofG such that the list {xy^–1:x, y D} contains exactly ₁ copies of each nonidentity element ofN and exactly ₂ copies of each element ofG N. It is called semi-regular ifk > ₁ and k²=mn₂. We develop a method for constructing a divisible difference set as a product of a difference set and a relative difference set or a difference set and a subset ofG which we call a relative divisible difference set. The method results in several parametrically new families of semi-regular divisible difference sets.