Search results for "CALL"

showing 10 items of 2320 documents

Shrinking and boundedly complete Schauder frames in Fréchet spaces

2014

We study Schauder frames in Fréchet spaces and their duals, as well as perturbation results. We define shrinking and boundedly complete Schauder frames on a locally convex space, study the duality of these two concepts and their relation with the reflexivity of the space. We characterize when an unconditional Schauder frame is shrinking or boundedly complete in terms of properties of the space. Several examples of concrete Schauder frames in function spaces are also presented.

Discrete mathematicsMathematics::Functional AnalysisPure mathematicsShrinkingReflexivitySchauder basisFunction space(LB)-spacesApplied MathematicsMathematics::Analysis of PDEsConvex setMathematics::General TopologyFréchet spacesSchauder basisAtomic decompositionSchauder fixed point theoremSchauder frameLocally convex spacesLocally convex topological vector spaceBoundedly completeDual polyhedronAtomic decompositionMATEMATICA APLICADAAnalysisMathematics
researchProduct

Rearrangement and convergence in spaces of measurable functions

2007

We prove that the convergence of a sequence of functions in the space of measurable functions, with respect to the topology of convergence in measure, implies the convergence -almost everywhere ( denotes the Lebesgue measure) of the sequence of rearrangements. We obtain nonexpansivity of rearrangement on the space , and also on Orlicz spaces with respect to a finitely additive extended real-valued set function. In the space and in the space , of finite elements of an Orlicz space of a -additive set function, we introduce some parameters which estimate the Hausdorff measure of noncompactness. We obtain some relations involving these parameters when passing from a bounded set of , or , to th…

Discrete mathematicsMathematics::Functional AnalysisSequenceConvergence in measureLebesgue measureMeasurable functionlcsh:MathematicsApplied Mathematicslcsh:QA1-939Space (mathematics)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESSet functionData_FILESDiscrete Mathematics and CombinatoricsHausdorff measureAlmost everywhereAnalysisMathematics
researchProduct

Compactness of time-frequency localization operators on L2(Rd)

2006

Abstract In this paper, we consider localization operators on L 2 ( R d ) defined by symbols in a subclass of the modulation space M ∞ ( R 2 d ) . We show that these operators are compact and that this subclass is “optimal” for compactness.

Discrete mathematicsModulation spaceCompact operatorApproximation propertyShort-time Fourier transformModulation spaceLocalization operatorOperator theoryCompact operatorCompact operator on Hilbert spaceSubclassCompact spaceTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESShort-time Fourier transformAnalysisComputer Science::Formal Languages and Automata TheoryMathematicsJournal of Functional Analysis
researchProduct

Semi-compatible and reciprocally continuous maps in weak non-Archimedean Menger PM-spaces

2012

In this paper, we introduce semi-compatible maps and reciprocally continuous maps in weak non-Archimedean PM-spaces and establish a common fixed point theorem for such maps. Moreover, we show that, in the context of reciprocal continuity, the notions of compatibility and semi-compatibility of maps become equivalent. Our result generalizes several fixed point theorems in the sense that all maps involved in the theorem can be discontinuous even at the common fixed point.

Discrete mathematicsNon-Archimedean Menger Space Compatible Semi compatible Weakly compatible Reciprocally continuousWeakly compatibleSettore MAT/05 - Analisi MatematicaGeneral MathematicsCompatibility (mechanics)Common fixed pointFixed-point theoremCommon fixed point theoremReciprocalMathematics
researchProduct

TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES

2013

We examine the minimum amount of memory for real-time, as opposed to one-way, computation accepting nonregular languages. We consider deterministic, nondeterministic and alternating machines working within strong, middle and weak space, and processing general or unary inputs. In most cases, we are able to show that the lower bounds for one-way machines remain tight in the real-time case. Memory lower bounds for nonregular acceptance on other devices are also addressed. It is shown that increasing the number of stacks of real-time pushdown automata can result in exponential improvement in the total amount of space usage for nonregular language recognition.

Discrete mathematicsNondeterministic algorithmTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESUnary operationComputationTheory of computationComputer Science (miscellaneous)Pushdown automatonSpace (mathematics)MathematicsLanguage recognitionExponential functionInternational Journal of Foundations of Computer Science
researchProduct

