The cardinality of some symmetric differences

Po Yi Huang; Wen Fong Ke; Günter F. Pilz

doi:10.1090/S0002-9939-09-10189-2

The cardinality of some symmetric differences

Po Yi Huang, Wen Fong Ke, Günter F. Pilz

數學系

研究成果: Article

摘要

In this paper, we prove that for positive integers k and n, the cardinality of the symmetric differences of {1, 2,. . ., k}, {2, 4,. . ., 2k}, {3, 6,. . ., 3k},. . ., {n, 2n,. . ., kn} is at least k or n, whichever is larger. This solved a problem raised by Pilz in which binary composition codes were studied.

原文	English
頁（從 - 到）	787-797
頁數	11
期刊	Proceedings of the American Mathematical Society
卷	138
發行號	3
DOIs	https://doi.org/10.1090/S0002-9939-09-10189-2
出版狀態	Published - 2010 三月 1

All Science Journal Classification (ASJC) codes

Mathematics(all)
Applied Mathematics

存取文件

10.1090/S0002-9939-09-10189-2

指紋深入研究「The cardinality of some symmetric differences」主題。共同形成了獨特的指紋。

引用此

Huang, P. Y., Ke, W. F., & Pilz, G. F. (2010). The cardinality of some symmetric differences. Proceedings of the American Mathematical Society, 138(3), 787-797. https://doi.org/10.1090/S0002-9939-09-10189-2

@article{54f5c2dfcd654e4f8b2b3bb41a03dd5b,

title = "The cardinality of some symmetric differences",

abstract = "In this paper, we prove that for positive integers k and n, the cardinality of the symmetric differences of {1, 2,. . ., k}, {2, 4,. . ., 2k}, {3, 6,. . ., 3k},. . ., {n, 2n,. . ., kn} is at least k or n, whichever is larger. This solved a problem raised by Pilz in which binary composition codes were studied.",

author = "Huang, {Po Yi} and Ke, {Wen Fong} and Pilz, {G{\"u}nter F.}",

year = "2010",

month = mar,

day = "1",

doi = "10.1090/S0002-9939-09-10189-2",

language = "English",

volume = "138",

pages = "787--797",

journal = "Proceedings of the American Mathematical Society",

issn = "0002-9939",

publisher = "American Mathematical Society",

number = "3",

}

TY - JOUR

T1 - The cardinality of some symmetric differences

AU - Huang, Po Yi

AU - Ke, Wen Fong

AU - Pilz, Günter F.

PY - 2010/3/1

Y1 - 2010/3/1

N2 - In this paper, we prove that for positive integers k and n, the cardinality of the symmetric differences of {1, 2,. . ., k}, {2, 4,. . ., 2k}, {3, 6,. . ., 3k},. . ., {n, 2n,. . ., kn} is at least k or n, whichever is larger. This solved a problem raised by Pilz in which binary composition codes were studied.

AB - In this paper, we prove that for positive integers k and n, the cardinality of the symmetric differences of {1, 2,. . ., k}, {2, 4,. . ., 2k}, {3, 6,. . ., 3k},. . ., {n, 2n,. . ., kn} is at least k or n, whichever is larger. This solved a problem raised by Pilz in which binary composition codes were studied.

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

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

U2 - 10.1090/S0002-9939-09-10189-2

DO - 10.1090/S0002-9939-09-10189-2

M3 - Article

AN - SCOPUS:77951496298

VL - 138

SP - 787

EP - 797

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

SN - 0002-9939

IS - 3

ER -