Search results for "Regular"

showing 10 items of 855 documents

Groups whose prime graph on conjugacy class sizes has few complete vertices

2012

Abstract Let G be a finite group, and let Γ ( G ) denote the prime graph built on the set of conjugacy class sizes of G. In this paper, we consider the situation when Γ ( G ) has “few complete vertices”, and our aim is to investigate the influence of this property on the group structure of G. More precisely, assuming that there exists at most one vertex of Γ ( G ) that is adjacent to all the other vertices, we show that G is solvable with Fitting height at most 3 (the bound being the best possible). Moreover, if Γ ( G ) has no complete vertices, then G is a semidirect product of two abelian groups having coprime orders. Finally, we completely characterize the case when Γ ( G ) is a regular …

Discrete mathematicsPrime graphStrongly regular graphAlgebra and Number TheoryNeighbourhood (graph theory)Finite groupsCombinatoricsGraph powerWheel graphBound graphPath graphGraph toughnessConjugacy class sizesComplement graphMathematicsJournal of Algebra
researchProduct

Quantum Finite Multitape Automata

1999

Quantum finite automata were introduced by C. Moore, J. P. Crutchfield [4], and by A. Kondacs and J. Watrous [3]. This notion is not a generalization of the deterministic finite automata. Moreover, in [3] it was proved that not all regular languages can be recognized by quantum finite automata. A. Ambainis and R. Freivalds [1] proved that for some languages quantum finite automata may be exponentially more concise rather than both deterministic and probabilistic finite automata. In this paper we introduce the notion of quantum finite multitape automata and prove that there is a language recognized by a quantum finite automaton but not by deterministic or probabilistic finite automata. This …

Discrete mathematicsProbabilistic finite automataFinite-state machineNested wordComputer scienceDeterministic context-free grammarTimed automatonω-automatonNonlinear Sciences::Cellular Automata and Lattice GasesAutomatonMobile automatonNondeterministic finite automaton with ε-movesDeterministic finite automatonDFA minimizationRegular languageDeterministic automatonProbabilistic automatonContinuous spatial automatonAutomata theoryQuantum finite automataTwo-way deterministic finite automatonNondeterministic finite automatonComputer Science::Formal Languages and Automata TheoryQuantum cellular automaton
researchProduct

The existence of best proximity points in metric spaces with the property UC

2009

Abstract Eldred and Veeramani in [A.A. Eldred, P. Veeramani, Existence and convergence of best proximity points, J. Math. Anal. Appl., 323 (2006), 1001–1006. MR2260159] proved a theorem which ensures the existence of a best proximity point of cyclic contractions in the framework of uniformly convex Banach spaces. In this paper we introduce a notion of the property UC and extend the Eldred and Veeramani theorem to metric spaces with the property UC.

Discrete mathematicsProperty (philosophy)Applied MathematicsMathematical analysisBest proximity pointBanach spaceRegular polygonMetric spaceCyclic contractionSettore MAT/05 - Analisi MatematicaConvergence (routing)Point (geometry)Property UCAnalysisMathematics
researchProduct

Marked systems and circular splicing

2007

Splicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. In this paper we introduce a special class of finite circular splicing systems named marked systems. We prove that a marked system S generates a regular circular language if and only if S satisfies a special (decidable) property. As a consequence, we show that we can decide whether a regular circular language is generated by a marked system and we characterize the structure of these regular circular languages.

Discrete mathematicsProperty (programming)Structure (category theory)Molecular computingCircular wordDecidabilityRegular languageIf and only ifRNA splicingFormal languageSplicing systemFormal languageGenerative grammarAutomata theoryMathematics
researchProduct

Highly irregular graphs with extreme numbers of edges

1997

Abstract A simple connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we find: (1) the greatest number of edges of a highly irregular graph with n vertices, where n is an odd integer (for n even this number is given in [1]), (2) the smallest number of edges of a highly irregular graph of given order.

Discrete mathematicsPseudoforestHighly irregular graphEdge-graceful labelingTheoretical Computer ScienceHypercube graphCombinatoricsCycle graphDiscrete Mathematics and CombinatoricsPath graphMultiple edgesComplement graphMathematicsofComputing_DISCRETEMATHEMATICSMathematicsDiscrete Mathematics
researchProduct

