Approximation of the viability kernel

We study recursive inclusionsx ⁿ⁺¹ G(x ⁿ ). For instance, such systems appear for discrete finite-difference inclusionsx ⁿ⁺¹ G (x ⁿ) whereG :=1+F. The discrete viability kernel ofG , i.e., the largest discrete viability domain, can be an internal approximation of the viability kernel ofK underF. We study discrete and finite dynamical systems. In the Lipschitz case we get a generalization to differential inclusions of the Euler and Runge-Kutta methods. We prove first that the viability kernel ofK underF can be approached by a sequence of discrete viability kernels associated withx ⁿ⁺¹ (xⁿ) where (x) =x + F(x) + (ML/2) ². Secondly, we show that it can be approached by finite viability kernels associated withx _h ⁿ⁺¹ ( (x _h ⁿ⁺¹ ) +(h) X _h .     

A note on quasi-periodic solutions of some elliptic systems

We extend a recent method of proof of a theorem by Kolmogorov on the conservation of quasi-periodic motion in Hamiltonian systems so as to prove existence of (uncountably many) real-analytic quasi-periodic solutions for elliptic systems u=f _x (u, y), whereu y ^M u(y) ^N ,f=f(x, y) is a real-analytic periodic function and is a small parameter. Kolmogorov's theorem is obtained (in a special case) whenM=1 while the caseN=1 is (a special case of) a theorem by J. Moser on minimal foliations of codimension 1 on a torusT ^M +1. In the autonomous case,f=f(x), the above result holds for any .     

Convexity of Nonlinear Image of a Small Ball with Applications to Optimization

Let f: XY be a nonlinear differentiable map, X,Y are Hilbert spaces, B(a,r) is a ball in X with a center a and radius r. Suppose f (x) is Lipschitz in B(a,r) with Lipschitz constant L and f (a) is a surjection: f (a)X=Y; this implies the existence of >0 such that f (a)^* yy, yY. Then, if r,/(2L), the image F=f(B(a,)) of the ball B(a,) is convex. This result has numerous applications in optimization and control. First, duality theory holds for nonconvex mathematical programming problems with extra constraint x–a. Special effective algorithms for such optimization problems can be constructed as well. Second, the reachability set for small power control is convex. This leads to various results in optimal control.     

An embedding theorem for a limiting exponent

We consider the function space B _p ^l () of functionsf(x), defined on the domain of a certain class and characterized by specific differential-difference properties in L_p(). We prove a theorem on the embedding B _p,q ^l () L_q in the case whenl=n/p –n/q >0 and its generalization for vectorl, p, q.Translated from Matematicheski Zametki, Vol. 6, No. 2, pp. 129–138, August, 1969.     

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 chord-stretching map of a convex loop is an isometry

Let ⁿ be n-dimensional Euclidean space, and let : [0, L] ⁿ and : [0, L] ⁿ be closed rectifiable arcs in ⁿ of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C ² curves. In this paper we prove the conjecture in general.     

A finite element method for a singularly perturbed boundary value problem

Summary We examine the problem:u+a(x)u–b(x)u=f(x) for 0<x<1,a(x)>0,b(x)>, ² = 4>0,a, b andf inC ² [0, 1], in (0, 1],u(0) andu(1) given. Using finite elements and a discretized Green's function, we show that the El-Mistikawy and Werle difference scheme on an equidistant mesh of widthh is uniformly second order accurate for this problem (i.e., the nodal errors are bounded byCh ², whereC is independent ofh and ). With a natural choice of trial functions, uniform first order accuracy is obtained in theL (0, 1) norm. On choosing piecewise linear trial functions (hat functions), uniform first order accuracy is obtained in theL ¹ (0, 1) norm.     

Waterman classes and triangular sums of double Fourier series

Let ^a ={nln^a (n+1)}, where a R. The following results are established: For every &fnof ^a BV ((- ]²), the triangular partial sums of its Fourier series are uniformly bounded if a = -1, and converge everywhere if a < -1.For every a>0, there exists &fnof ^a BV ((- ]²) such that the triangular partial sums of its Fourier series are unbounded at the point (0;0).     

Application of Hermite-Mahler polynomials to the approximation of the values ofp-adic exponential function

We shall give a further application of Hermite-Mahler polynomials to the consideration ofp-adic exponential function. An effective lower bound is obtained for max {| – | _p ,P(e )| _p }, where is an algebraic number satisfying || _p <p ^–/(p–1), and 0 is ap-adic number with | | _p depending on the degree of the polynomialPZ[y]. The bound obtained implies the transcendence ofe if ap-adic number satisfying 0 < || _p <p ^–/(p–1) is algebraic or can be well approximated by algebraic numbers.This work was carried out while the author was a research fellow of the Alexander von Humboldt Foundation.     

An implicit function theorem

Suppose thatF:DR ⁿ×R^mRⁿ, withF(x ⁰,y ⁰)=0. The classical implicit function theorem requires thatF is differentiable with respect tox and moreover that ₁ F(x ⁰,y ⁰) is nonsingular. We strengthen this theorem by removing the nonsingularity and differentiability requirements and by replacing them with a one-to-one condition onF as a function ofx.     

Singular perturbations in foliations

Summary We define a constraint system , [0,₀), which is a kind of family of vector fields on a manifold. This is a generalized version of the family of the equations , [0,₀),x ^m ,y ⁿ . Finally, we prove a singular perturbation theorem for the system , [0,₀).Dedicated to Professor Kenichi Shiraiwa on his 60th birthday     

Constraint decomposition algorithms in global optimization

Many global optimization problems can be formulated in the form min{c(x, y): x X, y Y, (x, y) Z, y G} where X, Y are polytopes in ^p , ⁿ , respectively, Z is a closed convex set in ^p+n, while G is the complement of an open convex set in ⁿ . The function c: ^p+n is assumed to be linear. Using the fact that the nonconvex constraints depend only upon they-variables, we modify and combine basic global optimization techniques such that some new decomposition methods result which involve global optimization procedures only in ⁿ . Computational experiments show that the resulting algorithms work well for problems with smalln.     

Quasi-coherence of Hardy spaces in several complex variables

In this paper, we prove that the Hardy spaceH ^p (), 1p<, over a strictly pseudoconvex domain in ⁿ with smooth boundary is quasi-coherent. More precisely, we show that Toeplitz tuplesT with suitable symbols onH ^p () have property (). This proof is based on a well known exactness result for the tangential Cauchy-Riemann complex.     

Connected and alternating vectors: Polyhedra and algorithms

Given a graphG = (V, E), leta ^S, S L, be the edge set incidence vectors of its nontrivial connected subgraphs.The extreme points of = {x R ^E: a^sx |V(S)| - |S|, S L} are shown to be integer 0/± 1 and characterized. They are the alternating vectorsb ^k, k K, ofG. WhenG is a tree, the extreme points ofB 0,b ^kx 1,k K} are shown to be the connected vectors ofG together with the origin. For the four LP's associated with andA, good algorithms are given and total dual integrality of andA proven.On leave from Swiss Federal Institute of Technology, Zurich.     

