Mapping Properties of the Laplacian in Sobolev Spaces of Forms on Complete Hyperbolic Manifolds

For a complete manifold M with constant negative curvature, weprove that the rough Laplacian _R defines topological isomorphisms in the scale of Sobolev spaces H _p ^s (M) ofp-forms for all p, 0 < p< n. For the de Rham Laplacian and M= ⁿ , the Poincaréhyperbolic space, this is shown too for 0 pn,pn/2, p (n± 1)/2.     

The (Δ,d,d′, Δ − 1)-problem with applications to computer networks

The (,d, d, – 1)-problem is that of finding large graphs with maximum degree and diameterd such that the subgraphs obtained by deleting any set of up to – 1 vertices have diameterd. In this paper, we deduce upper bounds on the order of such graphs and present some of the largest known ones. We argue that these graphs can be used to construct extremely "robust" networks, and explain why we require this robustness property when designing transputer networks for certain applications. In particular, we investigate the suitability of the odd graphO ₄ as a topology for such networks.     

Infinite highly arc transitive digraphs and universal covering digraphs

A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group is transitive on the set ofs-arcs for eachs0. Several new constructions are given of infinite highly arc transitive digraphs. In particular, for a connected, 1-arc transitive, bipartite digraph, a highly arc transitive digraphDL() is constructed and is shown to be a covering digraph for every digraph in a certain classD() of connected digraphs. Moreover, if is locally finite, thenDL() is a universal covering digraph forD(). Further constructions of infinite highly arc transitive digraphs are given.The second author wishes to acknowledge the hospitality of the Mathematical Institute of the University of Oxford, and the University of Auckland, during the period when the research for this paper was doneResearch supported by the Australian Research Council     

On the asymptotic equivalence ofL pmetrics for convergence to normality

Summary This paper is concerned with the rate of convergence to zero of theL _pmetrics _np1p, constructed out of differences between distribution functions, for departure from normality for normed sums of independent and identically distributed random variables with zero mean and unit variance. It is shown that the _np are, under broad conditions, asymptotically equivalent in the strong sense that, for 1p, p, _np/_np is universally bounded away from zero and infinity asn.     

Nonconforming finite element methods for eigenvalue problems in linear plate theory

The paper deals with nonconforming finite element methods for approximating fourth order eigenvalue problems of type ² w=w. The methods are handled within an abstract Hilbert space framework which is a special case of the discrete approximation schemes introduced by Stummel and Grigorieff. This leads to qualitative spectral convergence under rather weak conditions guaranteeing the basic properties of consistency and discrete compactness for the nonconforming methods. Further asymptotic error estimates for eigenvalues and eigenfunctions are derived in terms of the given orders of approximability and nonconformity. These results can be applied to various nonconforming finite elements used by Adini, Morley, Zienkiewicz, de Veubeke e.a. This is carried out for the simple elements of Adini and Morley and is illustrated by some numerical results at the end.     

Inequalities for Green Functions in a Dini-Jordan Domain in R2

We establish inequalities for Green functions of Dini-smooth Jordan domains in R².We give a version of the 3G theorem for these domains. With the help of these results, we prove comparison theorems between the Green kernel of and the Green kernel of – where is a nonnegative Radon measure.     

A General Decomposition Construction for Incomplete Secret Sharing Schemes

A secret sharing scheme for an incomplete access structure (,) is a method of distributing information about a secret among a group of participants in such a way that sets of participants in can reconstruct the secret and sets of participants in can not obtain any new information about the secret. In this paper we present a more precise definition of secret sharing schemes in terms of information theory, and a new decomposition theorem. This theorem generalizes previous decomposition theorems and also works for a more general class of access structures. We demonstrate some applications of the theorem.     

Construction of po-groups with quasi-divisors theory

A method is presented making it possible to construct po-groups with a strong theory of quasi-divisors of finite character and with some prescribed properties as subgroups of restricted Hahn groups H(, ), where are finitely atomic root systems. Some examples of these constructions are presented.     

Categories of algebraic sets

The category of algebraic sets is defined in a straightforward way for any algebraic theory . It is a concrete, complete and cocomplete category dually equivalent to a full reflective subcategory of the category of -algebras. For the algebraic theory of commutative algebras over a field K, we get the algebraic sets over K.     

On the distribution of square-full and cube-full integers

LetN _r (x) be the number ofr-full integers x and let _r (x) be the error term in the asymptotic formula forN _r (x). Under Riemann's hypothesis, we prove the estimates ₂(x)x^1/7+, ₃(x)x^97/804+(>0), which improve those of Cao and Nowak. We also investigate the distribution ofr-full andl-free numbers in short intervals (r=2,3). Our results sharpen Krätzel's estimates.     

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.     

Implicit elliptic boundary-value problems with discontinuous nonlinearities

