A Local Approach to 1-Homogeneous Graphs

Let bea distance-regular graph with diameter d. For vertices x and y of at distancei, 1 i d, we define the setsC _i(x,y) = i–1(x) (y), A _i (x,y) = _i (x) (y) and B _i (x,y) = _i+1(x) (y).Then we say has the CAB_j property,if the partition CAB _i (x,y) = {C _i (x,y),A _i (x,y),B _i (x,y)}of the local graph of y is equitable for each pairof vertices x and y of at distance i j. We show that in with the CAB_j property then the parameters ofthe equitable partitions CAB i(x,y) do not dependon the choice of vertices x and y atdistance i for all i j. The graph has the CAB property if it has the CAB _d property. We show the equivalence of the CAB property and the1-homogeneous property in a distance-regular graph with a ₁ 0. Finally, we classify the 1-homogeneous Terwilligergraphs with c ₂ 2.     

On Vector Valued Measure Spaces of Bounded Φ-variation containing copies of ℓ∞

Given a Young function , we study the existence of copies of c ₀ and in cabv (,X) and in cabsv (,X), the countably additive, -continuous, and X-valued measure spaces of bounded -variation and bounded -semivariation, respectively.     

Superconvergence for galerkin methods for the two point boundary problem via local projections

The two point boundary problemy'-a(x)y–b(x)y=-f(x), o<x<1,y(0)=y(1)=0, is first solved approximately by the standard Galerkin method, (Y, ) + (aY+bY, )=(f, ), ₁ ⁰ (r, ), for a function Y ₁ ⁰ (r, ), the space ofC ¹-piecewise--degree-polynomials vanishing atx=0 andx=1 and having knots at {x ₀ ,x ₁ , ...,x _M }=. ThenY is projected locally into a polynomial of higher degree by means of one of several projections. It is then shown that higher-order convergence results locally, provided thaty is locally smooth and is quasi-uniform.This research was supported in part by the National Science Foundation.     

A general minimax theorem

This paper is concerned with minimax theorems for two-person zero-sum games (X, Y, f) with payofff and as main result the minimax equality inf supf (x, y)=sup inff (x, y) is obtained under a new condition onf. This condition is based on the concept of averaging functions, i.e. real-valued functions defined on some subset of the plane with min {x, y}< (x, y)x, y} forx y and (x, x)=x. After establishing some simple facts on averaging functions, we prove a minimax theorem for payoffsf with the following property: Forf there exist averaging functions and such that for any x₁, x₂ X, > 0 there exists x₀ X withf (x₀, y) > f (x₁,y),f (x₂,y))– for ally Y, and for any y₁, y₂ Y, > 0 there exists y₀ Y withf (x, y₀) (f (x, y₁),f (x, y₂))+. This result contains as a special case the Fan-König result for concave-convex-like payoffs in a general version, when we take linear averaging with (x, y)=x+(1–)y, (x, y)=x+(1–)y, 0 <, < 1.Then a class of hide-and-seek games is introduced, and we derive conditions for applying the minimax result of this paper.

---

Zusammenfassung In dieser Arbeit werden Minimaxsätze für Zwei-Personen-Nullsummenspiele (X, Y,f) mit Auszahlungsfunktionf behandelt, und als Hauptresultat wird die Gültigkeit der Minimaxgleichung inf supf (x, y)=sup inff (x, y) unter einer neuen Bedingung an f nachgewiesen. Diese Bedingung basiert auf dem Konzept mittelnder Funktionen, d.h. reellwertiger Funktionen, welche auf einer Teilmenge der Ebene definiert sind und dort der Eigenschaft min {x, y} < < (x, y)x, y} fürx y, (x, x)=x, genügen. Nach der Herleitung einiger einfacher Aussagen über mittelnde Funktionen beweisen wir einen Minimaxsatz für Auszahlungsfunktionenf mit folgender Eigenschaft: Zuf existieren mittelnde Funktionen und, so daß zu beliebigen x₁, x₂ X, > 0 mindestens ein x₀ X existiert mitf (x₀,y) (f (x ₁,y),f (x₂,y)) – für alley Y und zu beliebigen y₁, y₂ Y, > 0 mindestens ein y₀ Y existiert mitf (x, y₀) (f (x, y₁),f (x, y ₂))+ für allex X. Dieses Resultat enthält als Spezialfall den Fan-König'schen Minimaxsatz für konkav-konvev-ähnliche Auszahlungsfunktionen in einer allgemeinen Version, wenn wir lineare Mittelung mit (x, y)=x+(1–)y, (x, y)= x+(1–)y, 0 <, < 1, betrachten.Es wird eine Klasse von Suchspielen eingeführt, welche mit dem vorstehenden Resultat behandelt werden können.

     

On some functional equations of Goląb-Schinzel type

