Avoidable sets in the bicyclic inverse semigroup

Nándor Sieben

Avoidable sets in the bicyclic inverse semigroup

Nándor Sieben

Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

Abstract

A subset U of a set S with a binary operation is called avoidable if S can be partitioned into two subsets A and B such that no element of U can be written as a product of two distinct elements of A or as the product of two distinct elements of B. The avoidable sets of the bicyclic inverse semigroup are classified.

Original language	English (US)
Pages (from-to)	273-288
Number of pages	16
Journal	Ars Combinatoria
Volume	77
State	Published - Oct 2005

Keywords

Additive partition
Avoidable set
Bicyclic inverse semigroup
Bipartite graph

ASJC Scopus subject areas

General Mathematics

Cite this

@article{a66fdf3f6a46454c8864fd11f3dc23a8,

title = "Avoidable sets in the bicyclic inverse semigroup",

abstract = "A subset U of a set S with a binary operation is called avoidable if S can be partitioned into two subsets A and B such that no element of U can be written as a product of two distinct elements of A or as the product of two distinct elements of B. The avoidable sets of the bicyclic inverse semigroup are classified.",

keywords = "Additive partition, Avoidable set, Bicyclic inverse semigroup, Bipartite graph",

author = "N{\'a}ndor Sieben",

year = "2005",

month = oct,

language = "English (US)",

volume = "77",

pages = "273--288",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Avoidable sets in the bicyclic inverse semigroup

AU - Sieben, Nándor

PY - 2005/10

Y1 - 2005/10

N2 - A subset U of a set S with a binary operation is called avoidable if S can be partitioned into two subsets A and B such that no element of U can be written as a product of two distinct elements of A or as the product of two distinct elements of B. The avoidable sets of the bicyclic inverse semigroup are classified.

AB - A subset U of a set S with a binary operation is called avoidable if S can be partitioned into two subsets A and B such that no element of U can be written as a product of two distinct elements of A or as the product of two distinct elements of B. The avoidable sets of the bicyclic inverse semigroup are classified.

KW - Additive partition

KW - Avoidable set

KW - Bicyclic inverse semigroup

KW - Bipartite graph

UR - http://www.scopus.com/inward/record.url?scp=33644666766&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33644666766&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33644666766

SN - 0381-7032

VL - 77

SP - 273

EP - 288

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

Avoidable sets in the bicyclic inverse semigroup

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this