Convex independent sets and 7-holes in restricted planar point sets

For a finite setA of points in the plane, letq(A) denote the ratio of the maximum distance of any pair of points ofA to the minimum distance of any pair of points ofA. Fork>0 letc (k) denote the largest integerc such that any setA ofk points in general position in the plane, satisfying for fixed , contains at leastc convex independent points. We determine the exact asymptotic behavior ofc (k), proving that there are two positive constants=(), such thatk ^1/3c (k)k ^1/3. To establish the upper bound ofc (k) we construct a set, which also solves (affirmatively) the problem of Alonet al. [1] about the existence of a setA ofk points in general position without a 7-hole (i.e., vertices of a convex 7-gon containing no other points fromA), satisfying . The construction uses Horton sets, which generalize sets without 7-holes constructed by Horton and which have some interesting properties.     

The central limit theorem for Chébli-Trimèche hypergroups

Let (S _nn>-1) be a random walk on a hypergroup ( ₊ , *), i.e., a Markov chain with transition kernelN(x, A) = _x * (A), where is a fixed probability measure on ₊ such that the second moment exists. Then depending on the growth of the hypergroup two situations can occur: when ( ₊ , *) is of exponential growth then it is shown thatS _n is asymptotically normal. In the case of polynomial growth {more precisely, if the densityA of the Haar measure of ( ₊ , *) satisfies lim[A()/A()]=}, the normalized variablesS _n/[n Var()/(+1)]^1/2 converge to a Rayleigh distribution with parameter .     

Some Conditions for a C0-Semigroup to Be Asymptotically Finite-Dimensional

We study the class of bounded C ₀-semigroups T=(T _t ) _t0 on a Banach space X satisfying the asymptotic finite dimensionality condition: codim X ₀(T)<, where X ₀(T):={x X:lim_t T _t x=0}. We prove a theorem which provides some necessary and sufficient conditions for asymptotic finite dimensionality.     

Non removable edges in 3-connected cubic graphs

LetG be a cyclicallyk-edge-connected cubic graph withk 3. Lete be an edge ofG. LetG be the cubic graph obtained fromG by deletinge and its end vertices. The edgee is said to bek-removable ifG is also cyclicallyk-edge-connected. Let us denote by S _k (G) the graph induced by thek-removable edges and by N _k (G) the graph induced by the non 3-removable edges ofG. In a previous paper [7], we have proved that N ₃(G) is empty if and only ifG is cyclically 4-edge connected and that if N ₃(G) is not empty then it is a forest containing at least three trees. Andersen, Fleischner and Jackson [1] and, independently, McCuaig [11] studied N ₄(G). Here, we study the structure of N _k (G) fork 5 and we give some constructions of graphs such thatN _k (G) = E(G). We note that the main result of this paper (Theorem 5) has been announced independently by McCuaig [11].

---

Résumé SoitG un graphe cubique cyliquementk-arête-connexe, aveck 3. Soite une arête deG et soitG le graphe cubique obtenu à partir deG en supprimante et ses extrémités. L'arêtee est ditek-suppressible siG est aussi cycliquementk-arête-connexe. Désignons par S _k (G) le graphe induit par les arêtesk-suppressibles et par N _k (G) celui induit par les arêtes nonk-suppressibles. Dans un précédent article [7], nous avons montré que N ₃(G) est vide si et seulement siG est cycliquement 4-arête-connexe et que si N ₃(G) n'est pas vide alors c'est une forêt possédant au moins trois arbres. Andersen, Fleischner and Jackson [1] et, indépendemment, McCuaig [11] ont étudié N ₄(G). Ici, nous étudions la structure de N _k (G) pourk 5 et nous donnons des constructions de graphes pour lesquelsN _k (G) = E(G). Nous signalons que le résultat principal de cet article (Théorème 5) a été annoncé indépendamment par McCuaig [11].

     

On the discrete mean square of Dirichlet <Emphasis Type="Italic">L</Emphasis>-functions at 1

