Search results for "General Mathematics"

showing 10 items of 3795 documents

Admissible perturbations of alpha-psi-pseudocontractive operators: convergence theorems

2016

In the last decades, the study of convergence of fixed point iterative methods has received an increasing attention, due to their performance as tools for solving numerical problems. As a consequence of this fact, one can access to a wide literature on iterative schemes involving different types of operators; see [2, 4, 5]. We point out that fixed point iterative approximation methods have been largely applied in dealing with stability and convergence problems; see [1, 6]. In particular, we refer to various control and optimization questions arising in pure and applied sciences involving dynamical systems, where the problem in study can be easily arranged as a fixed point problem. Then, we …

Discrete mathematicsDynamical systems theoryIterative methodGeneral Mathematics010102 general mathematicsGeneral EngineeringHilbert spacePerturbation (astronomy)Krasnoselskij type fixed point iterative schemeFixed point01 natural sciences010101 applied mathematicssymbols.namesakeSettore MAT/08 - Analisi Numericaalpha-psi-pseudocontractive operatorFixed point problemSettore MAT/05 - Analisi Matematicaalpha-admissible mappingsymbolsApplied mathematicsIterative approximation0101 mathematicsApplied scienceMathematics
researchProduct

On the operators which are invertible modulo an operator ideal

2001

Atkinson [3] studied the operators which are left invertible $i(X, Y) or right invertible $T{X, Y) modulo /C, with K. the compact operators. He proved that an operator T € C(X, Y) belongs to <£/ or $ r if and only if the kernel and the range of T are complemented and additionally, the kernel is finite dimensional or the range is finite codimensional, respectively. Yood [19] obtained some perturbation results for these classes and Lebow and Schechter [12] proved that the inessential operators form the perturbation class for $,(A") and $r{X). Yang [18] extended some results of ^3, 19] to operators invertible modulo W, with W the weakly compact operators. His aim was to study a generalised Fre…

Discrete mathematicsElliptic operatorWeak operator topologyGeneral MathematicsFinite-rank operatorOperator theoryCompact operatorOperator normStrictly singular operatorMathematicsQuasinormal operatorBulletin of the Australian Mathematical Society
researchProduct

L 2-topological invariants of 3-manifolds

1995

We give results on theL2-Betti numbers and Novikov-Shubin invariants of compact manifolds, especially 3-manifolds. We first study the Betti numbers and Novikov-Shubin invariants of a chain complex of Hilbert modules over a finite von Neumann algebra. We establish inequalities among the Novikov-Shubin invariants of the terms in a short exact sequence of chain complexes. Our algebraic results, along with some analytic results on geometric 3-manifolds, are used to compute theL2-Betti numbers of compact 3-manifolds which satisfy a weak form of the geometrization conjecture, and to compute or estimate their Novikov-Shubin invariants.

Discrete mathematicsExact sequenceMathematics::Operator AlgebrasBetti numberGeneral MathematicsMathematics::Spectral TheoryMathematics::Algebraic TopologyManifoldsymbols.namesakeChain (algebraic topology)Von Neumann algebraGromov–Witten invariantsymbolsAlgebraic numberGeometrization conjectureMathematicsInventiones Mathematicae
researchProduct

Sobolev embeddings, extensions and measure density condition

2008

AbstractThere are two main results in the paper. In the first one, Theorem 1, we prove that if the Sobolev embedding theorem holds in Ω, in any of all the possible cases, then Ω satisfies the measure density condition. The second main result, Theorem 5, provides several characterizations of the Wm,p-extension domains for 1<p<∞. As a corollary we prove that the property of being a W1,p-extension domain, 1<p⩽∞, is invariant under bi-Lipschitz mappings, Theorem 8.

Discrete mathematicsExtension operator010102 general mathematicsEberlein–Šmulian theoremMeasure density condition01 natural sciencesSobolev embeddingSobolev inequality010101 applied mathematicsSobolev spaceCorollarySobolev spaces0101 mathematicsInvariant (mathematics)AnalysisEdge-of-the-wedge theoremSobolev spaces for planar domainsMathematicsTrace operatorJournal of Functional Analysis
researchProduct

Absolutely Convergent Extensions of Nonclosable Positive Linear Functionals

2010

The existence of extensions of a positive linear functional ω defined on a dense *-subalgebra \({\mathfrak{A}_0}\) of a topological *-algebra \({\mathfrak{A}}\), satisfying certain regularity conditions, is examined. The main interest is focused on the case where ω is nonclosable and sufficient conditions for the existence of an absolutely convergent extension of ω are given.

Discrete mathematicsExtensions Positive linear functionalsSettore MAT/05 - Analisi MatematicaPositive linear functionalGeneral MathematicsSubalgebraExtension (predicate logic)Algebra over a fieldMathematics::Representation TheoryAbsolute convergenceMathematicsMediterranean Journal of Mathematics
researchProduct

Lipschitz conditions,b-arcwise connectedness and conformal mappings

1982

Discrete mathematicsExtremal lengthPartial differential equationLipschitz domainFunctional analysisSocial connectednessGeneral MathematicsConformal mapLipschitz continuityAnalysisMathematicsJournal d'Analyse Mathématique
researchProduct

Minimal forbidden words and symbolic dynamics

1996

We introduce a new complexity measure of a factorial formal language L: the growth rate of the set of minimal forbidden words. We prove some combinatorial properties of minimal forbidden words. As main result we prove that the growth rate of the set of minimal forbidden words for L is a topological invariant of the dynamical system defined by L.

Discrete mathematicsFactorial010102 general mathematics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Symbolic dynamicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciencesInvariant (physics)16. Peace & justice01 natural sciencesCombinatorics010201 computation theory & mathematicsTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSInformation complexityFormal language0101 mathematicsComputer Science::Formal Languages and Automata TheoryComputingMilieux_MISCELLANEOUSMathematicsofComputing_DISCRETEMATHEMATICSMathematics
researchProduct

ON THE STAR HEIGHT OF RATIONAL LANGUAGES

1994

Two problems concerning the star height of a rational language are investigated: the star height one problem and the relationships between the unambiguity of an expression and its star height. For this purpose we consider the class of factorial, transitive and rational (FTR) languages. From the algebraic point of view a FTR language is the set of factors of a rational submonoid M. Two subclasses of FTR languages are introduced: renewal languages, corresponding to the case of M finitely generated, and unambiguous renewal languages, corresponding to the case of M finitely generated and free. We prove that a FTR language has star height one if and only if it is renewal. This gives a simple de…

Discrete mathematicsFactorialTransitive relationStar heightGeneral Mathematicsmedia_common.quotation_subjectComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)AmbiguityRegular languageIf and only ifComputer Science::Programming LanguagesEntropy (information theory)Algebraic numberMathematicsmedia_commonInternational Journal of Algebra and Computation
researchProduct

