๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


An Extremal Problem in the Hypercube and
โœ Carlos Gustavo T. de A. Moreira; Pablo Emanuel ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 66 KB

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.

An Efficient Algorithm for the k-Pairwis
โœ Qian-Ping Gu; Shietung Peng ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 140 KB

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

A Note on Optimal Time Broadcast in Faul
โœ D. Peleg ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 309 KB

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

The impact of macroeconomic uncertainty
โœ Christopher F. Baum; Atreya Chakraborty; Boyan Liu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 109 KB ๐Ÿ‘ 1 views

## 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'

On a Problem in Shuffling
โœ Noga Alon; Ken Berman; Daniel Kleitman ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 85 KB

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.