Search results for "Semigroup"

showing 10 items of 96 documents

A pointwise selection principle for metric semigroup valued functions

2008

Abstract Let ∅ ≠ T ⊂ R , ( X , d , + ) be an additive commutative semigroup with metric d satisfying d ( x + z , y + z ) = d ( x , y ) for all x , y , z ∈ X , and X T the set of all functions from T into X . If n ∈ N and f , g ∈ X T , we set ν ( n , f , g , T ) = sup ∑ i = 1 n d ( f ( t i ) + g ( s i ) , g ( t i ) + f ( s i ) ) , where the supremum is taken over all numbers s 1 , … , s n , t 1 , … , t n from T such that s 1 ⩽ t 1 ⩽ s 2 ⩽ t 2 ⩽ ⋯ ⩽ s n ⩽ t n . We prove the following pointwise selection theorem: If a sequence of functions { f j } j ∈ N ⊂ X T is such that the closure in X of the set { f j ( t ) } j ∈ N is compact for each t ∈ T , and lim n → ∞ ( 1 n lim N → ∞ sup j , k ⩾ N , j…

PointwisePointwise convergenceDiscrete mathematicsSequenceSemigroupApplied MathematicsPointwise productInfimum and supremumPointwise convergenceSelection principleMetric semigroupJoint modulus of variationCombinatoricsSubsequenceCommutative propertyDouble sequenceAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Formations of finite monoids and formal languages: Eilenberg’s variety theorem revisited

2014

International audience; We present an extension of Eilenberg's variety theorem, a well-known result connecting algebra to formal languages. We prove that there is a bijective correspondence between formations of finite monoids and certain classes of languages, the formations of languages. Our result permits to treat classes of finite monoids which are not necessarily closed under taking submonoids, contrary to the original theory. We also prove a similar result for ordered monoids.; Nous présentons une extension du théorème des variétés d'Eilenberg, un résultat célèbre reliant l'algèbre à la théorie des langages formels. Nous montrons qu'il existe une correspondance bijective entre les form…

Pure mathematicsApplied MathematicsGeneral MathematicsACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]Abstract family of languagesFormationRegular languagesCone (formal languages)regular languagePumping lemma for regular languagesAlgebravarietyRegular languageÁlgebraMSC 68Q70 20D10 20F17 20M25Mathematics::Category TheoryFormal languageVariety (universal algebra)SemigroupsGroup formationsAutomata theoryMathematics
researchProduct

On lifting the approximation property from a Banach space to its dual

2014

Pure mathematicsApproximation propertyApplied MathematicsGeneral MathematicsMathematical analysisEberlein–Šmulian theoremInfinite-dimensional vector functionBanach spaceInterpolation spaceBanach manifoldC0-semigroupLp spaceMathematicsProceedings of the American Mathematical Society
researchProduct

AUTOMORPHISMS OF THE ENDOMORPHISM SEMIGROUP OF A FREE ASSOCIATIVE ALGEBRA

2007

Let [Formula: see text] be the variety of associative algebras over a field K and A = K 〈x1,…, xn〉 be a free associative algebra in the variety [Formula: see text] freely generated by a set X = {x1,…, xn}, End A the semigroup of endomorphisms of A, and Aut End A the group of automorphisms of the semigroup End A. We prove that the group Aut End A is generated by semi-inner and mirror automorphisms of End A. A similar result is obtained for the automorphism group Aut [Formula: see text], where [Formula: see text] is the subcategory of finitely generated free algebras of the variety [Formula: see text]. The later result solves Problem 3.9 formulated in [17].

Pure mathematicsEndomorphismGroup (mathematics)SemigroupGeneral MathematicsFree algebraAssociative algebraField (mathematics)Variety (universal algebra)AutomorphismMathematicsInternational Journal of Algebra and Computation
researchProduct

Formations of Monoids, Congruences, and Formal Languages

2015

The main goal in this paper is to use a dual equivalence in automata theory started in [25] and developed in [3] to prove a general version of the Eilenberg-type theorem presented in [4]. Our principal results confirm the existence of a bijective correspondence between three concepts; formations of monoids, formations of languages and formations of congruences. The result does not require finiteness on monoids, nor regularity on languages nor finite index conditions on congruences. We relate our work to other results in the field and we include applications to non-r-disjunctive languages, Reiterman s equational description of pseudovarieties and varieties of monoids.

Pure mathematicsGeneral Computer ScienceApplied MathematicsData ScienceCWI Technical Report reportFormationsLlenguatges de programacióAbstract family of languagesCongruence relationlcsh:QA75.5-76.95Formal languagesMathematics::Category TheoryFormal languageComputingMethodologies_DOCUMENTANDTEXTPROCESSINGBijectionAutomata theorylcsh:Electronic computers. Computer scienceÀlgebraEquivalence (formal languages)SemigroupsMATEMATICA APLICADAAlgorithmAutomata theoryMathematicsScientific Annals of Computer Science
researchProduct

