EXPONENTIAL LENGTH OF CERTAIN SEQUENCES OF SUBSETS

Kyriakos Kalorkoti

doi:10.1142/S1793557109000510

EXPONENTIAL LENGTH OF CERTAIN SEQUENCES OF SUBSETS

Kyriakos Kalorkoti

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

Abstract

We consider sequences of subsets of a finite base set satisfying a condition that arises out of an application and show that there are such sequences whose length is exponential in the cardinality of the base set. We also provide an upper bound (which is much larger than the lower bound).

Original language	English
Pages (from-to)	605-610
Number of pages	6
Journal	Asian-European Journal of Mathematics
Volume	2
Issue number	4
DOIs	https://doi.org/10.1142/S1793557109000510
Publication status	Published - Dec 2009

Keywords / Materials (for Non-textual outputs)

Combinatorics
extremal set theory
analysis of algorithms

Access to Document

10.1142/S1793557109000510

http://www.worldscinet.com/aejm/02/0204/S1793557109000510.html

Cite this

@article{d4e91f2d8a624e16973ce8c6d839c05e,

title = "EXPONENTIAL LENGTH OF CERTAIN SEQUENCES OF SUBSETS",

abstract = "We consider sequences of subsets of a finite base set satisfying a condition that arises out of an application and show that there are such sequences whose length is exponential in the cardinality of the base set. We also provide an upper bound (which is much larger than the lower bound).",

keywords = "Combinatorics , extremal set theory , analysis of algorithms",

author = "Kyriakos Kalorkoti",

year = "2009",

month = dec,

doi = "10.1142/S1793557109000510",

language = "English",

volume = "2",

pages = "605--610",

journal = "Asian-European Journal of Mathematics",

issn = "1793-7183",

publisher = "World Scientific",

number = "4",

}

TY - JOUR

T1 - EXPONENTIAL LENGTH OF CERTAIN SEQUENCES OF SUBSETS

AU - Kalorkoti, Kyriakos

PY - 2009/12

Y1 - 2009/12

N2 - We consider sequences of subsets of a finite base set satisfying a condition that arises out of an application and show that there are such sequences whose length is exponential in the cardinality of the base set. We also provide an upper bound (which is much larger than the lower bound).

AB - We consider sequences of subsets of a finite base set satisfying a condition that arises out of an application and show that there are such sequences whose length is exponential in the cardinality of the base set. We also provide an upper bound (which is much larger than the lower bound).

KW - Combinatorics

KW - extremal set theory

KW - analysis of algorithms

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

U2 - 10.1142/S1793557109000510

DO - 10.1142/S1793557109000510

M3 - Article

SN - 1793-7183

VL - 2

SP - 605

EP - 610

JO - Asian-European Journal of Mathematics

JF - Asian-European Journal of Mathematics

IS - 4

ER -

EXPONENTIAL LENGTH OF CERTAIN SEQUENCES OF SUBSETS

Abstract

Keywords / Materials (for Non-textual outputs)

Access to Document

Other files and links

Fingerprint

Cite this