Results 1  10
of
68
Cohomological quotients and smashing localizations
 Amer. J. Math
"... Abstract. The quotient of a triangulated category modulo a subcategory was defined by Verdier. Motivated by the failure of the telescope conjecture, we introduce a new type of quotients for any triangulated category which generalizes Verdier’s construction. Slightly simplifying this concept, the coh ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
Abstract. The quotient of a triangulated category modulo a subcategory was defined by Verdier. Motivated by the failure of the telescope conjecture, we introduce a new type of quotients for any triangulated category which generalizes Verdier’s construction. Slightly simplifying this concept, the cohomological quotients are flat epimorphisms, whereas the Verdier quotients are Ore localizations. For any compactly generated triangulated category S, a bijective correspondence between the smashing localizations of S and the cohomological quotients of the category of compact objects in S is established. We discuss some applications of this theory, for instance the problem of lifting chain complexes along a ring homomorphism. This is motivated by some consequences in algebraic Ktheory and demonstrates the relevance of the telescope
The Realization of InputOutput Maps Using Bialgebras
, 1991
"... We use the theory of bialgebras to provide the algebraic background for state space realization theorems for inputoutput maps of control systems. This allows us to consider from a common viewpoint classical results about formal state space realizations of nonlinear systems and more recent resul ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
We use the theory of bialgebras to provide the algebraic background for state space realization theorems for inputoutput maps of control systems. This allows us to consider from a common viewpoint classical results about formal state space realizations of nonlinear systems and more recent results involving analysis related to families of trees. If H is a bialgebra, we say that p H # is di#erentially produced by the algebra R with the augmentation # if there is right Hmodule algebra structure on R and there exists f h).
Conway's Problem and the commutation of languages
 Bulletin of EATCS
, 2001
"... We survey the known results on two old open problems on commutation of languages. The first problem, raised by Conway in 1971, is asking if the centralizer of a rational language must be rational as well – the centralizer of a language is the largest set of words commuting with that language. The se ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
We survey the known results on two old open problems on commutation of languages. The first problem, raised by Conway in 1971, is asking if the centralizer of a rational language must be rational as well – the centralizer of a language is the largest set of words commuting with that language. The second problem, proposed by Ratoandromanana in 1989, is asking for a characterization of those languages commuting with a given code – the conjecture is that the commutation with codes may be characterized as in free monoids. We present here simple proofs for the known results on these two problems. 1
Smarandache Rings
 MAGNA An international journal
, 2002
"... w. b. vasantha kandasamy smarandache rings a 5 a 3 a 8 a 7 a 16 a 14 a 18 a 1 a 0 a 2 american research press 2002 a 6 a 9 a 10 a 13 a 17 a 11 a 4 a 15 a 12 ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
w. b. vasantha kandasamy smarandache rings a 5 a 3 a 8 a 7 a 16 a 14 a 18 a 1 a 0 a 2 american research press 2002 a 6 a 9 a 10 a 13 a 17 a 11 a 4 a 15 a 12
ASSOCIATIVE CONFORMAL ALGEBRAS WITH FINITE FAITHFUL REPRESENTATION
, 2004
"... Abstract. We describe irreducible conformal subalgebras of CendN and build the structure theory of associative conformal algebras with finite faithful representation. 1. ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
Abstract. We describe irreducible conformal subalgebras of CendN and build the structure theory of associative conformal algebras with finite faithful representation. 1.
ISOMORPHISMS BETWEEN LEAVITT ALGEBRAS AND THEIR MATRIX RINGS
, 2008
"... Abstract. Let K be any field, let Ln denote the Leavitt algebra of type (1, n − 1) having coefficients in K, and let Md(Ln) denote the ring of d × d matrices over Ln. In our main result, we show that Md(Ln) ∼ = Ln if and only if d and n − 1 are coprime. We use this isomorphism to answer a question ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. Let K be any field, let Ln denote the Leavitt algebra of type (1, n − 1) having coefficients in K, and let Md(Ln) denote the ring of d × d matrices over Ln. In our main result, we show that Md(Ln) ∼ = Ln if and only if d and n − 1 are coprime. We use this isomorphism to answer a question posed in [14] regarding isomorphisms between various C*algebras. Furthermore, our result demonstrates that data about the K0 structure is sufficient to distinguish up to isomorphism the algebras in an important class of purely infinite simple Kalgebras.
Commutation Problems on Sets of Words and Formal Power Series
, 2002
"... We study in this thesis several problems related to commutation on sets of words and on formal power series. We investigate the notion of semilinearity for formal power series in commuting variables, introducing two families of series  the semilinear and the bounded series  both natural generaliza ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We study in this thesis several problems related to commutation on sets of words and on formal power series. We investigate the notion of semilinearity for formal power series in commuting variables, introducing two families of series  the semilinear and the bounded series  both natural generalizations of the semilinear languages, and we study their behaviour under rational operations, morphisms, Hadamard product, and difference. Turning to commutation on sets of words, we then study the notions of centralizer of a language  the largest set commuting with a language , of root and of primitive root of a set of words. We answer a question raised by Conway more than thirty years ago  asking whether or not the centralizer of any rational language is rational  in the case of periodic, binary, and ternary sets of words, as well as for rational ccodes, the most general results on this problem. We also prove that any code has a unique primitive root and that two codes commute if and only if they have the same primitive root, thus solving two conjectures of Ratoandromanana, 1989. Moreover, we prove that the commutation with an ccode X can be characterized similarly as in free monoids: a language commutes with X if and only if it is a union of powers of the primitive root of X.