Krasner near-factorizations and 1-overlapped factorizations

doi:https://doi.org/10.1007/978-88-7642-475-5_62

Book Chapter10.1007/978-88-7642-475-5_62

Krasner near-factorizations and 1-overlapped factorizations

Tadashi Sakuma,Hidehiro Shinohara-2013-01-01-Scuola Normale Superiore eBooks

2

TL;DRAbstract

Near and/or 1-overlapped factorizations on cyclic groups play important roles both in perfect graph theory and ideal clutter theory. Such a factorization is Krasner if its construction does not need any modulo operation (i.e. every addition can be thought as the addition of integers). In this paper, we characterize Krasner near-factorizations and 1-overlapped factorizations, which solves a problem posed by S. Szabó and A.D. Sands [9].

Chat with Paper

AI Agents for this Paper

Near and/or 1-overlapped factorizations on cyclic groups play important roles both in perfect graph theory and ideal clutter theory. Such a factorization is Krasner if its construction does not need any modulo operation (i.e. every addition can be thought as the addition of integers). In this paper, we characterize Krasner near-factorizations and 1-overlapped factorizations, which solves a problem posed by S. Szabó and A.D. Sands [9].

Keywords

Computer science

Chat

Click to start Chat