Classification of scalar third order ordinary differential equations linearizable via generalized contact transformations

Whereas Lie had linearized scalar second order ordinary differential equations (ODEs) by point transformations, and later Chern had extended to the third order by using contact transformation, till recently no work had been done for higher order (or systems) of ODEs. Lie had found a unique class defined by the number of infinitesimal symmetry generators but the more general ODEs were not so classified. Recently, classifications of higher order and systems of ODEs were provided. In this paper we relate contact symmetries of scalar ODEs with point symmetries of reduced systems. We define a new type of transformation that builds upon this relation and obtain equivalence classes of scalar third order ODEs linearizable via these transformations. Four equivalence classes of such equations are seen to exist.     

Some subordination results for classes of analytic functions defined by the Al-Oboudi–Al-Amoudi operator

In this paper, we investigate several interesting subordination results of some classes of analytic functions defined by means of the Al-Oboudi–Al-Amoudi operator. Received: 15 August 2008, Revised: 19 November 2008     

A classification of invariant distributions and convergence of imprecise Markov chains

We analyse the structure of imprecise Markov chains and study their convergence by means of accessibility relations. We first identify the sets of states, so-called minimal permanent classes, that are the minimal sets capable of containing and preserving the whole probability mass of the chain. These classes generalise the essential classes known from the classical theory. We then define a class of extremal imprecise invariant distributions and show that they are uniquely determined by the values of the upper probability on minimal permanent classes. Moreover, we give conditions for unique convergence to these extremal invariant distributions.     

A new optimal algorithm for weighted approximation and integration over ℝ

The complexities of weighted approximation and weighted integration problems for univariate functions defined over ℝ have recently been found in [7]. Complexity (almost) optimal algorithms have also been provided therein. In this paper, we propose another class of (almost) optimal algorithms that, for a number of instances, are easier to implement. More importantly, these new algorithms have a cost smaller than the original algorithms from [7]. Since both classes of algorithms are (almost) optimal, their costs differ by a multiplicative constant that depends on the specific weight functions and the error demand. In one of our tests we observed this constant to be as large as four, which means a cost reduction by a factor of four. This revised version was published online in June 2006 with corrections to the Cover Date.     

A minimal stabilisation procedure for mixed finite element methods

Summary. Stabilisation methods are often used to circumvent the difficulties associated with the stability of mixed finite element methods. Stabilisation however also means an excessive amount of dissipation or the loss of nice conservation properties. It would thus be desirable to reduce these disadvantages to a minimum. We present a general framework, not restricted to mixed methods, that permits to introduce a minimal stabilising term and hence a minimal perturbation with respect to the original problem. To do so, we rely on the fact that some part of the problem is stable and should not be modified. Sections 2 and 3 present the method in an abstract framework. Section 4 and 5 present two classes of stabilisations for the inf-sup condition in mixed problems. We present many examples, most arising from the discretisation of flow problems. Section 6 presents examples in which the stabilising terms is introduced to cure coercivity problems. Received August 9, 1999 / Revised version received May 19, 2000 / Published online March 20, 2001     

Comparing tail variabilities of risks by means of the excess wealth order

There is a growing interest in the actuarial community in employing certain tail conditional characteristics as measures of risk, which are informative about the variability of the losses beyond the value-at-risk (one example is the tail conditional variance, introduced by Furman and Landsman (2006a, 2006b)). However, comparisons of tail risks based on different measures may not always be consistent. In addition, conclusions based on these conditional characteristics depend on the choice of the tail probability p, so different p’s also may produce contradictory conclusions. In this note, we suggest comparing tail variabilities of risks by means of the excess wealth order, which makes judgments only if large classes of tail conditional characteristics imply the same conclusion, independently of the choice of p.     

NP for Combinatorialists

