Search results for "Theorem"
showing 10 items of 1250 documents
Root-restricted Kleenean rotations
2010
We generalize the Kleene theorem to the case where nonassociative products are used. For this purpose, we apply rotations restricted to the root of binary trees.
On the cardinality of almost discretely Lindelof spaces
2016
A space is said to be almost discretely Lindelof if every discrete subset can be covered by a Lindelof subspace. Juhasz et al. (Weakly linearly Lindelof monotonically normal spaces are Lindelof, preprint, arXiv:1610.04506 ) asked whether every almost discretely Lindelof first-countable Hausdorff space has cardinality at most continuum. We prove that this is the case under $$2^{<{\mathfrak {c}}}={\mathfrak {c}}$$ (which is a consequence of Martin’s Axiom, for example) and for Urysohn spaces in ZFC, thus improving a result by Juhasz et al. (First-countable and almost discretely Lindelof $$T_3$$ spaces have cardinality at most continuum, preprint, arXiv:1612.06651 ). We conclude with a few rel…
A Unifying Approach to Weyl Type Theorems for Banach Space Operators
2013
Weyl type theorems have been proved for a considerably large number of classes of operators. In this paper, by introducing the class of quasi totally hereditarily normaloid operators, we obtain a theoretical and general framework from which Weyl type theorems may be promptly established for many of these classes of operators. This framework also entails Weyl type theorems for perturbations f(T + K), where K is algebraic and commutes with T, and f is an analytic function, defined on an open neighborhood of the spectrum of T + K, such that f is non constant on each of the components of its domain.
Fixed point theory for multivalued generalized nonexpansive mappings
2012
A very general class of multivalued generalized nonexpansive mappings is defined. We also give some fixed point results for these mappings, and finally we compare and separate this class from the other multivalued generalized nonexpansive mappings introduced in the recent literature.
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
Periodic Groups Covered by Transitive Subgroups of Finitary Permutations or by Irreducible Subgroups of Finitary Transformations
1999
Let X be either the class of all transitive groups of finitary permutations, or the class of all periodic irreducible finitary linear groups. We show that almost primitive X-groups are countably recognizable, while totally imprimitive X-groups are in general not countably recognizable. In addition we derive a structure theorem for groups all of whose countable subsets are contained in totally imprimitive X-subgroups. It turns out that totally imprimitive p-groups in the class X are countably recognizable.
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.
Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs
2013
Abstract Given graphs G and H, a vertex coloring c : V ( G ) → N is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ ( H , G ) , is the minimum number of colors in an H-free coloring of G. The H-free chromatic sum of G , Σ ( H , G ) , is the minimum value achieved by summing the vertex colors of each H-free coloring of G. We provide a general bound for Σ ( H , G ) , discuss the computational complexity of finding this parameter for different choices of H, and prove an exact formulas for some graphs G. For every integer k and for every graph H, we construct families of graphs, G k with the property that k more colors than χ ( …
Classification of n-dimensional subvarieties of G(1, 2n) that can be projected to G(1, n + 1)
2005
A structure theorem is given for n-dimensional smooth subvarieties of the Grassmannian G(1, N); with N >= n + 3, that can be isomorphically projected to G(1, n + 1). A complete classification in the cases N = 2n + 1 and N = 2n follows, as a corollary.
Fixed point theory for 1-set contractive and pseudocontractive mappings
2013
The purpose of this paper is to study the existence and uniqueness of fixed point for a class of nonlinear mappings defined on a real Banach space, which, among others, contains the class of separate contractive mappings, as well as to see that an important class of 1-set contractions and of pseudocontractions falls into this type of nonlinear mappings. As a particular case, we give an iterative method to approach the fixed point of a nonexpansive mapping. Later on, we establish some fixed point results of Krasnoselskii type for the sum of two nonlinear mappings where one of them is either a 1-set contraction or a pseudocontraction and the another one is completely continuous, which extend …