There have been many results obtained so far for the mean square of the (absolute) value of the Dirichlet L-function L(s,) in the critical strip 0<<1, especially on the critical line , but relatively few results were known for discrete mean value of |L(1,)|² till W. Zhang had published papers improving the error term step by step, which have recently been superseded by M. Katsurada and K.Matsumoto in which they succeeded in deriving an asymptotic formula for ₀|L(1,)|². The object of our paper is to point out a structural property contained in the formation of the mean square, to find out the niryana–the true body of the above sum.Dedicated to Professor Jean Louis Nicolás on his sixtieth birthdayin final form: 7 October 2003     

A variational principle for eigenvalues of pencils of Hermitian matrices

LetH=(A, B) be a pair of HermitianN×N matrices. A complex number is an eigenvalue ofH ifdet(A–B)=0 (we include = ifdetB=0). For nonsingularH (i.e., for which some is not an eigenvalue), we show precisely which eigenvalues can be characterized as _k ⁺ =sup{inf{*A:*B=1,S},SS _k},S _k being the set of subspaces of C ^N of codimensionk–1.Dedicated to the memory of our friend and colleague Branko NajmanResearch supported by NSERC of Canada and the I.W.Killam FoundationProfessor Najman died suddenly while this work was at its final stage. His research was supported by the Ministry of Science of CroatiaResearch supported by NSERC of Canada     

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.     

Stability of unconditional convergence almost everywhere

We will investigate the properties of series of functions which are unconditionally convergent almost everywhere on [0, 1]. We will establish the following theorem: If the series _k=1 f _k(x) converges unconditionally almost everywhere, then there exists a sequence {_k} ₁ ,_k , such that if _{k k} , k=1, 2,..., the series _{k=1 k}/k(x) converges unconditionally almost every-where.Translated from Mate matte heskie Zametki, Vol. 14, No. 5, pp. 645–654, November, 1973.The author wishes to thank Professor P. L. Ul'yanov for his help.     

k-regular factors and semi-k-regular factors in bipartite graphs

LetG be a graph, andk1 an integer. LetU be a subset ofV(G), and letF be a spanning subgraph ofG such that deg _F (x)=k for allx V(G)–U. If deg _F (x)k for allxU, thenF is called an upper semi-k-regular factor with defect setU, and if deg _F (x)k for allxU, thenF is called a lower semi-k-regular factor with defect setU. Now letG=(X, Y;E(G)) be a bipartite graph with bipartition (X,Y) such that X=Yk+2. We prove the following two results.(1) Suppose that for each subsetU ₁X such that U ₁=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.(2) Suppose that for each subsetU ₁X such that U ₁=X–1/k+1,G has a lower semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=X–1/k+1,G has a lower semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.     

The Whitehead Group of the Novikov Ring

The Bass–Heller–Swan–Farrell–Hsiang–Siebenmann decomposition of the Whitehead group K ₁(A[z,z^-1]) of a twisted Laurent polynomial extension A[z,z^-1] of a ring A is generalized to a decomposition of the Whitehead group K ₁(A((z))) of a twisted Novikov ring of power series A((z))=A[[z]][z^-1]. The decomposition involves a summand W₁(A, ) which is an Abelian quotient of the multiplicative group W(A,) of Witt vectors 1+a₁z+a₂z²+ ··· A[[z]]. An example is constructed to show that in general the natural surjection W(A, )^ab W₁(A, ) is not an isomorphism.     

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.     

The Length of the Longest Head-Run in a Model with Long Range Dependence

In this paper, we construct stationary sequences of random variables { _i : i0} taking values ±1 with probability 1/2 and we prove an Erdös–Rényi law of large numbers for the length of the longest run of consecutive +1's in the sample {₀,..., _n }. Our model, which is called random walk in random scenery, exhibits long-range, positive dependence.     

A preconditioner for constrained and weighted least squares problems with Toeplitz structure

