𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nested Chain Partitions of Hamiltonian Filters

✍ Scribed by David G.C. Horrocks


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
340 KB
Volume
81
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis


Let P be a poset, consisting of all sets X [n]=[1, 2, ..., n] which contain at least one of a given collection F of 2-subsets of [n], ordered by inclusion. By modifying a construction of Greene and Kleitman, we show that if F is hamiltonian, that is, contains [1, 2], [2, 3], ..., [n&1, n] and [1, n], then P is a nested chain order. We examine the Sperner-type properties of such posets and provide further support for a conjecture of Lih.


πŸ“œ SIMILAR VOLUMES


Optimality of consecutive and nested tre
✍ Chang, G. J.; Hwang, F. K. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 84 KB

We consider the problem of partitioning the vertex-set of a tree to p parts to minimize a cost function. Since the number of partitions is exponential in the number of vertices, it is helpful to identify small classes of partitions which also contain optimal partitions. Two such classes, called cons

Nonconventional partitioning of the many
✍ PΓ©ter R. SurjΓ‘n; MihΓ‘ly KΓ‘llay; Ágnes Szabados πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 359 KB πŸ‘ 2 views

For the treatment of electron correlation, one most often uses the Ž . Møller᎐Plesset MP partition which defines the zero-order Hamiltonian through the spectral resolution of the Fockian. We investigate how the MP partitioning can be Ž . improved while still using the Hartree᎐Fock HF reference state

Improved sizing of fragile X CCG repeats
✍ Levinson, Gene ;Maddalena, Anne ;Palmer, Frances T. ;Harton, Gary L. ;Bick, Davi πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 782 KB

We have developed an improved method for polymerase chain reaction (PCRI-based sizing of the CCG repeat region at the fragile X locus, FMR-I. This method is designed to optimize denaturation and replication of long repeats with high G +-C content, which are otherwise refractory to amplification. The

Partitioning the Boolean Lattice into Ch
✍ Tim Hsu; Mark J. Logan; Shahriar Shahriari; Christopher Towse πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 187 KB

Let 2 [n] denote the Boolean lattice of order n, that is, the poset of subsets of {1, ..., n} ordered by inclusion. Recall that 2 [n] may be partitioned into what we call the canonical symmetric chain decomposition (due to de Bruijn, Tengbergen, and Kruyswijk), or CSCD. Motivated by a question of FΓΌ