Summary LetE be a real Hausdorff topological vector space. We consider the following binary law * on ·E:(, ) * (, ) = (, ^k + ) for(, ), (, ) × E where is a nonnegative real number,k andl are integers.In order to find all subgroupoids of ( ·E, *) which depend faithfully on a set of parameters, we have to solve the following functional equation:f(f(y) ^k x +f(x) ^l y) =f(x)f(y) (x, y E). (1)In this paper, all solutionsf: of (1) which are in the Baire class I and have the Darboux property are obtained. We obtain also all continuous solutionsf: E of (1). The subgroupoids of (^* ·E, *) which dapend faithfully and continuously on a set of parameters are then determined in different cases. We also deduce from this that the only subsemigroup ofL _n ¹ of the form {(F(x ₂,x ₃, ,x _n ),x ₂,x ₃, ,x _n ); (x ₂, ,x _n ) ^{n – 1} }, where the mappingF: ^{n – 1 *} has some regularity property, is {1} × ^{n – 1} .We may noitice that the Gob-Schinzel functional equation is a particular case of equation (1)(k = 0, l = 1, = 1). So we can say that (1) is of Gob—Schinzel type. More generally, whenE is a real algebra, we shall say that a functional equation is of Gob—Schinzel type if it is of the form:f(f(y) ^k x +f(x) ^l y) =F(x,y,f(x),f(y),f(xy)) wherek andl are integers andF is a given function in five variables. In this category of functional equations, we study here the equation:f(f(y) ^k x +f(x) ^l y) =f(xy) (x, y f: ). (4)This paper extends the results obtained by N. Brillouët and J. Dhombres in [3] and completes some results obtained by P. Urban in his Ph.D. thesis [11] (this work has not yet been published).Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

Lattice Polytopes Associated to Certain Demazure Modules of sl n + 1

Let w be an element of the Weyl group of sl _{n + 1}. We prove that for a certain class of elements w (which includes the longest element w₀ of the Weyl group), there exist a lattice polytope R ^l(w) , for each fundamental weight _i of sl _{n + 1}, such that for any dominant weight = _{i = 1} ⁿ a _{i i} , the number of lattice points in the Minkowski sum _w = _{i = 1} ⁿ a _{i i} ^w is equal to the dimension of the Demazure module E _w (). We also define a linear map A ^w : R ^l(w) P _Z R where P denotes the weight lattice, such that char E _w () = e e^–A(x) where the sum runs through the lattice points x of ^w .     

Superstable implicit Runge-Kutta methods for second order initial value problems

Using the well known properties of thes-stage implicit Runge-Kutta methods for first order differential equations, single step methods of arbitrary order can be obtained for the direct integration of the general second order initial value problemsy=f(x, y, y),y(x _o)=y _o,y(x _o)=y _o. These methods when applied to the test equationy+2y+ ² y=0, ,0, +>0, are superstable with the exception of a finite number of isolated values ofh. These methods can be successfully used for solving singular perturbation problems for which f/y and/or f/y are negative and large. Numerical results demonstrate the efficiency of these methods.     

Nonparametric Estimation of a Conditional Quantile for α-Mixing Processes

Let (X_i,Y _i) be a set of observations form a stationary -mixing process and (x) be the conditional -th quantile of Y given X = x. Several authors considered nonparametric estimation of (x) in the i.i.d. setting. Assuming the smoothness of FF(x), we estimate it by local polynomial fitting and prove the asymptotic normality and the uniform convergence.     

Two classes of conformally flat contact metric 3-manifolds

We give a classification of 3—dimensional conformally flat contact metric manifolds satisfying: =0(=L g) orR(Y, Z)=k[(Z)Y–(Y)Z]+[(Z)hY]–(Y)hZ] wherek and are functions. It is proved that they are flat (the non-Sasakian case) or of constant curvature 1 (the Sasakian case).     

Cohomology of solvable lie algebras and solvmanifolds

The cohomology H^* (G/,) of the de Rham complex *(G/) of a compact solvmanifold G/ with deformed differential d = d + , where is a closed 1 -form, is studied. Such cohomologies naturally arise in Morse-Novikov theory. It is shown that, for any completely solvable Lie group G containing a cocompact lattice G, the cohomology H^*(G/, ) is isomorphic to the cohomology H^*( ) of the tangent Lie algebra of the group G with coefficients in the one-dimensional representation : defined by () = (). Moreover, the cohomology H ^*(G/,) is nontrivial if and only if -[] belongs to a finite subset of H ¹(G/,) defined in terms of the Lie algebra .Translated from Matematicheskie Zametki, vol. 77, no. 1, 2005, pp. 67–79.Original Russian Text Copyright © 2005 by D. V. Millionshchikov.This revised version was published online in April 2005 with a corrected issue number.     

OnU ϕ-sets of trigonometric integrals

, (t) >0 E(–, +),E<, , ¦f(t)¦ (t) xE, f(t)=0 (–, +).     

Generalized Variation of Mappings with Applications to Composition Operators and Multifunctions

