Corrigendum to “Regularity for Stably Projectionless, Simple C ∗ -Algebras”

Peer reviewed

The Herzog-Vasconcelos conjecture for affine semigroup rings

Let S be a simplicial affine semigroup such that its semigroup ring A = k[S] is Buchsbaum. We prove for such A the Herzog-Vasconcelos conjecture: If the A-module Der(k)A of k-linear derivations of A has finite projective dimension then it is free and hence A is a polynomial ring by the well known graded case of the Zariski-Lipman conjecture.

The Ornstein-Uhlenbeck semigroup in exterior domains

Wood, Ian; Geissert, M.; Heck, H.; Hieber, M., (2005) 'The Ornstein-Uhlenbeck semigroup in exterior domains', Archiv der Mathematik 86 pp.554-562 RAE2008

Finite dimensional semigroup quadratic algebras with the minimal number of relations

A quadratic semigroup algebra is an algebra over a field given by the generators x_1, . . . , x_n and a finite set of quadratic relations each of which either has the shape x_j x_k = 0 or the shape x_j x_k = x_l x_m . We prove that a quadratic semigroup algebra given by n generators and d=(n^2+n)/4 relations is always infinite dimensional. This strengthens the Golod–Shafarevich estimate for the above class of algebras. Our main result however is that for every n, there is a finite dimensional quadratic semigroup algebra with n generators and d_n relations, where d_n is the first integer greater than (n^2+n)/4 . That is, the above Golod–Shafarevich-type estimate for semigroup algebras is sharp.

On supercyclicity of operators from a supercyclic semigroup

We show that for every supercyclic strongly continuous operator
semigroup $\{T_t\}_{t\geq 0}$ acting on a complex $\F$-space, every
$T_t$ with $t>0$ is supercyclic. Moreover, the set of supercyclic
vectors of $T_t$ does not depend on the choice of $t>0$.

A study on semigroup action on fuzzy subsets, inverse fuzzy automata and related topics

This thesis comprises five chapters including the introductory chapter. This includes a brief introduction and basic definitions of fuzzy set theory and its applications, semigroup action on sets, finite semigroup theory, its application in automata theory along with references which are used in this thesis. In the second chapter we defined an S-fuzzy subset of X with the extension of the notion of semigroup action of S on X to semigroup action of S on to a fuzzy subset of X using Zadeh's maximal extension principal and proved some results based on this. We also defined an S-fuzzy morphism between two S-fuzzy subsets of X and they together form a category S FSETX. Some general properties and special objects in this category are studied and finally proved that S SET and S FSET are categorically equivalent. Further we tried to generalize this concept to the action of a fuzzy semigroup on fuzzy subsets. As an application, using the above idea, we convert a _nite state automaton to a finite fuzzy state automaton. A classical automata determine whether a word is accepted by the automaton where as a _nite fuzzy state automaton determine the degree of acceptance of the word by the automaton. 1.5. Summary of the Thesis 17 In the third chapter we de_ne regular and inverse fuzzy automata, its construction, and prove that the corresponding transition monoids are regular and inverse monoids respectively. The languages accepted by an inverse fuzzy automata is an inverse fuzzy language and we give a characterization of an inverse fuzzy language. We study some of its algebraic properties and prove that the collection IFL on an alphabet does not form a variety since it is not closed under inverse homomorphic images. We also prove some results based on the fact that a semigroup is inverse if and only if idempotents commute and every L-class or R-class contains a unique idempotent. Fourth chapter includes a study of the structure of the automorphism group of a deterministic faithful inverse fuzzy automaton and prove that it is equal to a subgroup of the inverse monoid of all one-one partial fuzzy transformations on the state set. In the fifth chapter we define min-weighted and max-weighted power automata study some of its algebraic properties and prove that a fuzzy automaton and the fuzzy power automata associated with it have the same transition monoids. The thesis ends with a conclusion of the work done and the scope of further study.

Hyperbolicity of semigroup algebras

Let A be a finite-dimensional Q-algebra and Gamma subset of A a Z-order. We classify those A with the property that Z(2) negated right arrow U(Gamma) and refer to this as the hyperbolic property. We apply this in case A = K S is a semigroup algebra, with K = Q or K = Q(root-d). A complete classification is given when KS is semi-simple and also when S is a non-semi-simple semigroup. (c) 2008 Elsevier Inc. All rights reserved.

HYPERBOLICITY OF SEMIGROUP ALGEBRAS II

In 1996, Jespers and Wang classified finite semigroups whose integral semigroup ring has finitely many units. In a recent paper, Iwaki-Juriaans-Souza Filho continued this line of research by partially classifying the finite semigroups whose rational semigroup algebra contains a Z-order with hyperbolic unit group. In this paper, we complete this classification and give an easy proof that deals with all finite semigroups.

Reversibility properties of semigroup actions on homogeneous spaces

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Constructions of codes through the semigroup ring B[X; 1/2(2)Z(0)] and encoding

For any finite commutative ring B with an identity there is a strict inclusion B[X; Z(0)] subset of B[X; Z(0)] subset of B[X; 1/2(2)Z(0)] of commutative semigroup rings. This work is a continuation of Shah et al. (2011) [8], in which we extend the study of Andrade and Palazzo (2005) [7] for cyclic codes through the semigroup ring B[X; 1/2; Z(0)] In this study we developed a construction technique of cyclic codes through a semigroup ring B[X; 1/2(2)Z(0)] instead of a polynomial ring. However in the second phase we independently considered BCH, alternant, Goppa, Srivastava codes through a semigroup ring B[X; 1/2(2)Z(0)]. Hence we improved several results of Shah et al. (2011) [8] and Andrade and Palazzo (2005) [7] in a broader sense. Published by Elsevier Ltd

A Note on Linear Codes over Semigroup Rings

In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes through the semigroup ring B[X; 1 3Z0] instead of the polynomial ring B[X; Z0], where B is a finite commutative ring with identity, and for these constructions we improve the several results of [1]. After this, we present a decoding principle for BCH, alternant and Goppa codes which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight t ≤ r/2, i.e., whose minimum Hamming distance is r + 1.

Continuity of Lyapunov functions and of energy level for generalized gradient semigroup

The global attractor of a gradient-like semigroup has a Morse decomposition. Associated to this Morse decomposition there is a Lyapunov function (differentiable along solutions)-defined on the whole phase space- which proves relevant information on the structure of the attractor. In this paper we prove the continuity of these Lyapunov functions under perturbation. On the other hand, the attractor of a gradient-like semigroup also has an energy level decomposition which is again a Morse decomposition but with a total order between any two components. We claim that, from a dynamical point of view, this is the optimal decomposition of a global attractor; that is, if we start from the finest Morse decomposition, the energy level decomposition is the coarsest Morse decomposition that still produces a Lyapunov function which gives the same information about the structure of the attractor. We also establish sufficient conditions which ensure the stability of this kind of decomposition under perturbation. In particular, if connections between different isolated invariant sets inside the attractor remain under perturbation, we show the continuity of the energy level Morse decomposition. The class of Morse-Smale systems illustrates our results.