Positive Solutions for a Singular Nonlinear Problem on a Bounded Domain in R 2

For a bounded regular Jordan domain in R ², we introduce and study a new class of functions K() related on its Green function G. We exploit the properties of this class to prove the existence and the uniqueness of a positive solution for the singular nonlinear elliptic equation u+(x,u)=0, in D(), with u=0 on and uC(), where is a nonnegative Borel measurable function in ×(0,) that belongs to a convex cone which contains, in particular, all functions (x,t)=q(x)t ^–,>0 with nonnegative functions qK(). Some estimates on the solution are also given.     

Some functional inequalities and their Baire category properties

Summary In the paper we consider, from a topological point of view, the set of all continuous functionsf:I I for which the unique continuous solution:I – [0, ) of(f(x)) (x, (x)) and(x, (x)) (f(x)) (x, (x)), respectively, is the zero function. We obtain also some corollaries on the qualitative theory of the functional equation(f(x)) = g(x, (x)). No assumption on the iterative behaviour off is imposed.     

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

Upper bounds of best one-sided approximations of the classes WrLΨ in the metric of L

The lowest upper bound is obtained for best one-sided approximations of classes (r=1,2 ...) by trigonometric polynomials and splines of minimum deficiency with equidistant knots, in the metric of space L, where W^rL={f:f(x+2)=f(x), f^(r–1)(x) is absolutely continuous, f ^(r)L 1} and L is an Orlicz space.Translated from Matematicheskie Zametki, Vol. 22, No. 2, pp. 257–267, August, 1977.     

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.     

Automorphisms on a Lie group contracting modulo a compact subgroup and applications to semistable convolution semigroups

Let ( _t ) _t0 be a -semistable convolution semigroup of probability measures on a Lie groupG whose idempotent ₀ is the Haar measure on some compact subgroupK. Then all the measures ₁ are supported by theK-contraction groupC _K() of the topological automorphism ofG. We prove here the structure theoremC _K()=C()K, whereC() is the contraction group of . Then it turns out that it is sufficient to study semistable convolution semigroups on simply connected nilpotent Lie groups that have Lie algebras with a positive graduation.     

On the positive definiteness of n ↦ epnα for α close to 2

For >2, let Q ⁺() be the infimum of those q>0 for which the function n e^pn is positive definite on N ₀ for every pq. We shall prove that Q ⁺()0 as 2.     

The Selberg trace formula for SL(3,Z)

In this article the first step toward the generalization of the Selberg trace formula to the case of a rank 2 symmetric space S and a discrete group for which the fundamental region \S goes to infinity nontrivially appears. For S we use the space SL(3,)/SO(3) and for we use SL(3,). The fundamental results are Theorems 9 and 10, in which is calculated the contribution to the matrix trace of the operator K which appears in the right side of the trace formula of the expression h()d^c(), where ^c() is the continuous part of the spectral measure of the quasiregular representation on the space IL₂(\S).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 63, pp. 8–66, 1976.     

The expected values of invariant polynomials with matrix argument of elliptical distributions