Let be a bounded domain in ⁿ (n3) having a smooth boundary, let be an essentially bounded real-valued function defined on × ^h, and let be a continuous real-valued function defined on a given subset Y of Y ^h. In this paper, the existence of strong solutions u W ^2,p (, ^h) W _o ^1,p (n/2<p<+) to the implicit elliptic equation (–u)=(x,u), with u=(u₁, u₂, ..., u_h) and u=(u ₁, u ₂, ..., u _h), is established. The abstract framework where the problem is placed is that of set-valued analysis.     

The differential form spectrum of hyperbolic space

Let Hⁿ⁺¹ denote the simply connected complete space of constant curvature –1. The Laplacian , acting on square integrable p-forms of H, is identified up to unitary equivalence.     

О предельном распределении для сумм независимых слууайных велиуин на бикомпактных коммутативных топологиуеских группах

,      

Shape-preserving Kolmogorov widths of classes of <Emphasis Type="Italic">s</Emphasis>-monotone integrable functions

Let s ₀ and let ₊ ^s be the set of functions x defined on a finite interval I and such that, for all collections of s + 1 pairwise different points t ₀,..., t _s I, the corresponding divided differences [x; t ₀,...,t _s ] of order s are nonnegative. Let ₊ ^s B _{p +} ^s B _p, 1 p where B _p is a unit ball in the space L _p, and let ₊ ^s L _{q +} ^s L _q, 1 q . For every s 3 and 1 q p , we determine the exact orders of the shape-preserving Kolmogorov widths {x - y} \right\ L_q , $$]]>, where M ⁿ is the collection of all affine linear manifolds M ⁿ in L _q such that dim M ⁿ n and M ⁿ ₊ ^s L _q .Translated from Ukrainskyi Matematychnyi Zhurnal, Vol. 56, No. 7, pp. 901–926, July, 2004.     

Colouring a graph frugally

We prove that any graph with maximum degree sufficiently large, has a proper vertex colouring using +1 colours such that each colour class appears at most log⁸ times in the neighbourhood of any vertex. We also show that for 1, the minimum number of colours required to colour any such graph so that each vertex appears at most times in the neighbourhood of any vertex is (+^1+1//), showing in particular that when =log/loglog, such a colouring cannot always be achieved with O() colours. We also provide a polynomial time algorithm to find such a colouring. This has applications to the total chromatic number of a graph.The second two authors were supported by NATO Collaborative Research Grant #CRG950235.     

On graphical partitions

An integer partition {₁,₂,..., _v } is said to be graphical if there exists a graph with degree sequence _i . We give some results corcerning the problem of deciding whether or not almost all partitions of even integer are non-graphical. We also give asymptotic estimates for the number of partitions with given rank.     

Cone Adaptation Strategies for a Finite and Exact Cutting Plane Algorithm for Concave Minimization

In this paper we are concerned with pure cutting plane algorithms for concave minimization. One of the most common types of cutting planes for performing the cutting operation in such algorithm is the concavity cut. However, it is still unknown whether the finite convergence of a cutting plane algorithm can be enforced by the concavity cut itself or not. Furthermore, computational experiments have shown that concavity cuts tend to become shallower with increasing iteration. To overcome these problems we recently proposed a procedure, called cone adaptation, which deepens concavity cuts in such a way that the resulting cuts have at least a certain depth with 0, where is independent of the respective iteration, which enforces the finite convergence of the cutting plane algorithm. However, a crucial element of our proof that these cuts have a depth of at least was that we had to confine ourselves to -global optimal solutions, where is a prescribed strictly positive constant. In this paper we examine possible ways to ensure the finite convergence of a pure cutting plane algorithm for the case where = 0.     

Bijectivity of -endomorphisms of ℬ(H) and the unilateral shift

LetH be a separable infinite-dimensional complex Hilbert space. We prove that if : (H)(H) is a^*-preserving ring homomorphism whose range contains a rank-one operator and an operator with dense range, then is an isometric linear or conjugate-linear algebra automorphism of (H). In particular, if the unilateral shift is contained in the range of a^*-endomorphism of (H), then is bijective.Research partially supported by the Hungarian National Research Science Foundation, Operating Grant Number OTKA 1652 and K&H Bank Ltd., Universitas Foundation.     

On the Drinfeld discriminant function

The discriminant function is a certain rigid analytic modularform defined on Drinfelds upper half-plane . Its absolutevalue may be considered as a function on theassociated Bruhat–Tits tree T. We compare log with the conditionally convergent complex-valued Eisenstein series Edefined on T and thereby obtain results about the growth of and of some related modular forms. We further determine to what extent roots may be extracted of (z)/(nz),regarded as a holomorphic function on . In some cases, this enables us to calculate cuspidal divisor class groups of modular curves.