We study (set-valued) mappings of bounded -variation defined on the compact interval I and taking values in metric or normed linear spaces X. We prove a new structural theorem for these mappings and extend Medvedev's criterion from real valued functions onto mappings with values in a reflexive Banach space, which permits us to establish an explicit integral formula for the -variation of a metric space valued mapping. We show that the linear span GV (I;X) of the set of all mappings of bounded -variation is automatically a Banach algebra provided X is a Banach algebra. If h:I× X Y is a given mapping and the composition operator is defined by (f)(t)=h(t,f(t)), where tI and f:I X, we show that :GV (I;X) GV (I;Y) is Lipschitzian if and only if h(t,x)=h₀(t)+h₁(t)x, tI, xX. This result is further extended to multivalued composition operators with values compact convex sets. We prove that any (not necessarily convex valued) multifunction of bounded -variation with respect to the Hausdorff metric, whose graph is compact, admits regular selections of bounded -variation.     

On the boundedness of Weyl sums

Leta be irrational and letf:[0,1] be Riemann-integrable with integral zero. Letf _n (x) denote the Weyl sumf _n (x):= _k=0 ^n–1 f({x k>}),x/[0,1[,n. We prove criteria for the boundedness of the sequence (f _n ) _n1 and discuss the relation of this question to irregularities of the distribution of sequences.     

On the admissibility of function spaces of typeB p,q s andF p,q s,and boundary value problems for non-linear partial differential equations

u=f(x)+S(u), S — , u-G(u), G — . B _p,q ^s () -F _p,q ^s (). R _n — . — . _p,q ^s F _p,q ^s .     

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 .     

On the width of ordered sets and Boolean algebras

Thewidth (chain number) of a partial order P, < is the smallest cardinal such that ¦A¦< 1 + whenever A is an antichain (chain) in P. We prove that, if a partial order (P, <) has width and cf()=, then P contains antichains A_n (n<) such that ¦A ₀¦<¦A₁¦ <...<={¦A_n¦: n < < } and either A₀1 A₂< ... or A₀>A₁ >A₂> ... A similar structure result is obtained for partial orders with chain number if cf()=. As an application we solve a problem of van Douwen, Monk and Rubin [1] by showing that if a Boolean algebra has width , thencf() .This work has been partially supported by NATO grant No. 339/84.Presented by Bjarni Jonsson.     

The measure of a translated ball in uniformly convex spaces

Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r ^q , whereq depends on the properties of the norm. We specify it in the case ofL spaces, >1.     

Some topological and geometrical problems arising in projective-difference methods for the triangulation of a domain

In this paper the problem of the partition of a polygon into quadrilaterals (quadrangles and triangles) is studied, for which four given boundary pointsA _i (1i4) become the vertices of a quadrilateral, and the partition itself is topologically equivalent to a special partition of a rectangle Q into rectangles with sides parallel to the sides of Q. This problem is closely connected with the problem of choosing a basis of piecewise linear functions in the projective-difference method, for which the projective-difference analog of the operator - -(²/x² + ²/y²) for a boundary-value problem in turns out to be spectrally equivalent to its simplest difference analog in a rectangle (see [1–5]).Translated from Matematicheskii Zametki, Vol. 21, No. 3, pp. 427–442, March, 1977.     

The local nature of Δ-coloring and its algorithmic applications

Given a connected graphG=(V, E) with |V|=n and maximum degree such thatG is neither a complete graph nor an odd cycle, Brooks' theorem states thatG can be colored with colors. We generalize this as follows: letG-v be -colored; then,v can be colored by considering the vertices in anO(log n) radius aroundv and by recoloring anO(log n) length augmenting path inside it. Using this, we show that -coloringG is reducible inO(log³ n/log) time to (+1)-vertex coloringG in a distributed model of computation. This leads to fast distributed algorithms and a linear-processorNC algorithm for -coloring.A preliminary version of this paper appeared as part of the paper Improved Distributed Algorithms for Coloring and Network Decomposition Problems, in theProceedings of the ACM Symposium on Theory of Computing pages 581–592, 1992. This research was done when the authors were at the Computer Science Department of Cornell University. The research was supported in part by NSF PYI award CCR-89-96272 with matching funds from UPS and Sun Microsystems.     

Localization of the spectrum of certain non-self-adjoint operators

Let the self-adjoint operator A and the bounded operator B be specified in Hilbert space We let denote the spectral family of the operator A. If (E – E _N ) B ₂+E–_NB ² 0 npnN , then in the complex plane z=+ there will exist the curve ¦ ¦ =f (), limf () = 0 for ± such that the entire spectrum of the operator A+B lies within the region ¦ ¦ f(). In particular, the condition of the theorem will be satisfied when B is a completely continuous operator.Translated from Matematicheskie Zametki, Vol. 3, No. 4, pp. 415–420, April, 1968.The author expresses his appreciation to R. S. Ismagilov for his discussion of the results.