On well-connected sets of strings

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

\(j\)-connectedness of complexes sequence of homomorphisms

Combinatorial aspects of simplicial complexes (05E45)

Abstract: Given

n

pairwise disjoint sets

X_{1}, l d o t s, X_{n}

, we call the elements of

S = X_{1} i m e s l d o t s i m e s X_{n}

strings. A nonempty set of strings

W s u b s e t e q S

is said to be well-connected if for every

v i n W

and for every

i, (1 l e i l e n)

, there is another element

v^{'} i n W

which differs from

v

only in its

i

th coordinate. We prove a conjecture of Yaokun Wu and Yanzhen Xiong by showing that every set of more than

p r o d_{i = 1}^{n} | X_{i} | - p r o d_{i = 1}^{n} (| X_{i} | - 1)

strings has a well-connected subset. This bound is tight.

Review text

Summary: Given \(n\) sets \(X_1,\ldots, X_n\), we call the elements of \(S=X_1\times\cdots\times X_n\) strings. A nonempty set of strings \(W\subseteq S\) is said to be well-connected if for every \(v\in W\) and for every \(i\) \((1\leqslant i\leqslant n)\), there is another element \(v'\in W\) which differs from \(v\) only in its \(i\)-th coordinate. We prove a conjecture of Yaokun Wu and Yanzhen Xiong by showing that every set of more than \(\prod_{i=1}^n|X_i|-\prod_{i=1}^n(|X_i|-1)\) strings has a well-connected subset. This bound is tight.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: On well-connected sets of strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2121802)