We prove that if m โฅ 2, then the minimum k โ N such that the k-cube {0, 1} k can be decomposed as the disjoint union of m connected adjacent subsets satisfies 2 log 2 mlog 2 log 2 m -1 โค k โค 2 log 2 mlog 2 log 2 m + 5.
On a leverage problem in the hypercube
โ Scribed by Peter Hamburger; Raymond E. Pippert; W. Douglas Weakley
- Publisher
- John Wiley and Sons
- Year
- 1992
- Tongue
- English
- Weight
- 210 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A graph G(V, E) (|V| 2k) satisfies property A k if, given k pairs of distinct nodes (s 1 , t 1 ), ..., (s k , t k ) of V(G), there are k mutually node-disjoint paths, one connecting s i and t i for each i, 1 i k. A necessary condition for any graph to satisfy A k is that it is (2k&1)-connected. Hype
This note describes an algorithm for broadcasting a message on the \(n\)-dimensional hypercube in optimal time ( \(n\) time units) and optimal communication ( \(2^{n}-1\) messages) in the presence of up to \(n-2\) arbitrary node or edge faults, assuming the set of faults is known to all nodes of the
## Abstract We investigate the relationship between a firm's measures of corporate governance, macroeconomic uncertainty and changes in leverage. Recent research highlights the role of governance in financing decisions. Previous research also indicates that macroeconomic uncertainty affects a firm'
Upper and lower bounds are obtained for the number of shuffles necessary to reach the ``furthest'' two hand deal starting from a given permutation of a deck of cards. The bounds are on the order of (log 2 n)ร2 and log log n, respectively.