✦ LIBER ✦

Covers for regular semigroups and an application to complexity

✍ Scribed by P.G. Trotter

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 679 KB
Volume: 105
Category: Article
ISSN: 0022-4049
DOI: 10.1016/0022-4049(94)00151-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quasi-ideal embeddings and Rees matrix c

Quasi-ideal embeddings and Rees matrix covers for regular semigroups

✍ D.B McAlister 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 867 KB

Extensions and covers for semigroups who

Extensions and covers for semigroups whose idempotents form a left regular band

✍ Mário J. J. Branco; Gracinda M. S. Gomes; Victoria Gould 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 490 KB

Polynomial Factorisation and an Applicat

Polynomial Factorisation and an Application to Regular Directed Graphs

✍ Stephen D. Cohen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 441 KB

The main theme is the distribution of polynomials of given degree which split into a product of linear factors over a finite field. The work was motivated by the following problem on regular directed graphs. Extending a notion of Chung, Katz has defined a regular directed graph based on the k-algebr

Limits of convolution iterates and prope

Limits of convolution iterates and properties of random walks defined on regular semigroups with applications to matrix semigroups

✍ P.B. Cerrito 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 593 KB

Path regularity for Feller semigroups vi

Path regularity for Feller semigroups via Gaussian kernel estimates and generalizations to arbitrary semigroups onC0

✍ Sönke Blunck 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 288 KB

Connected coverings and an application t

Connected coverings and an application to oriented matroids

✍ David Forge; J.L. Rami´rez Alfonsi´n 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 480 KB

In this paper we are interested in the following question: what is the smallest number of circuits, s(n,r), that is sufficient to determine every uniform oriented matroid of rank r on n elements? We shall give different upper bounds for s(n,r) by using special coverings called connected coverings. (