Examples of proper k-ball contractive retractions in F-normed spaces

2007

Abstract Assume X is an infinite dimensional F -normed space and let r be a positive number such that the closed ball B r ( X ) of radius r is properly contained in X . The main aim of this paper is to give examples of regular F -normed ideal spaces in which there is a 1-ball or a ( 1 + e ) -ball contractive retraction of B r ( X ) onto its boundary with positive lower Hausdorff measure of noncompactness. The examples are based on the abstract results of the paper, obtained under suitable hypotheses on X .

Discrete mathematicsPure mathematicsApplied Mathematicsρ-Near retractionk-Ball contractionRegular F-normed ideal spaceRetractionHausdorff measure of noncompactnessHausdorff measureBall (mathematics)Hausdorff measure of noncompactneF-spaceAnalysisNormed vector spaceMathematicsJournal of Mathematical Analysis and Applications
researchProduct

General measure theory

1995

Discrete mathematicsPure mathematicsConvex geometryEuclidean spacePoint–line–plane postulateOrdered geometryAffine spaceProduct measureBorel regular measureMeasure (mathematics)Mathematics
researchProduct

Singular Perturbations and Operators in Rigged Hilbert Spaces

2015

A notion of regularity and singularity for a special class of operators acting in a rigged Hilbert space \({\mathcal{D} \subset \mathcal{H}\subset \mathcal{D}^\times}\) is proposed and it is shown that each operator decomposes into a sum of a regular and a singular part. This property is strictly related to the corresponding notion for sesquilinear forms. A particular attention is devoted to those operators that are neither regular nor singular, pointing out that a part of them can be seen as perturbation of a self-adjoint operator on \({\mathcal{H}}\). Some properties for such operators are derived and some examples are discussed.

Discrete mathematicsPure mathematicsGeneral Mathematics010102 general mathematicsHilbert spacePerturbation (astronomy)Rigged Hilbert spaceOperator theorySpecial class01 natural sciencesregular operator010101 applied mathematicssymbols.namesakeOperator (computer programming)Singularityrigged Hilbert spaceSettore MAT/05 - Analisi Matematicasymbolssingular operator0101 mathematicsMathematics
researchProduct

Maximal regularity for Kolmogorov operators in L2 spaces with respect to invariant measures

2006

Abstract We prove an optimal embedding result for the domains of Kolmogorov (or degenerate hypoelliptic Ornstein–Uhlenbeck) operators in L 2 spaces with respect to invariant measures. We use an interpolation method together with optimal L 2 estimates for the space derivatives of T ( t ) f near t = 0 , where T ( t ) is the Ornstein–Uhlenbeck semigroup and f is any function in L 2 .

Discrete mathematicsPure mathematicsSemigroupApplied MathematicsGeneral MathematicsDegenerate energy levelsInvariant measureMathematics::ProbabilityDegenerate Ornstein–Uhlenbeck operatorHypoellipticityHypoelliptic operatorEmbeddingMaximal regularityInvariant (mathematics)MathematicsJournal de Mathématiques Pures et Appliquées
researchProduct

Enumeration of L-convex polyominoes by rows and columns

2005

In this paper, we consider the class of L-convex polyominoes, i.e. the convex polyominoes in which any two cells can be connected by a path of cells in the polyomino that switches direction between the vertical and the horizontal at most once.Using the ECO method, we prove that the number fn of L-convex polyominoes with perimeter 2(n + 2) satisfies the rational recurrence relation fn = 4fn-1 - 2fn-2, with f0 = 1, f1 = 2, f2 = 7. Moreover, we give a combinatorial interpretation of this statement. In the last section, we present some open problems.

Discrete mathematicsRecurrence relationECO methodGeneral Computer SciencePolyominoGenerating functionRegular polygonRow and column spacesTheoretical Computer ScienceInterpretation (model theory)Generating functionsCombinatoricsSection (fiber bundle)Path (graph theory)Convex polyominoesComputer Science(all)MathematicsTheoretical Computer Science
researchProduct