نتایج جستجو برای: ordered monoid

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

Journal: :categories and general algebraic structures with applications 2014
mohammad roueentan majid ershad

in this paper $s$ is a monoid with a left zero and $a_s$ (or $a$) is a unitary right $s$-act. it is shown that a monoid $s$ is right perfect (semiperfect) if and only if every (finitely generated) strongly flat right $s$-act is quasi-projective. also it is shown that if every right $s$-act has a unique zero element, then the existence of a quasi-projective cover for each right act implies that ...

2013
JOACHIM KOCK

We show that if (M,⊗, I) is a monoidal model category then REnd M (I) is a (weak) 2-monoid in sSet. This applies in particular when M is the category of A-bimodules over a simplicial monoid A: the derived endomorphisms of A then form its Hochschild cohomology, which therefore becomes a simplicial 2-monoid.

2006
Rowena Paget

We show that, over an arbitrary field, q-rook monoid algebras are iterated inflations of Iwahori-Hecke algebras, and, in particular, are cellular. Furthermore we give an algebra decomposition which shows a q-rook monoid algebra is Morita equivalent to a direct sum of Iwahori-Hecke algebras. We state some of the consequences for the representation theory of q-rook monoid algebras.

2005
Ganna Kudryavtseva Volodymyr Mazorchuk

We obtain presentations for the Brauer monoid, the partial analogue of the Brauer monoid, and for the greatest factorizable inverse submonoid of the dual symmetric inverse monoid. In all three cases we apply the same approach, based on the realization of all these monoids as Brauer-type monoids.

2012
SAMUELE GIRAUDO

We give a new construction of a Hopf algebra defined first by Reading [Rea05] whose bases are indexed by objects belonging to the Baxter combinatorial family (i.e., Baxter permutations, pairs of twin binary trees, etc.). Our construction relies on the definition of the Baxter monoid, analog of the plactic monoid and the sylvester monoid, and on a RobinsonSchensted-like correspondence and insert...

2009
Zur Izhakian Stuart W. Margolis

We show that the monoid M2(T) of 2 × 2 tropical matrices is a regular semigroup satisfying the semigroup identity A2B4A2A2B2A2B4A2 =A2B4A2B2A2A2B4A2. Studying reduced identities for subsemigroups of M2(T), and introducing a faithful semigroup representation for the bicyclic monoid by 2 × 2 tropical matrices, we reprove Adjan’s identity for the bicyclic monoid in a much simpler way.

1999
Tom Leinster

Informally, a homotopy monoid is a monoid-like structure in which properties such as associativity only hold ‘up to homotopy’ in some consistent way. This short paper comprises a rigorous definition of homotopy monoid and a brief analysis of some examples. It is a much-abbreviated version of the paper ‘Homotopy Algebras for Operads’ (math.QA/0002180), and does not assume any knowledge of operads.

Journal: :Australasian J. Combinatorics 2004
Andrei V. Kelarev

Cayley graphs considered as language recognisers are as powerful as the more general finite state automata. This paper applies Cayley graphs to define a class of automata and describe minimal automata of this type, all their congruences and the Nerode equivalence of states. Throughout, the word graph means a finite directed graph without multiple edges but possibly with loops, and D = (V,E) is ...

2008
ALEXANDER PEREPECHKO

We prove that any affine algebraic monoid can be obtained as the endomorphisms’ monoid of a finite-dimensional (nonassociative) algebra.

2014
Jian Rong Li Wen Ting Zhang Yan Feng Luo

Let X∗ be a free monoid over an alphabet X and W be a finite language over X. Let S(W ) be the Rees quotient X∗/I(W ), where I(W ) is the ideal of X∗ consisting of all elements of X∗ that are not subwords of W . Then S(W ) is a finite monoid with zero and is called the discrete syntactic monoid of W . W is called finitely based if the monoid S(W ) is finitely based. In this paper, we give some ...

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

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