Theorems on Lower Semicontinuity and Relaxation for Integrands with Fast Growth

We prove theorems on the lower semicontinuity and integral representations of the lower semicontinuous envelopes of integral functionals with integrands L of fast growth: c ₁ G(|Du|) + c ₂ L c ₃ G(|Du|) + c ₄ with c ₃ c ₁ > 0 and G : [0, [ [0, [ is an increasing convex function such that vG (v)/G(v) as v and is increasing for large v. Repeating the results for the case of the standard growth (G() = ||^p) the quasiconvexity of integrands characterizes the lower semicontinuity of integral functionals and their quasiconvexifications yield the integral functionals that are lower semicontinuous envelopes.Original Russian Text Copyright © 2005 Sychev M. A.The author was supported by the Russian Foundation for Basic Research (Grant 03-01-00162).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 679–697, May–June, 2005.     

The addition formula for theta functions

Summary In this paper we solve the functional equationx(u + v)(u – v) = f ₁(u)g₁(v) + f₂(u)g₂(v) under the assumption thatx, , f ₁, f₂, g₁, g₂ are complex-valued functions onR ⁿ ,n N arbitrary, and 0 and 0 are continuous. Our main result shows that, apart from degeneracy and some obvious modifications, theta functions of one complex variable are the only continuous solutions of this functional equation.     

Bifurcation for a semilinear elliptic equation on ℛN with radially symmetric coefficients

We consider the semilinear eigenvalue problem on ^N (N 2) (N2) and investigate the question under which conditions on the radially symmetric function q, =0 is a bifurcation point for this equation in H¹, In H² and in L^p for 2p+.     

Notes on Interpolation. X (Two Boundary Value Problems)

In this paper we use (0, 2) interpolational polynomials to give an approximate solution of the differential equation y(x) + A(x)y(x) = F(x), x I := [-1, 1] j in case when the boundary values are y(-1) = and y(1) = , , R.     

A note on an integrated cauchy functional equation

In characterizing the semistable law, [Shimizu reduced the problem to solving the equation ,x0 where andv are given positive measures on [0, ). In this note, we obtain a simple proof and show that some of his conditions can be weakened.     

Error bounds for the solution of nonlinear two-point boundary value problems by Galerkin's method

Letu be the solution of the differential equationLu(x)=f(x, u(x)) forx(0,1) (with appropriate boundary conditions), whereL is an elliptic differential operator. Letû be the Galerkin approximation tou with polynomial spline trial functions. We obtain error bounds of the form , where 0jm andmk2m+q,p=2 orp=,h is the mesh size andq is a non negative integer depending on the splines being used.This research was supported in part by the Office of Naval Research under Contract N00014-69-A0200-1017.     

Circularity of Finite Groups without Fixed Points

Let be a fixed point free group given by the presentation where and are relative prime numbers, t = /s and s = gcd( – 1,), and is the order of modulo . We prove that if (1) = 2, and (2) is embeddable into the multiplicative group of some skew field, then is circular. This means that there is some additive group N on which acts fixed point freely, and |((a)+b)((c)+d)| 2 whenever a,b,c,d N, a0c, are such that (a)+b(c)+d.     

The tree number of a graph with a given girth

A family of subtrees of a graphG whose edge sets form a partition of the edge set ofG is called atree decomposition ofG. The minimum number of trees in a tree decomposition ofG is called thetree number ofG and is denoted by(G). It is known that ifG is connected then(G) |G|/2. In this paper we show that ifG is connected and has girthg 5 then(G) |G|/g + 1. Surprisingly, the case wheng = 4 seems to be more difficult. We conjecture that in this case(G) |G|/4 + 1 and show a wide class of graphs that satisfy it. Also, some special graphs like complete bipartite graphs andn-dimensional cubes, for which we determine their tree numbers, satisfy it. In the general case we prove the weaker inequality(G) (|G| – 1)/3 + 1.     

Differentiation of fractional order onp-groups,approximation properties

G- p- . [5] - (G) L _r(G) (1r<), . . , - . , , , . . , X. , . (. [1], [2] [4]).     

On the Movement of Transitive Permutation p-Groups

Let G be a transitive permutation group on a set and m a positive integer. If | – | m for every subset of and all g G, then || 2mp/(p – 1) where p is the least odd prime dividing |G|. It was shown by Mann and Praeger [13] that, for p = 3, the 3-groups G which attain this bound have exponent p. In this paper we will show a generalization of this result for any odd primes.AMS Subject Classification (2000), 20BXX     

A cuspidal edge of first kind with a point of asymptotic type

We shall say that an analytic surface supports a line with a singularity of order 2 if is a singular line of the surface (the first fundamental form of anyC -parametrization of is degenerate on ) and there exists aC -parametrization(s, v) of the surface such that the second derivative of in the direction orthogonal to is nonzero. We shall assume that has no singular points or points of straightening or flattening, that the Gaussian curvature of is nonpositive, and that the Gaussian curvature of has a finite limita(s) on (s is arc length on ), and the osculating plane of is tangent to in the sense that this plane contains as a half-plane the contingency of at the corresponding point of . Finally supposeb(0)=0,b(s)0 fors0, andb _ss (0)0, whereb(s)=a(s)+ ²(s) and is the torsion of . It is shown that under these hypotheses envelopes the asymptotes of one of the families of. All the asymptotes of the other family are tangent to except the asymptote passing through the points=0 of the singular line.Translated from Ukrainskií Geometricheskií Sbornik, No. 30, 1987, pp. 66–76.     

Limiting behavior of weighted central paths in linear programming

We study the limiting behavior of the weighted central paths{(x(), s())} > 0 in linear programming at both = 0 and = . We establish the existence of a partition (B ,N ) of the index set { 1, ,n } such thatx _i() ands _j () as fori B , andj N , andx _N (),s _B () converge to weighted analytic centers of certain polytopes. For allk 1, we show that thekth order derivativesx ^(k) () ands ^(k) () converge when 0 and . Consequently, the derivatives of each order are bounded in the interval (0, ). We calculate the limiting derivatives explicitly, and establish the surprising result that all higher order derivatives (k 2) converge to zero when .     

Produktsätze für Verfahren zur Limitierung von Doppelfolgen

{p _mn } - ₀₀>0, (1, 1) (1.1) (1.2). {s _mn } J _p - ( bJ _p -lims _mn =), (1.3) 0<x,y<1 p _s (, )/p(x, y) x, y 1-. {r _mn } - , (1.5) 0<, <1. N _rp - , (1.6). , bJ _p -lims _mn = bJ _q -lim(N _rps) _mn =. J _p - . , .     

Long paths and cycles in tough graphs

For a graphG, letp(G) andc(G) denote the length of a longest path and cycle, respectively. Let (t,n) be the minimum ofp(G), whereG ranges over allt-tough connected graphs onn vertices. Similarly, let (t,n) be the minimum ofc(G), whereG ranges over allt-tough 2-connected graphs onn vertices. It is shown that for fixedt>0 there exist constantsA, B such that (t,n)A·log(n) and (t,n)·log((t,n))B·log(n). Examples are presented showing that fort1 there exist constantsA, B such that (t,n)A·log(n) and (t,n)B· log(n). It is conjectured that (t,n) B·log(n) for some constantB. This conjecture is shown to be valid within the class of 3-connected graphs and, as conjectured in Bondy [1] forl=3, within the class of 2-connectedK _1.l-free graphs, wherel is fixed.     

Extensions and selections in subspaces ofC(K)

LetK be a compact Hausdorff space and letFK be a peak interpolation set for a function algebraAC(K). Let be a map fromK to the family of all convex subsets of such that the set {(z, x)zK, x(z)} is open inK×C and such thatg(z)(z) (zK) for somegA. We prove that everyfC(F) satisfyingf(s)(s) (sF) (f(s)closure (s) (sF)) admits an extensionfAA} satisfyingf(z)(z) (zK) (f(z))}closure (z) (zK), respectively). We prove a more general theorem of this kind and present various applications which generalize known dominated interpolation theorems for subspaces ofC(K).     

Central Limit Theorem for a Class of Nonhomogeneous Random Walks

A spatially nonhomogeneous random walk _t on the grid =^m X ⁿ is considered. Let _t ⁰ be a random walk homogeneous in time and space, and let _t be obtained from it by changing transition probabilities on the set A= X ⁿ, || < , so that the walk remains homogeneous only with respect to the subgroup ⁿ of the group . It is shown that if >m 2 or the drift is distinct from zero, then the central limit theorem holds for _t.     

Admissibility of linear estimators of regression coefficients under quadratic loss

For the general fixed effects linear model:Y=X+, N(0,V),V0, we obtain the necessary and sufficient conditions forLY+a to be admissible for a linear estimable functionS in the class of all estimators under the loss function (d -S)D(d -S), whereD0 is known. For the general random effects linear model: =XV ₁₁ X+XV ₁₂+V ₂₁ X+V ₂₂0, we also get the necessary and sufficient conditions forLY+a to be admissible for a linear estimable functionS+Q in the class of all estimators under the loss function (d -S -Q)D(d -S -Q), whereD0 is known.     

On shifts of sequences

X ₂ ={x _k } _k=2 X={x _k } _k=1 . , , ( , ) . , , X— , , X ₂ H, , , , , X ₂ H.     

A Comparison of Methods for Estimating the Extremal Index

The extremal index, (01), is the key parameter when extending discussions of the limiting behavior of the extreme values from independent and identically distributed sequences to stationary sequences. As measures the limiting dependence of exceedances over a threshold u, as u tends to the upper endpoint of the distribution, it may not always be informative about the extremal dependence at levels of practical interest. Therefore we also consider a threshold-based extremal index, (u). We compare the performance of a range of different estimators for and (u) covering processes with < 1 and = 1. We find that the established methods for estimating actually estimate (u), so perform well only when (u) . For Markov processes, we introduce an estimator which is as good as the established methods when (u) but provides an improvement when (u) < = 1. We illustrate our methods using simulated data and daily rainfall measurements.     

The Ramsey property for collections of sequences not containing all arithmetic progressions

A family of sequences has the Ramsey property if for every positive integerk, there exists a least positive integerf (k) such that for every 2-coloring of {1,2, ...,f (k)} there is a monochromatick-term member of . For fixed integersm > 1 and 0 q < m, let _q(m) be the collection of those increasing sequences of positive integers {x ₁,..., x_k} such thatx _i+1 – x_i q(modm) for 1 i k – 1. Fort a fixed positive integer, denote byA _t the collection of those arithmetic progressions having constant differencet. Landman and Long showed that for allm 2 and 1 q < m, _q(m) does not have the Ramsey property, while _q(m) A _m does. We extend these results to various finite unions of _q(m) 's andA _t 's. We show that for allm 2, _q=1 ^m–1 _q(m) does not have the Ramsey property. We give necessary and sufficient conditions for collections of the form _q(m) ( _{t T} A _t) to have the Ramsey property. We determine when collections of the form _a(m₁) _b(m₂) have the Ramsey property. We extend this to the study of arbitrary finite unions of _q(m)'s. In all cases considered for which has the Ramsey property, upper bounds are given forf .