An Elementary Proof of a Theorem of Graham on Finite Semigroups

2020

The purpose of this note is to give a very elementary proof of a theorem of Graham that provides a structural description of finite 0-simple semigroups and its idempotent-generated subsemigroups.

Pure mathematicsGeneral Mathematicslcsh:Mathematics0-simple semigroupElementary proofMathematics::Rings and AlgebrasComputer Science (miscellaneous)finite semigroupRegular semigrouplcsh:QA1-939Engineering (miscellaneous)Mathematicsregular semigroupMathematics
researchProduct

A Path-Integral Approach to the Cameron-Martin-Maruyama-Girsanov Formula Associated to a Bilaplacian

2012

We define the Wiener product on a bosonic Connes space associated to a Bilaplacian and we introduce formal Wiener chaos on the path space. We consider the vacuum distribution on the bosonic Connes space and show that it is related to the heat semigroup associated to the Bilaplacian. We deduce a Cameron-Martin quasi-invariance formula for the heat semigroup associated to the Bilaplacian by using some convenient coherent vector. This paper enters under the Hida-Streit approach of path integral.

Pure mathematicsGirsanov theoremArticle SubjectSemigroupMathematics::Operator Algebraslcsh:MathematicsSpace (mathematics)lcsh:QA1-939AlgebraDistribution (mathematics)Product (mathematics)Path integral formulationPath spaceAnalysisMathematicsJournal of Function Spaces and Applications
researchProduct

A Noncommutative Approach to Ordinary Differential Equations

2005

We adapt ideas coming from Quantum Mechanics to develop a non-commutative strategy for the analysis of some systems of ordinary differential equations. We show that the solution of such a system can be described by an unbounded, self-adjoint and densely defined operator H which we call, in analogy with Quantum Mechanics, the Hamiltonian of the system. We discuss the role of H in the analysis of the integrals of motion of the system. Finally, we apply this approach to several examples.

Pure mathematicsPhysics and Astronomy (miscellaneous)General MathematicsIntegrating factorExamples of differential equationsStochastic partial differential equationMethod of quantum characteristicsQuantum evolutionQuantum statistical mechanicsC0-semigroupDifferential algebraic equationSettore MAT/07 - Fisica MatematicaOrdinary differential equationSeparable partial differential equationMathematicsInternational Journal of Theoretical Physics
researchProduct

A C0-Semigroup of Ulam Unstable Operators

2020

The Ulam stability of the composition of two Ulam stable operators has been investigated by several authors. Composition of operators is a key concept when speaking about C0-semigroups. Examples of C0-semigroups formed with Ulam stable operators are known. In this paper, we construct a C0-semigroup (Rt)t&ge

Pure mathematicsPhysics and Astronomy (miscellaneous)General MathematicsMathematicsofComputing_GENERAL02 engineering and technology01 natural sciencesStability (probability)Domain (mathematical analysis)Chebyshev expansion0103 physical sciencescomposition of operatorsData_FILES0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Infinitesimal generatorC0-semigroupNonlinear Sciences::Pattern Formation and SolitonsMathematicsMathematics::Functional Analysis010308 nuclear & particles physicsSemigroupMathematics::Operator Algebraslcsh:MathematicsUlam stabilityComposition (combinatorics)lcsh:QA1-939Nonlinear Sciences::Chaotic Dynamics<i>C</i><sub>0</sub>-semigroupsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESChemistry (miscellaneous)Chebyshev expansion020201 artificial intelligence & image processingSymmetry
researchProduct

Ulam Stability for the Composition of Operators

2020

Working in the setting of Banach spaces, we give a simpler proof of a result concerning the Ulam stability of the composition of operators. Several applications are provided. Then, we give an example of a discrete semigroup with Ulam unstable members and an example of Ulam stable operators on a Banach space, such that their sum is not Ulam stable. Another example is concerned with a C 0 -semigroup ( T t ) t &ge

Pure mathematicsPhysics and Astronomy (miscellaneous)General MathematicsOpen problemBanach space02 engineering and technology01 natural sciencesStability (probability)closed linear subspacescomposition of operators0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)0101 mathematicsNonlinear Sciences::Pattern Formation and SolitonsMathematicsMathematics::Functional AnalysisSemigrouplcsh:Mathematics010102 general mathematicsUlam stabilityComposition (combinatorics)lcsh:QA1-939Nonlinear Sciences::Chaotic Dynamics<i>C</i><sub>0</sub>-semigroupsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESChemistry (miscellaneous)Computer Science::Programming Languages020201 artificial intelligence & image processingSymmetry
researchProduct