We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows and by finitely many forbidden colored subgraphs.Our characterization is motivated by the analysis of syntactical subclasses with the full computational power of NP, which were first studied by Feder and Vardi. Our approach applies to many combinatorial problems and it induces the characterization of coloring problems (CSP) defined by means of shadows. This turns out to be related to dualities. We apply this in the anlysis of local chromatic number. Particularly, we show a surprising richness of coloring problems when restricted to most frequent graph classes. Even for bounded expansion classes (which include bounded degree and proper minor closed classes) holds that the restriction of every class defined as the shadow of finitely many colored subgraphs equals to the restriction of a coloring (CSP) class.     

SPECIAL RADICALS OF NEAR-RING MODULES

Abstract

Equiprime near-rings, which generalize the concept of prime-ness in rings, were defined by the present authors, together with S. Veldsman. This concept was shown in subsequent work to lead to a very satisfactory theory of special radicals for near-rings. In the current paper, we define equiprime N-groups for a near-ring N. It is shown that an ideal A of N is equiprime if and only if it is the annihilator of an equiprime TV-group G. Special classes of near-ring modules are defined, and a module-theoretic characterization of special radicals of near-rings is established, similar to that given by Andrunakievich and Rjabuhin for special radicals of rings.     

Szegö and Bergman projections on non-smooth planar domains

We establish L^p regularity for the Szegö and Bergman projections associated to a simply connected planar domain in any of the following classes: vanishing chord arc; Lipschitz; Ahlfors-regular; or local graph (for the Szegö projection to be well defined, the local graph curve must be rectifiable). As applications, we obtain L^p regularity for the Riesz transforms, as well as Sobolev space regularity for the non-homogeneous Dirichlet problem associated to any of the domains above and, more generally, to an arbitrary proper simply connected domain in the plane.     

On a family of singular measures related to Minkowski's?(x) function

In the present paper we are investigating a certain point measure of a distribution function arising in a paper by Grabner et al. [Combinatorica 22 (2002) 245-267]. This distribution function is defined by means of the subtractive Euclidean algorithm and bears a striking resemblance to the singular?(x)-function of H. Minkowski. Beyond it, we will also consider a whole family of distribution functions arising in a natural way from the above ones. Nevertheless we will prove that all of the corresponding measures of the mentioned functions are mutually singular by using dynamical systems and the ergodic theorem.     

Rearrangement transformations on general measure spaces

For a general set transformation R between two measure spaces, we define the rearrangement of a measurable function by means of the Layer's cake formula. We study some functional properties of the Lorentz spaces defined in terms of R, giving a unified approach to the classical rearrangement, Steiner's symmetrization, the multidimensional case, and the discrete setting of trees.     

Some classes of analytic and multivalent functions involving a linear operator

By using a linear operator, which is defined here by means of the Hadamard product (or convolution), the authors introduce some new classes of analytic and multivalent functions in the open unit disk and investigate their inclusion relationships and convolution properties. Integral transforms of functions in these classes are also discussed.     

Classes of meromorphically multivalent functions associated with the generalized hypergeometric function

Making use of a linear operator, which is defined here by means of a Hadamard product (or convolution) involving the generalized hypergeometric function, the authors introduce and investigate the various properties and characteristics of two novel classes of meromorphically multivalent functions. They also apply the familiar concept of neighborhoods of analytic functions to these classes of meromorphically multivalent functions.     

Convergence Rates of Adaptive Methods,Besov Spaces,and Multilevel Approximation