Symmetrische Permutationsmengen

A permutation set (M, I) consisting of a setM and a set of permutations ofM, is calledsymmetric, if for any two permutations, the existence of anx M with (x) (x) and ^–1 (x) = ^–1 (x) implies ^–1 = ^–1 , andsharply 3-transitive, if for any two triples (x ₁,x ₂,x ₃), (y ₁,y ₂,y ₃) M ³ with|{x ₁,x ₂,x ₃ }| = |{y ₁,y ₂,y ₃ }| = 3 there is exactly one permutation with(x ₁) =y ₁,(x ₂) =y ₂,(x ₃) =y ₃. The following theorem will be proved.THEOREM.Let (M, ) be a sharply 3-transitive symmetric permutation set with |M|3, such that contains the identity. Then is a group and there is a commutative field K such that and the projective linear group PGL(2, K) are isomorphic.     

Existence for the Cahn-Hilliard phase separation model with a nondifferentiable energy

Summary The Cahn-Hilliard model for phase separation in a binary alloy leads to the equations (I) u_t=w, (II) w= (u)– u with an associated energy functional F(u)=f [(u)+ +¦u¦²/2] dx. In this paper we discuss the existence theory for initial bounday value problems arising from modifications to the Cahn-Hilliard model due to the addition of the non-differentiable term ¦u¦dx to the energy F(u).     

Exact solutions of the d'Alembert and Liouville equations in the pseudo-Euclidean space R2, 2. II

Invariants of the maximal rank-3 and rank-4 subalgebras of the Poincaré algebras AP(2,2), which is the maximal invariance algebra of the d'Alembert equation u+u^k=0,k=1, and the Liouville equation u+ expu=0 are constructed. The reduction of the given equations with respect to the maximal rank-3 subalgebra is carried out and some exact solutions of these equations are found.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 9, pp. 1237–1244, September, 1990.     

Trace formulas for pair operators

In this paper we shall study the Fredholm determinant and related trace formulas for a class of operators which correspond to the restriction of integral operators with kernels of the form k(x,y) = (x)g^v(x–y)+[1–(x)]f^v(x–y) to the square |x|,|y| T and shall evaluate the limit as T . Here denotes the indicator function of the right half-line [0,) . The results obtained generalize the well known formulas of M. Kac for the classical convolution operator in which g = f .     

A Characterization of Some Minihypers and its Application to Linear Codes

Any {f,r- 2+s; r,q}-minihyper includes a hyperplane in PG(r, q) if fr-1 + s 1 + q – 1 for 1 s q – 1, q 3, r 4, where i = (qi + 1 – 1)/ (q – 1 ). A lower bound on f for which an {f, r – 2 + 1; r, q}-minihyper with q 3, r 4 exists is also given. As an application to coding theory, we show the nonexistence of [ n, k, n + 1 – qk – 2 ]q codes for k 5, q 3 for qk – 1 – 2q – 1 < n qk – 1 – q – 1 when k > q – q - \sqrt q + 2$$ " align="middle" border="0"> and for when , which is a generalization of [18, Them. 2.4].     

Асимптоический Анализ Распределения Статистики Диксона

. u 60-u u