The existence of some resolvable block designs with divisibility into groups

This paper proves the existence of resolvable block designs with divisibility into groups GD(v; k, m; ₁, ₂) without repeated blocks and with arbitrary parameters such that ₁ = k, (v–1)/(k–1) ₂ v^k–2 (and also ₁ k/2, (v–1)/(2(k–1)) ₂ v^k–2 in case k is even) k 4 andp=1 (mod k–1), k < p for each prime divisor p of number v. As a corollary, the existence of a resolvable BIB-design (v, k, ) without repeated blocks is deduced with X = k (and also with = k/2 in case of even k) k , where a is a natural number if k is a prime power and=1 if k is a composite number.Translated from Matematicheskie Zametki, Vol. 19, No. 4, pp. 623–634, April, 1976.     

Some imbedding theorems for block designs balanced with respect to pairs

We prove imbedding theorems for block designs balanced with respect to pairs, and with the aid of these theorems we establish the existence of (v, k, )-resolvable BIB block designs with parameters v, k, such that =k–1 [and also such that =(k–l)/2 if k is odd], k ¦(p–1) for each prime divisor p of the number v/k; we also establish an imbedding theorem for Kirkman triple systems.Translated from Matematicheskie Zametki, Vol. 16, No. 1, pp. 173–184, July, 1974.     

Estimates of Entire Functions of Exponential Type Less than π in Terms of Logarithmic Sums over Real Duffin and Schaeffer Sequences

We give uniform estimates of entire functions of exponential type less than having sufficiently small logarithmic sums over real sequences { _n } satisfying | _n –n|L and _n+1– _n for fixed positive constants L and . We thereby generalize results about logarithmic sums over the set of integers and so-called relatively h-dense sequences.     

Minimal coverings and maximal packings of (k−1)-subsets by k-subsets

This paper studies the asymptotic behavior of functions M(n, k, k–1, ) and m(n, k, k–1, ), equal to the respective cardinalities of the minimal -covering and maximal -packing of all (k–1)-subsets of the n-element set of its k-subsets. It is shown that, if sequence k=k(n) is such that k(n)/n 0 as then m(n, k, k–1, ).( _k–1 ⁿ ).k¹, and if as n , thenM(n,k,k–1,).( _k–1 ⁿ ).k^–1. A consequence of these results is the validity of the Erdös-Hanani conjecture concerning the asymptotic behavior of functions M(n, k, k–1, 1) and m(n, k, k–1, 1).Translated from Matematicheskie Zametki, Vol. 21, No. 4, pp. 565–571, April, 1977.In conclusion, the author wishes to thank A. A. Sapozhenko under whose direction the present work was achieved.     

Excesses of systems of exponential functions

Conditions on the closeness of real sequences {_n} and {_n} are studied which imply the equality of the excesses of the systems {exp(i_nx)} and {exp(i_nx)} in the space L²(–a, a). A theorem is formulated in terms of the difference of the sequences {_n} and {_n} enumerating the functions. In the corollaries of the theorem, conditions are given in terms of the behavior of the difference _n–_n0. An example is constructed showing that the condition _n–_n0 alone is not sufficient for equality of the excesses.Translated from Matematicheskie Zametki, Vol. 22, No. 6, pp. 803–814, December, 1977.     

A conditional dilatation equation

Summary The following theorem holds true. Theorem. Let X be a normed real vector space of dimension 3 and let k > 0 be a fixed real number. Suppose that f: X X and g: X × X are functions satisfying x – y = k f(x) – f(y) = g(x, y)(x – y) for all x, y X. Then there exist elements and t X such that f(x) = x + t for all x X and such that g(x, y) = for all x, y X with x – y = k.     

A Recursive Construction for 2-Designs

This paper contains two main results: given a symmetric (v, k, ) design, D, and a resolvable design which has the parameters of a residual design of D, there exists a symmetric (dv + 1, v, k) design, where d = (v - k)/(k - ), and d is a prime power; given a symmetric (v, k, ) design, D, and a resolvable design with the parameters of a derived design of D, there exists a 2 - (ek + v, 2k, k) design, where e = k/,and e is a prime power.     

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.

     

On the Multiplicity of Eigenvalues of the Laplacian on Surfaces

We show that the multiplicity of the eigenvalues of the Laplace Beltrami operator on compact Riemannian surfaces with genus zero is bounded by m(k) 2k – 3 for k 3. Here we label the eigenvalues in the following way: 0 = 1 < 2 3 . . ..     

Commutator Subgroups of the Extended Hecke Groups \bar H(\lambda _q )

Hecke groups H(_q) are the discrete subgroups of generated by S(z) = –(z+ _q)^–1and T(z) = –1/z. The commutator subgroup of H(_q), denoted by H(_q), is studied in [2]. It was shown that H(_q) is a free group of rank q– 1.Here the extended Hecke groups obtained by adjoining to the generators of H(_q) are considered. The commutator subgroup of is shown to be a free product of two finite cyclic groups. Also it is interesting to note that while in the H(_q) case, the index of H(_q) is changed by q, in the case of this number is either 4 for qodd or 8 for qeven.     

On a problem of B. I. Golubov

. . . : s_n(x) — , _n-(, 1)- n L ². , . , : a _k l ² _n () [0,1] , (*) , (**) . a _k l ² u _n () [0,1] , (**), (*) .     

Analysis of a class of fractional programming problems