This paper concerns characterizations of approximation classes associated with adaptive finite element methods with isotropic h-refinements. It is known from the seminal work of Binev, Dahmen, DeVore and Petrushev that such classes are related to Besov spaces. The range of parameters for which the inverse embedding results hold is rather limited, and recently, Gaspoz and Morin have shown, among other things, that this limitation disappears if we replace Besov spaces by suitable approximation spaces associated with finite element approximation from uniformly refined triangulations. We call the latter spaces multievel approximation spaces and argue that these spaces are placed naturally halfway between adaptive approximation classes and Besov spaces, in the sense that it is more natural to relate multilevel approximation spaces with either Besov spaces or adaptive approximation classes, than to go directly from adaptive approximation classes to Besov spaces. In particular, we prove embeddings of multilevel approximation spaces into adaptive approximation classes, complementing the inverse embedding theorems of Gaspoz and Morin. Furthermore, in the present paper, we initiate a theoretical study of adaptive approximation classes that are defined using a modified notion of error, the so-called total error, which is the energy error plus an oscillation term. Such approximation classes have recently been shown to arise naturally in the analysis of adaptive algorithms. We first develop a sufficiently general approximation theory framework to handle such modifications, and then apply the abstract theory to second-order elliptic problems discretized by Lagrange finite elements, resulting in characterizations of modified approximation classes in terms of memberships of the problem solution and data into certain approximation spaces, which are in turn related to Besov spaces. Finally, it should be noted that throughout the paper we paid equal attention to both conforming and non-conforming triangulations.     

CLASSES OF CONNECTIONS ASSOCIATED WITH DISTRIBUTIONS ON PRODUCT SPACES

Abstract

It is assumed that an n-dimensional distribution is given on an (n+M)-dimensional product space. The latter is endowed with a connection, by means of which the covariant exterior derivatives of the functions that specify the distribution are defined. It is postulated that the connection be such that these derivatives vanish identically. This gives rise to an analysis of the integrability conditions associated with the distribution in terms of appropriate torsion and curvature 2-forms. A further specialization of the connection leads to Edelen's theory [1] of distributions on spaces of fibres.     

Fuzzy Horn logic II

The paper studies closure properties of classes of fuzzy structures defined by fuzzy implicational theories, i.e. theories whose formulas are implications between fuzzy identities. We present generalizations of results from the bivalent case. Namely, we characterize model classes of general implicational theories, finitary implicational theories, and Horn theories by means of closedness under suitable algebraic constructions.     

Cancellation properties in ideal systems: A classification of e.a.b. semistar operations

We give a classification of e.a.b. semistar (and star) operations by defining four different (successively smaller) distinguished classes. Then, using a standard notion of equivalence of semistar (and star) operations to partition the collection of all e.a.b. semistar (or star) operations, we show that there is exactly one operation of finite type in each equivalence class and that this operation has a range of nice properties. We give examples to demonstrate that the four classes of e.a.b. semistar (or star) operations we defined can all be distinct. In particular, we solve the open problem of showing that a.b. is really a stronger condition than e.a.b.     

A Zienkiewicz-type finite element applied to fourth-order problems

This paper deals with convergence analysis and applications of a Zienkiewicz-type (Z-type) triangular element, applied to fourth-order partial differential equations. For the biharmonic problem we prove the order of convergence by comparison to a suitable modified Hermite triangular finite element. This method is more natural and it could be applied to the corresponding fourth-order eigenvalue problem. We also propose a simple postprocessing method which improves the order of convergence of finite element eigenpairs. Thus, an a posteriori analysis is presented by means of different triangular elements. Some computational aspects are discussed and numerical examples are given.     

A systematization of convexity and quasiconvexity concepts for set-valued maps,defined by l-type and u-type preorder relations

Abstract

In this paper, we study different classes of generalized convex/quasiconvex set-valued maps, defined by means of the l-type and u-type preorder relations, currently used in set-valued optimization. In particular, we identify those classes of set-valued maps for which it is possible to extend the classical characterization of convex real-valued functions by quasiconvexity of their affine perturbations.     

Residue currents and ideals of holomorphic functions

We define a residue current of a holomorphic mapping, or more generally of a holomorphic section of a holomorphic vector bundle, by means of Cauchy-Fantappie-Leray type formulas, and prove that a holomorphic function that annihilates this current belongs to the corresponding ideal locally. We also prove that the residue current coincides with the Coleff-Herrera current in the case of a complete intersection. The residue current is globally defined and this is used in some geometric applications. By means of the residue current we also construct, for an arbitrary ideal, an integral formula for interpolation and division.