We study methods for solving the constrained and weighted least squares problem min _x by the preconditioned conjugate gradient (PCG) method. HereW = diag (₁, , _m ) with _{1 m} 0, andA ^T = [T ₁ ^T , ,T _k ^T ] with Toeplitz blocksT _l R ^{n × n} ,l = 1, ,k. It is well-known that this problem can be solved by solving anaugmented linear 2 × 2 block linear systemM +Ax =b, A ^T = 0, whereM =W ^–1. We will use the PCG method with circulant-like preconditioner for solving the system. We show that the spectrum of the preconditioned matrix is clustered around one. When the PCG method is applied to solve the system, we can expect a fast convergence rate.Research supported by HKRGC grants no. CUHK 178/93E and CUHK 316/94E.     

The Eta Invariant and the Real Connective K-Theory of the Classifying Space for Quaternion Groups

We express the real connective K-theory groups o_4k–1(B Q ) ofthe quaternion group Q of order = 2 ^j 8 in terms of therepresentation theory of Q by showing o_4k–1(B Q ) = Sp(S ^4k+3/Q )where is any fixed point free representation of Q in U(2k + 2).     

Bergman-Vekua theory in differential form

We develop Bergman-Vekua integral operator theory on the basis of a new kind of series suggested by polynomial operators (classP _j operators); in a sense, this is an analog of the Weierstrass approach as opposed to the Cauchy-Riemann approach in classical complex analysis, which also has advantages over the original form in boundary value problems and other applications.Dedicated to the memory of my friend, Peter Henrici     

Isometries of symmetric operator spaces associated with AFD factors of typeII and symmetric vector-valued spaces

If is a surjective isometry of the separable symmetric operator spaceE(M, ) associated with the approximately finite-dimensional semifinite factorM and if · _E(M,) is not proportional to · _{L 2}, then there exist a unitary operatorUM and a Jordan automorphismJ ofM such that(x)=UJ(x) for allxME(M, ). We characterize also surjective isometries of vector-valued symmetric spacesF((0, 1), E(M, )).Research supported by the Australian Research Council     

Galerkin methods for parabolic equations with nonlinear boundary conditions

A variety of Galerkin methods are studied for the parabolic equationu _t =(a(x) u),x ⁿ ,t (O,T], subject to the nonlinear boundary conditionu _v =g(x,t,u),x,t (O,T] and the usual initial condition. Optimal order error estimates are derived both inL ² () andH ¹ () norms for all methods treated, including several that produce linear computational procedures.The authors were partially supported by The National Science Foundation during the preparation of this paper.     

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.     

Zur Interpolation und Integration differenzierbarer periodischer Funktionen

Summary Letx ₀<x ₁<...<x _n–1<x ₀+2 be nodes having multiplicitiesv ₀,...,v _n–1, 1v _k r (0k<n). We approximate the evaluation functional ,x fixed, and the integral respectively by linear functionals of the form and determine optimal weights for the Favard classesW _r C ₂. In the even case of optimal interpolation these weights are unique except forr=1,x(x _k +x _k–1)/2 mod 2. Moreover we get periodic polynomial splinesw _{k, j} (0k<n, 0j<v _k ) of orderr such that are the optimal weights. Certain optimal quadrature formulas are shown to be of interpolatory type with respect to these splines. For the odd case of optimal interpolation we merely have obtained a partial solution.

Bojanov hat in [4, 5] ähnliche Resultate wie wir erzielt. Um Wiederholungen zu vermeiden, werden Resultate, deren Beweise man bereits in [4, 5] findet, nur zitiert     

On the mean ergodic theorem for weighted averages

Summary Let (, , P) be a probability space and let T be a measurable and measure preserving point transformation from into . Let f be a measurable and square integrable function on (, , P), and let a _N,k for N, K=0, 1, ... be such that for all N. The authors investigate conditions on the a _N,k 's such that the sequence converges in mean square for all (, , P, T) and f described above. The special cases T weakly mixing and T strongly mixing are also considered.Research partially sponsored by the Air Force Office of scientific Research, Office of Aerospace Research, United States Air Force, under Grant No. AFOSR-68-1394.Research done while this author held a National Science Foundation Traineeship at the University of Missouri, Columbia.