Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 17 of 17 for “"Boolean Lattice"”.

  1. On diamond-free subposets of the Boolean lattice: An application of flag algebras

    <p>The Boolean lattice of dimension two, also known as the diamond, consists of four distinct elements with the following property: A B;C D. The 3-crown consists of six distinct elements with the following property: A a subset of B, D and B a subset of C E and A a subset of C, F. A P-free family in …

    iastate Repository record for On diamond-free subposets of the Boolean lattice: An application of flag algebras (opens in a new tab)

  2. Random and deterministic versions of extremal poset problems

    … independently at random with probability p. The Boolean lattice is a partially ordered set, or poset, consisting of the elements of P(n), partially ordered by set inclusion. A basic question in extremal poset theory asks the following: Given a poset P, how big is the largest family of sets in the …

    iastate Repository record for Random and deterministic versions of extremal poset problems (opens in a new tab)

  3. Generalizations of Sperner's Theorem: Packing Posets, Families Forbidding Posets, and Supersaturation

    … the largest antichain in the poset that is the Boolean lattice. This is equivalent to finding the largest family of subsets of an $n$-set, $[n]:=\{1,2,\dots,n\}$, such that the family is constructed from pairwise unrelated copies of the single element poset. For a poset $P$, we are interested in …

    south-carolina Repository record for Generalizations of Sperner's Theorem: Packing Posets, Families Forbidding Posets, and Supersaturation (opens in a new tab)

  4. A New Interpretation of the Matrix Tree Theorem Using Weak Walk Contributions and Circle Activation

    … classes form an alternating rank-signed Boolean lattice in which all members cancel. We then restrict our contributors to those corresponding to a given cofactor Lij and demonstrate that those contributors that no longer cancel are in one-to-one correspondence with the spanning trees of …

    texas-state Repository record for A New Interpretation of the Matrix Tree Theorem Using Weak Walk Contributions and Circle Activation (opens in a new tab)

  5. Universal Cycles for Some Combinatorial Objects

    … to the sets in any labeled subposet of the Boolean lattice; de Bruijn's theorem corresponds to the case when the subposet in question consists of a single ground element. In this paper, we also show that de Bruijn's cycles exist for words with weight between s and t, where these parameters …

    etsu Repository record for Universal Cycles for Some Combinatorial Objects (opens in a new tab) Download PDF for Universal Cycles for Some Combinatorial Objects (opens in a new tab)

  6. Poset Ramsey Numbers for Boolean Lattices

    For each positive integer n, let Qn denote the Boolean lattice of dimension n. For posets P, P', define the poset Ramsey number R(P,P') to be the least N such that for any red/blue coloring of the elements of QN, there exists either a subposet isomorphic to P with all elements red, or a subposet …

    south-carolina Repository record for Poset Ramsey Numbers for Boolean Lattices (opens in a new tab)

  7. Coloring and extremal problems in combinatorics

    … concerning graphs, the integer grid, and the Boolean lattice.</p>

    iastate Repository record for Coloring and extremal problems in combinatorics (opens in a new tab)

  8. Permutation group invariants of exterior and superpolynomial algebras

    … orbit poset Bn/G obtained as a quotient of the boolean lattice Bn. In Theorem 1.11, we exhibit three families of groups for which the phenomenon holds. A proof of one of the families is deferred to an appendix. A second appendix lists groups satisfying Equation (1.20) but which do not fit into …

    umn Repository record for Permutation group invariants of exterior and superpolynomial algebras (opens in a new tab)

  9. A polynomial LYM inequality and an association scheme on a lattice

    … schemes of finite, complemented, modular lattices. We also present examples using this general polynomial LYM inequality for the Boolean lattice, the vector space lattice over a finite field, and a lattice constructed from affine lines.

    nebraska Repository record for A polynomial LYM inequality and an association scheme on a lattice (opens in a new tab)

  10. ON THE LATTICE OF SUBLATTICES OF A FINITE DISTRIBUTIVE LATTICE

    … of this thesis is to study the structure of the lattice S(L) of sublattices of a finite distributive lattice L and the interdependence between the lattices Land S(L). This thesis consists of four chapters. Chapter 1 gives the basic terms and notations that are needed throughout the thesis. It …

    nus Repository record for ON THE LATTICE OF SUBLATTICES OF A FINITE DISTRIBUTIVE LATTICE (opens in a new tab) Download file for ON THE LATTICE OF SUBLATTICES OF A FINITE DISTRIBUTIVE LATTICE (opens in a new tab)

  11. On Crown-free Set Families, Diffusion State Difference, and Non-uniform Hypergraphs

    … the cardinality of the largest family on the Boolean lattice that does not contain H as a subposet. Denote π(H) := limn→∞ La(n,H) (bn/ n2c) . A crown O2k for k ≥ 2 is a poset on 2 levels whose Hasse diagram is a cycle. Griggs and Lu (2009) showed π(O4k) = 1 for k ≥ 2. Lu (2014) proved π(O2k) = …

    south-carolina Repository record for On Crown-free Set Families, Diffusion State Difference, and Non-uniform Hypergraphs (opens in a new tab)

  12. Extremal problems on counting combinatorial structures

    … of comparable pairs. Kleitman showed that the Boolean lattice $\{0,1\}^n$ has the centeredness property. It was conjectured by Noel, Scott, and Sudakov, and by Balogh and Wagner, that the poset $\{0,1,\ldots,k\}^n$ also has the centeredness property, provided $n$ is sufficiently large compared …

    uiuc Repository record for Extremal problems on counting combinatorial structures (opens in a new tab)

  13. Problems and results in partially ordered sets, graphs and geometry

    … second kind. In the third part, we consider the lattice whose elements are the subsets of ${1,2,ldots,n}$. Trotter and Felsner asked whether this subset lattice always contains a monotone Hamiltonian path. We make progress toward answering this question by constructing a path for all $n$ that …

    gatech Repository record for Problems and results in partially ordered sets, graphs and geometry (opens in a new tab)

  14. A POWER INDEX BASED FRAMEWORKFOR FEATURE SELECTION PROBLEMS

    … as the problem of maximization of a pseudo-boolean function, i.e. a real valued set function (that maps sets of features into a performance metric). Since one has to enact a search over (a considerable portion of) the Boolean lattice (without any special guarantees, except, perhaps, …

    milano Repository record for A POWER INDEX BASED FRAMEWORKFOR FEATURE SELECTION PROBLEMS (opens in a new tab)

  15. A statistical physics approach to probabilistic combinatorics

    … and typical structure of antichains in the Boolean lattice in Chapter 3. We relate antichains to the hard-core model in a suitable graph, and use the hard-core model to give refined asymptotics for Dedekind’s problem and determine the number of antichains of a given size. </p></div><div …

    kings Repository record for A statistical physics approach to probabilistic combinatorics (opens in a new tab) Download PDF for A statistical physics approach to probabilistic combinatorics (opens in a new tab)

  16. A partially ordered semigroup of Boolean spaces.

    … chapter investigates the class of countable Boolean algebras from which this semigroup arises. The elements of D correspond to the isomorphism classes of the Boolean algebras under consideration. In Chapter 2 we begin the study of the semigroup structure of D. D is axiomatically described by …

    arizona-thes Repository record for A partially ordered semigroup of Boolean spaces. (opens in a new tab)