ThisresearchissupportedbytheChineseAcademyofSciences.1.IntroductionTherearemailypublicatiollsonmatrixvariatedistributions(ormatrixdistributionforsimplicity),inparticular,abollttheirexpectedvaluesofzonalpolynomialsoftheirquadraticforms(of.[12],[151,[171and…     

The random-cluster model on the complete graph

Summary The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, and Potts models of statistical physics. When the underlying graph is the complete graph onn vertices, then the associated processes are called mean-field. In this study of the mean-field random-cluster model with parametersp=/n andq, we show that its properties for any value ofq(0, ) may be derived from those of an Erds-Rényi random graph. In this way we calculate the critical point _c (q) of the model, and show that the associated phase transition is continuous if and only ifq2. Exact formulae are given for _C (q), the density of the largest component, the density of edges of the model, and the free energy. This work generalizes earlier results valid for the Potts model, whereq is an integer satisfyingq2. Equivalent results are obtained for a fixed edge-number random-cluster model. As a consequence of the results of this paper, one obtains large-deviation theorems for the number of components in the classical random-graph models (whereq=1).     

On (k,n)-blocking sets which can be obtained as a union of conics

A family of conics in PG(2,q) is called saturated if any line LPG(2,q) is incident with at least one conic of the family. Then, if <(q+1)/2, the support of is a (k,n)-blocking set. It is shown that in this way one can get blocking sets whose character n is small compared to q; it is also shown that cannot be taken independent of q, but must necessarily increase as q does.     

On Ω-closed sets and Ωs-closed sets in topological spaces

Summary New classes of sets called -closed sets and s-closed sets are introduced and studied. Also, we introduce and study -continuous functions and s-continuous functions and prove pasting lemma for these functions. Moreover, we introduce classes of topological spaces -T_1/2 and -T_s.     

DLR measures for one-dimensional harmonic systems

Summary A one-dimensional chain of nearest neighbor linearly interacting oscillators {q _x } _x is studied. The set of all its extremal DLR measures is characterized in terms of a parameter ². For each there is a Gaussian DLR measure with support on the set of configurations determined by the rate of growth of¦q _x¦. It is then finally proved that there is only one translationally invariant DLR measure. This proves the following conjecture: invariant DLR measures give uniformly finite first moment to ¦q _x¦.     

The Higher K-Theory of Real Curves

If X is a smooth curve defined over the real numbers , we show that K _n (X) is the sum of a divisible group and a finite elementary Abelian 2-group when n 2. We determine the torsion subgroup of K _n (X), which is a finite sum of copies of and 2, only depending on the topological invariants of X() and X(), and show that (for n 2) these torsion subgroups are periodic of order 8.     

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 the equation of similar profiles

Summary Considerf+ ff+ (1–f²)+ f=0 together with the boundary conditionsf(0)=f(0)=0,f ()=1. If=–1,>0, arbitrary there is at least one solution which satisfies 0<f<1 on (0, ). By the additional conditionf>0 on (0, ) or, alternately 0<1, the uniqueness of the solution is demonstrated.If=1,<0, arbitrary the existence of solutions for which –1<f<0 in some initial interval (0,t) and satisfying generallyf>1 is established. In both problems, bounds forf (0) and qualitative behavior of the solutions are shown.

---

Sommario Si consideri il problema definito dall'equazionef+ f f+ (1–f²)+ f=0 e dalle condizioni al contornof(0)=f (0)=0,f()=1. Assumendo=–1,>0, arbitrario si dimostra che esiste almeno una soluzione che soddisfa 0<f<1 nell'intervallo (0, ). Se in aggiunta si ipotizzaf>0 in (0, ), oppure 0<=1, l'unicità délia soluzione è assicurata.Successivamente si considéra il problema di valori al contorno con=1,<0, arbitrario. In questo caso esiste un'intera classe di soluzioni che soddisfano –1<f<0 in un intorno dell'origine e tali chef>1, in generale.Di detti problemi viene studiato il comportamento délle soluzioni e vengono determinate dalle maggiorazioni e minorazioni del valoref(0).

     

On the Minimum Size of Some Minihypers and Related Linear Codes

We denote by m_r,q(s) the minimum value of f for which an {f, _r-2+s ; r,q }-minihyper exists for r 3, 1 s q–1, where _j=(q^j+1–1)/(q–1). It is proved that m_3,q(s)=₁(₁+s) for many cases (e.g., for all q 4 when ) and that m_r,q(s) _r-1+s₁+q for 1 s q – 1,~q 3,~r 4. The nonexistence of some [n,k,n+s–q^k-2]_q codes attaining the Griesmer bound is given as an application.AMS classification: 94B27, 94B05, 51E22, 51E21     

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.     

Epsilon efficiency

This paper considers the extension of -optimality for scalar problems to vector maximization problems, or efficiency problems, which havem objective functions defined on a set .It is shown that the natural extension of the scalar -optimality concepts [viz, given >0, given a solution setS, ifxS there exists an efficient solutiony with f(x)–f(y), and given an efficient solutiony, there exists anxS with f(x)–f(y)] do not hold for some methods used. Six concepts of -efficient sets are introduced and examined, to a very limited extent, in the context of five methods used for generating efficient points or near efficient points.In doing so, a distinction is drawn between methods in which the surrogate optimizations are carried out exactly, and those where terminal -optimal solutions are obtained.The author would like to thank the referees whose thoroughness was extremely helpful for the revised paper.     

The Lattice of Interpretability Types of Cantor Varieties

For integers 1 m < n, a Cantor variety with m basic n-ary operations _i and n basic m-ary operations _k is a variety of algebras defined by identities _k(₁( ), ... , _m( )) = _k and i(₁( ), ... ,_n( )) = y _i, where = (x ₁., ... , x _n) and = (y ₁, ... , y _m). We prove that interpretability types of Cantor varieties form a distributive lattice, , which is dual to the direct product ₁ × ₂ of a lattice, ₁, of positive integers respecting the natural linear ordering and a lattice, ₂, of positive integers with divisibility. The lattice is an upper subsemilattice of the lattice of all interpretability types of varieties of algebras.