Search results for "Idempotence"

showing 3 items of 3 documents

On the spectrum of linear combinations of two projections inC*-algebras

2010

In this note, we study the spectrum and give estimations for the spectral radius of linear combinations of two projections in C*-algebras. We also study the commutator of two projections.

CombinatoricsCommutatorAlgebra and Number TheorySpectral radiusSpectrum (functional analysis)IdempotenceLinear combinationProjection (linear algebra)MathematicsLinear and Multilinear Algebra
researchProduct

Precise bounds for the sequential order of products of some Fréchet topologies

1998

Abstract The sequential order of a topological space is the least ordinal for which the corresponding iteration of the sequential closure is idempotent. Lower estimates for the sequential order of the product of two regular Frechet topologies and upper estimates for the sequential order of the product of two subtransverse topologies are given in terms of their fascicularity and sagittality. It is shown that for every countable ordinal α, there exists a Lasnev topology such that the sequential order of its square is equal to α.

Discrete mathematicsClosure (topology)Topological spaceSequential spaceSquare (algebra)CombinatoricsProduct (mathematics)IdempotenceOrder (group theory)Countable setGeometry and TopologySequential orderFréchet (Fréchet-Urysohn) topologyProductMathematicsTopology and its Applications
researchProduct

Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages

2011

We study the recognition of R-trivial idempotent (R1) languages by various models of "decide-and-halt" quantum finite automata (QFA) and probabilistic reversible automata (DH-PRA). We introduce bistochastic QFA (MM-BQFA), a model which generalizes both Nayak's enhanced QFA and DH-PRA. We apply tools from algebraic automata theory and systems of linear inequalities to give a complete characterization of R1 languages recognized by all these models. We also find that "forbidden constructions" known so far do not include all of the languages that cannot be recognized by measure-many QFA.

Discrete mathematicsNested wordIdempotenceQuantum finite automataAutomata theoryComputer Science::Computational ComplexityAlgebraic numberω-automatonCharacterization (mathematics)Computer Science::Formal Languages and Automata TheoryMathematicsAutomaton
researchProduct