نتایج جستجو برای: semigroup algebra

تعداد نتایج: 74993  

2005
R. M. SHORTT F. WEHRUNG

Let A and B be fields of subsets of a nonempty set X and let μ : A → E and ν : B → E be finitely additive measures (“charges”) taking values in a commutative semigroup E. We assume that μ and ν are consistent (e.g. μ = ν on A ∩ B) and ask whether they have a common extension to a charge ρ : A ∨ B → E. Now, we shall see (proposition 2.3) that the most natural consistency condition which we can f...

2010
JOSEPH L. TAYLOR J. L. TAYLOR

Let G denote a locally compact abelian topological group (an l.c.a. group) with dual group C\ We will denote by A7(G) the Banach algebra of bounded regular Borel measures on G under convolution multiplication and by L(G) the algebra of bounded measures absolutely continuous with respect to Haar measure on G (for discussions of these Banach algebras cf. [1], [2], and [5]). In this paper we shall...

2008
DAVID W. KRIBS

We say that a nonselfadjoint operator algebra is partly free if it contains a free semigroup algebra. Motivation for such algebras occurs in the setting of what we call free semigroupoid algebras. These are the weak operator topology closed algebras generated by the left regular representations of semigroupoids associated with finite or countable directed graphs. We expand our analysis of partl...

1998
DAVID M. RILEY MARK C. WILSON

Let K be a field of characteristic p > 0. Denote by ω(R) the augmentation ideal of either a group algebra R = K[G] or a restricted enveloping algebra R = u(L) over K. We first characterize those R for which ω(R) satisfies a polynomial identity not satisfied by the algebra of all 2× 2 matrices over K. Then, we examine those R for which ω(R) satisfies a semigroup identity (that is, a polynomial i...

Journal: :Logica Universalis 2007
Jürg Kohlas Robert F. Stärk

We explore a connection between different ways of representing information in computer science. We show that relational databases, modules, algebraic specifications and constraint systems all satisfy the same ten axioms. A commutative semigroup together with a lattice satisfying these axioms is then called an “information algebra”. We show that any compact consequence operator satisfying the in...

Journal: :IJAC 2006
Marcel Jackson Timothy Stokes

We consider the identities of a variety of semigroup-related algebras modeling the algebra of partial maps. We show that the identities are intimately related to a weak semigroup deductive system and we show that the equational theory is decidable. We do this by giving a term rewriting system for the variety. We then show that this variety has many subvarieties whose equational theory interpret...

Journal: :Des. Codes Cryptography 2006
Carlos Galindo M. Sanchis

We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions given by valuations of 2-dimensional function fields. We show that these order functions are simple when their ordered domains are isomorphic to the value semigroup algebra of the corresponding valuation. Otherwise, we provide...

2005
MICHAEL STARR

Notation 1.1. Let X be a projective variety over an algebraically closed field. For every integer k ≥ 0, denote by Nk(X) the finitely-generated free Abelian group of k-cycles modulo numerical equivalence, and denote by N(X) the k graded piece of the quotient algebra A∗(X)/Num∗(X), cf. [Ful98, Example 19.3.9]. For every Z-module B, denote Nk(X)B := Nk(X)⊗B, resp. N(X)B := N(X)⊗B. Denote by NEk(X...

M. Lashkarizadeh Bami

In the present paper we give a partially negative answer to a conjecture of Ghahramani, Runde and Willis. We also discuss the derivation problem for both foundation semigroup algebras and Clifford semigroup algebras. In particular, we prove that if S is a topological Clifford semigroup for which Es is finite, then H1(M(S),M(S))={0}.

2011
DENIS R. HIRSCHFELDT

Every computable universal algebra has a finitely presented expansion, but there are examples of finitely generated, computably enumerable universal algebras with no finitely presented expansions. It is natural to ask whether such examples can be found in well-known classes of algebras such as groups and semigroups. In this paper, we build an example of a finitely generated, infinite, computabl...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید