Search results for "value"

On the connectedness of the attainability set for lattice dynamical systems

2012

We prove the Kneser property (i.e. the connectedness and compactness of the attainability set at any time) for lattice dynamical systems in which we do not know whether the property of uniqueness of the Cauchy problem holds or not. Using this property, we can check that the global attractor of the multivalued semiflow generated by such system is connected.

On the behaviour of measures of noncompactness with respect to differentiation and integration of vector-valued functions

1983

An integral for a banach valued function

2009

Abstract Using partitions of the unity ((PU)-partition), a new definition of an integral is given for a function f : [a, b] → X, where X is a Banach space, and it is proved that this integral is equivalent to the Bochner integral.

Total and fractional total colourings of circulant graphs

2008

International audience; In this paper, the total chromatic number and the fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional total chromatic number and for 4-regular circulant graphs we find the total chromatic number for some cases and we give the exact value of the fractional total chromatic number in most cases.

New spaces of matrices with operator entries

2019

In this paper, we will consider matrices with entries in the space of operators $\mathcal{B}(H)$, where $H$ is a separable Hilbert space and consider the class of matrices that can be approached in the operator norm by matrices with a finite number of diagonals. We will use the Schur product with Toeplitz matrices generated by summability kernels to describe such a class and show that in the case of Toeplitz matrices it can be identified with the space of continuous functions with values in $\mathcal B(H)$. We shall also introduce matriceal versions with operator entries of classical spaces of holomorphic functions such as $H^\infty(\mathbb{D})$ and $A(\mathbb{D})$ when dealing with upper t…

Fixed points for multivalued mappings in b-metric spaces

2015

In 2012, Samet et al. introduced the notion ofα-ψ-contractive mapping and gave sufficient conditions for the existence of fixed points for this class of mappings. The purpose of our paper is to study the existence of fixed points for multivalued mappings, under anα-ψ-contractive condition of Ćirić type, in the setting of completeb-metric spaces. An application to integral equation is given.

Guaranteed error bounds for a class of Picard-Lindelöf iteration methods

2013

We present a new version of the Picard-Lindelof method for ordinary dif- ¨ ferential equations (ODEs) supplied with guaranteed and explicitly computable upper bounds of an approximation error. The upper bounds are based on the Ostrowski estimates and the Banach fixed point theorem for contractive operators. The estimates derived in the paper take into account interpolation and integration errors and, therefore, provide objective information on the accuracy of computed approximations. peerReviewed

An approximate Rolle's theorem for polynomials of degree four in a Hilbert space

2005

We show that the fourth degree polynomials that satisfy Rolle’s Theorem in the unit ball of a real Hilbert space are dense in the space of polynomials that vanish in the unit sphere. As a consequence, we obtain a sort of approximate Rolle’s Theorem for those polynomials.

Lehmer code transforms and Mahonian statistics on permutations

2012

Abstract In 2000 Babson and Steingrimsson introduced the notion of vincular patterns in permutations. They show that essentially all well-known Mahonian permutation statistics can be written as combinations of such patterns. Also, they proved and conjectured that other combinations of vincular patterns are still Mahonian. These conjectures were proved later: by Foata and Zeilberger in 2001, and by Foata and Randrianarivony in 2006. In this paper we give an alternative proof of some of these results. Our approach is based on permutation codes which, like the Lehmer code, map bijectively permutations onto subexcedant sequences. More precisely, we give several code transforms (i.e., bijections…

Thin bases of order h

2003

Abstract A subset A⊆ N 0 is called a basis of order h if every positive integer can be represented as a sum of h members of A . Thin bases of order h will be constructed in this paper, for each h ⩾2, where the value of lim sup A(n)/ n h is smaller than that of thin bases known so far. In the most important case h =2 it is shown that for the considered class of bases (which generalizes an ansatz of Stohr) the result is best possible up to an e >0.