We propose a solution strategy for fractional programming problems of the form max _xx g(x)/ (u(x)), where the function satisfies certain convexity conditions. It is shown that subject to these conditions optimal solutions to this problem can be obtained from the solution of the problem max _xx g(x) + u(x), where is an exogenous parameter. The proposed strategy combines fractional programming andc-programming techniques. A maximal mean-standard deviation ratio problem is solved to illustrate the strategy in action.     

Untere und obere Schranken für den tiefsten Eigenwert der elastisch gestützten Membran

Zusammenfassung Es werden untere und obere Schranken für den tiefsten Eigenwert ₁() der elastisch gestützten schwingenden Membran hergeleitet. Die elastische Bindung der Membran am Rande wird durch charakterisiert, und wird als Parameter betrachtet.Die Verwendung des klassischen Rayleigh-Prinzipes liefert obere Schranken, mit Hilfe eines konvexen FunktionalsJ() erhält man obere und untere Schranken. Eine Zerlegungsmethode endlich gibt eine untere Schranke für ₁().

---

Summary This article is concerned with the determination of upper and lower bounds for the lowest eigenvalue ₁() of the elastically supported vibrating membrane. The elastic support on the boundary is characterized by which is regarded as a parameter.The classical Rayleigh-Principle gives upper bounds. The use of a convex functionalJ() yields upper and lower bounds for ₁(). A method of decomposition leads to a lower bound for ₁().

---

---

Neu-Technikum, Buchs SG     

The Spectral Function and Principal Eigenvalues for Schrödinger Operators

Let m , 0 m₊ in Kato's class. We investigate the spectral function s( + m) where s( + m) denotes the upper bound of the spectrum of the Schrödinger operator + m. In particular, we determine its derivative at 0. If m_- is sufficiently large, we show that there exists a unique ₁ > 0 such that s( + ₁m) = 0. Under suitable conditions on m⁺ it follows that 0 is an eigenvalue of + ₁m with positive eigenfunction.     

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.

     

On the positive solutions of some nonlinear diffusion problems

We consider the nonlinear diffusion equationu _t –a(x, u _{x x} )+b(x, u)=g(x, u) with initial boundary conditions andu(t, 0)=u(t, 1)=0. Here,a, b, andg denote some real functions which are monotonically increasing with respect to the second variable. Then, the corresponding stationary problem has a positive solution if and only if(0, ^*) or(0, ^*]. The endpoint ^* can be estimated by , where ₁ u denotes the first eigenvalue of the stationary problem linearized at the pointu. The minimal positive steady state solutions are stable with respect to the nonlinear parabolic equation.

---

Zusammenfassung Wir betrachten die nichtlineare Diffusionsgleichungu _t –a(x, u _x ) _x +b(x, u)=g(x, u) mit Randbedingungen undu (t, 0)=u (t, 1)=0. Dabei sinda, b, undg monoton wachsende Funktionen bzgl. des zweiten Argumentes. Das zugehörige stationäre Problem hat genau dann eine positive Lösung, falls (0, ^*) oder(0, ^*]. Der Endpunkt ^* kann durch abgeschätzt werden, wobei ₁ u den ersten Eigenwert des an der Stelleu linearisierten stationären Problems bezeichnet. Die minimale positive stationäre Lösung ist stabil bzgl. der obigen nichtlinearen parabolischen Gleichung.

     

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.     

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.     

Spectral parameter asymptotics of the Weyl solutions of Sturm-Liouville equations

In the paper one investigates the dependence of Weyl's solution ,)=c(,)+n()s(,) of the Sturm-Liouville equation y+q()y=²y on the spectral parameter . Under the condition that the potential q is bounded from below and q()exp(c₀+c[in1 ¦¦), it is proved for {ie217-01} for any positive values and A. If q()>1 and {ie217-02} for all >0, then in the semiplane >0 the Weyl solution (, ) is obtained from the Weyl solution (,x) is obtained from the Weyl solution e^ix with zero potential, with the aid of a generalization of B. Ya Levin's transformation operators.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 170, pp. 184–206, 1989.I express my sincere gratitude to L. A. Pastur and I. V. Ostrovskii for valuable advice and discussions.     

The Padé-Rayleigh-Ritz method for solving large hermitian eigenproblems

We make use of the Padé approximants and the Krylov sequencex, Ax,,...,A ^m–1 x in the projection methods to compute a few Ritz values of a large hermitian matrixA of ordern. This process consists in approaching the poles ofR _x()=((I–A)^–1 x,x), the mean value of the resolvant ofA, by those of [m–1/m]_Rx(), where [m–1/m]_Rx() is the Padé approximant of orderm of the functionR _x(). This is equivalent to approaching some eigenvalues ofA by the roots of the polynomial of degreem of the denominator of [m–1/m]_Rx(). This projection method, called the Padé-Rayleigh-Ritz (PRR) method, provides a simple way to determine the minimum polynomial ofx in the Krylov subspace methods for the symmetrical case. The numerical stability of the PRR method can be ensured if the projection subspacem is sufficiently small. The mainly expensive portion of this method is its projection phase, which is composed of the matrix-vector multiplications and, consequently, is well suited for parallel computing. This is also true when the matrices are sparse, as recently demonstrated, especially on massively parallel machines. This paper points out a relationship between the PRR and Lanczos methods and presents a theoretical comparison between them with regard to stability and parallelism. We then try to justify the use of this method under some assumptions.