Finite Groups with Only One NonLinear Irreducible Representation

2012

Let 𝕂 be an algebraically closed field. We classify the finite groups having exactly one irreducible 𝕂-representation of degree bigger than one. The case where the characteristic of 𝕂 is zero, was done by G. Seitz in 1968.

Discrete mathematicsNonlinear systemAlgebra and Number TheoryDegree (graph theory)Irreducible representationZero (complex analysis)Algebraically closed fieldMathematicsCommunications in Algebra
researchProduct

C-Supplemented subgroups of finite groups

2000

A subgroup H of a group G is said to be c-supplemented in G if there exists a subgroup K of G such that HKa G and H\ K is contained in CoreGOHU .W e follow Hall's ideas to characterize the structure of the finite groups in which every subgroup is c-supplemented. Properties of c-supplemented subgroups are also applied to determine the structure of some finite groups.

Discrete mathematicsNormal subgroupCombinatoricsComplement (group theory)Maximal subgroupSubgroupLocally finite groupGeneral MathematicsCharacteristic subgroupIndex of a subgroupFitting subgroupMathematicsGlasgow Mathematical Journal
researchProduct

Lineability of non-differentiable Pettis primitives

2014

Let \(X\) be an infinite-dimensional Banach space. In 1995, settling a long outstanding problem of Pettis, Dilworth and Girardi constructed an \(X\)-valued Pettis integrable function on \([0,1]\) whose primitive is nowhere weakly differentiable. Using their technique and some new ideas we show that \(\mathbf{ND}\), the set of strongly measurable Pettis integrable functions with nowhere weakly differentiable primitives, is lineable, i.e., there is an infinite dimensional vector space whose nonzero vectors belong to \(\mathbf{ND}\).

Discrete mathematicsPettis integralMathematics::Functional AnalysisIntegrable systemGeneral MathematicsBanach space46G10 28B05Functional Analysis (math.FA)Mathematics - Functional AnalysisSet (abstract data type)Dvoretzky's theoremFOS: MathematicsLocally integrable functionDifferentiable functionPettis Integral nowhere differentiable Dvoretzky's theorem lineable spaceableMathematicsVector spaceMonatshefte für Mathematik
researchProduct

The Monadic Quantifier Alternation Hierarchy over Grids and Graphs

2002

AbstractThe monadic second-order quantifier alternation hierarchy over the class of finite graphs is shown to be strict. The proof is based on automata theoretic ideas and starts from a restricted class of graph-like structures, namely finite two-dimensional grids. Considering grids where the width is a function of the height, we prove that the difference between the levels k+1 and k of the monadic hierarchy is witnessed by a set of grids where this function is (k+1)-fold exponential. We then transfer the hierarchy result to the class of directed (or undirected) graphs, using an encoding technique called strong reduction. It is notable that one can obtain sets of graphs which occur arbitrar…

Discrete mathematicsPolynomial hierarchyDirected graphMonadic predicate calculusAutomatonTheoretical Computer ScienceComputer Science ApplicationsCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and MathematicsAnalytical hierarchyComplexity classAutomata theoryGraph propertyMathematicsInformation SystemsInformation and Computation
researchProduct

Bounded elements of C*-inductive locally convex spaces

2013

The notion of bounded element of C*-inductive locally convex spaces (or C*-inductive partial *-algebras) is introduced and discussed in two ways: The first one takes into account the inductive structure provided by certain families of C*-algebras; the second one is linked to the natural order of these spaces. A particular attention is devoted to the relevant instance provided by the space of continuous linear maps acting in a rigged Hilbert space.

Discrete mathematicsPositive elementApplied Mathematics010102 general mathematicsMathematics - Operator AlgebrasRigged Hilbert spaceMathematics - Rings and AlgebrasLF-spaceSpace (mathematics)01 natural sciencesOperator spaceBounded operatorBounded elements Inductive limit of C*-algebras Partial *-algebras010101 applied mathematics47L60 47L40Rings and Algebras (math.RA)Bounded functionLocally convex topological vector spaceFOS: Mathematics0101 mathematicsOperator Algebras (math.OA)Mathematics
researchProduct