Representation and factorization theorems for almost-Lp-spaces

2019

The first and fourth authors gratefully acknowledge the support of Ministerio de Ciencia, Innovacibn y Universidades (Spain), Agencia Estatal de Investigaciones, and FEDER, under projects MTM2014-53009-P (J.M. Calabuig) and MTM2016-77054-C2-1-P (E.A. Sanchez Perez).

Discrete mathematicsFactorizationGeneral MathematicsBanach lattice010102 general mathematicsRepresentation (systemics)010103 numerical & computational mathematics0101 mathematics01 natural sciencesMathematicsIndagationes Mathematicae
researchProduct

Classical sequences revisited with permutations avoiding dotted pattern

2011

International audience; Inspired by the definition of the barred pattern-avoiding permutation, we introduce the new concept of dotted pattern for permutations. We investigate permutations classes avoiding dotted patterns of length at most 3, possibly along with other classical patterns. We deduce some enumerating results which allow us to exhibit new families of permutations counted by the classical sequences: 2^n, Catalan, Motzkin, Pell, Fibonacci, Fine, Riordan, Padovan, Eulerian.

Discrete mathematicsFibonacci numberMathematics::CombinatoricsApplied Mathematics010102 general mathematicsEulerian path[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesTheoretical Computer ScienceCombinatorics[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]symbols.namesakePermutation[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Computational Theory and Mathematics010201 computation theory & mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]symbolsDiscrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsMathematics
researchProduct