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 20 of 46 for “"Association scheme"”.

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

    … for certain ranked posets derived from association schemes. To do this we establish a new class of association 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 …

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

  2. Relation algebras and vertex conditions in graph theory

    <p>An association scheme (Q,[Gamma]), comprising a certain kind of partition [Gamma] of the direct square of a finite, nonempty set Q, corresponds to a binary relation algebra. A superscheme (Q,[Gamma]*) comprises a certain family of partitions of the direct powers Q[superscript n]+2 for each …

    iastate Repository record for Relation algebras and vertex conditions in graph theory (opens in a new tab)

  3. Association schemes and mutually unbiased Hadamard matrices

    This thesis is an examination of the theory of association schemes. A part of this thesis focuses on the relation between association schemes and different combinatorial objects. Special attention is paid to the notion of Bose-Mesner algebra of an association scheme, which leads us to …

    lethbridge Repository record for Association schemes and mutually unbiased Hadamard matrices (opens in a new tab)

  4. Fusions of association schemes

    … configurations by Bose and Mesner in 1959, association schemes have gained significant importance in algebraic combinatorics. An important breakthrough was achieved by Delsarte’s PhD thesis where he proved that many problems from coding theory, combinatorial design theory and statistics can …

    regina Repository record for Fusions of association schemes (opens in a new tab) Download PDF for Fusions of association schemes (opens in a new tab)

  5. Subconstituent Algebras of Latin Squares

    … is well-known that one may construct a 4-class association scheme on the positions of a Latin square, where the relations are the identity, being in the same row, being in the same column, having the same entry, and everything else. We describe the subconstituent (Terwilliger) algebras of such …

    usf Repository record for Subconstituent Algebras of Latin Squares (opens in a new tab)

  6. Search for commutative fusion schemes in noncommutative association schemes

    An association scheme X is a finite set X together with a set of binary relations R0, R1,…,Rd that satisfy certain regularity conditions. The adjacency algebra (Bose-Mesner algebra) associated with the scheme X consists of integral matrices closed under matrix addition, multiplication and the …

    colostate Repository record for Search for commutative fusion schemes in noncommutative association schemes (opens in a new tab)

  7. Terwilliger algebras of wreath products of association schemes

    … thesis, we study the T -algebras of symmetric association schemes that are obtained as the wreath product of H(1, m) for m ≥ 2. We find that the D-class association scheme Kn1&m22;Kn2&m22;&cdots; &m22;KnD formed by taking the wreath product of one-class association schemes Kni = H(1, ni) has …

    iastate Repository record for Terwilliger algebras of wreath products of association schemes (opens in a new tab)

  8. On the Spectral Efficiency and Energy Efficiency Analysis of Cache-Enabled Heterogeneous Networks with Device-to-Device Communication and Cooperative Transmission

    … impact the SE and EE. In this thesis, an association scheme that computes the D2D communication range based on out-of-cell interference is proposed for establishing cellular and D2D links in a HetNet. The proposed interference-aware, D2D distance threshold-based association scheme achieves …

    calgary Repository record for On the Spectral Efficiency and Energy Efficiency Analysis of Cache-Enabled Heterogeneous Networks with Device-to-Device Communication and Cooperative Transmission (opens in a new tab)

  9. Spectral Efficiency Analysis for User-centric Cell-free Massive MIMO System During Uplink Transmission

    … on developing several computationally efficient schemes for improving the spectral efficiency (SE) performance of the UC CF mMIMO system during the uplink (UL) phase. First, a new AP-UE association scheme is proposed which leverages both the AP and UE-preferences for association assignment. It is …

    calgary Repository record for Spectral Efficiency Analysis for User-centric Cell-free Massive MIMO System During Uplink Transmission (opens in a new tab)

  10. The cyclotomic eigenvalue and character value problems for association schemes

    … eigenvalue question (CEQ) for commutative association schemes. This question, which was posed by Simon Norton at Oberwolfach in 1980, asks whether all entries of the character table of a commutative association scheme lie in a cyclotomic extension of the rational numbers. In this thesis, we …

    regina Repository record for The cyclotomic eigenvalue and character value problems for association schemes (opens in a new tab) Download PDF for The cyclotomic eigenvalue and character value problems for association schemes (opens in a new tab)

  11. Schurian Association Schemes Arising From Abstract Regular Polytopes

    … objective of this thesis is to address Schurian association schemes arising from a string Coxeter group G. We will talk about the problem of when the adjacency algebra of the Schurian association scheme C[G==H] generated by the double cosets of G with respect to a vertex stabilizer subgroup H is …

    regina Repository record for Schurian Association Schemes Arising From Abstract Regular Polytopes (opens in a new tab) Download PDF for Schurian Association Schemes Arising From Abstract Regular Polytopes (opens in a new tab)

  12. Terwilliger Algebras for Several Finite Groups

    … on Schur rings, we will move onto discussing association schemes as well as their properties. In particular, we will show every Schur ring gives rise to an association scheme. We will then define a Terwilliger algebra for any finite set, as well as discuss basic properties that hold for all …

    byu Repository record for Terwilliger Algebras for Several Finite Groups (opens in a new tab) Download PDF for Terwilliger Algebras for Several Finite Groups (opens in a new tab)

  13. Heterogeneous Cellular Networks: From Resource Allocation To User Association

    … coordination mechanisms and resource allocation schemes, different types of links operating at different bands and air-interface technologies, and different user association schemes. Studying these deployment scenarios and configurations, and understanding the interplay between different …

    waterloo Repository record for Heterogeneous Cellular Networks: From Resource Allocation To User Association (opens in a new tab)

  14. The Schurian association schemes associated with parabolic subgroups of Coxeter groups

    … of these double coset algebras from the association scheme perspective. We give an overview of their orders, ranks, commutativity, and character tables, investigate their nontrivial closed subsets, quotients and fusions, and look for possible relationships between the association schemes …

    regina Repository record for The Schurian association schemes associated with parabolic subgroups of Coxeter groups (opens in a new tab) Download PDF for The Schurian association schemes associated with parabolic subgroups of Coxeter groups (opens in a new tab)

  15. Some Combinatorial Structures Constructed from Modular Leonard Triples

    … set. In the second part we construct a Hamming association scheme from modular Leonard triples using a method used previously in the context of Grassmanian codes.

    usf Repository record for Some Combinatorial Structures Constructed from Modular Leonard Triples (opens in a new tab)

  16. Energy modeling and analysis in heterogeneous cellular systems

    … the base stations. Then, a novel on-off and cell-association scheme is proposed to minimize the overall network energy consumption while satisfying the spatially- and temporally-varying traffic demands. Second, we exploit the use of multi-stream carrier aggregation not only to improve the energy …

    gatech Repository record for Energy modeling and analysis in heterogeneous cellular systems (opens in a new tab)

  17. Cyclotomic coset association schemes

    … {Ci} be the A-orbits in G. The cyclotomic coset scheme is the commutative, non-symmetric association scheme with point set G and ith relation {(x, y) : xy–1 is in Ci}. This scheme admits the semidirect product of G by A as a group of automorphisms and is a generalization of cyclotomic association …

    colostate Repository record for Cyclotomic coset association schemes (opens in a new tab)

  18. Ultra Reliable and Low Latency Communications for Vehicular Networks with Edge Computing Capabilities

    … framework can effectively perform distributed association of AVs to SBSs while accounting for the latency needs of AVs as well as the limited computational and bandwidth resources of SBSs. Moreover, the convergence of the proposed algorithm to a core allocation between AVs and SBSs is proved …

    gsu Repository record for Ultra Reliable and Low Latency Communications for Vehicular Networks with Edge Computing Capabilities (opens in a new tab)

  19. PARTITIONING STRONGLY REGULAR GRAPHS (BALANCED INCOMPLETE BLOCK DESIGNS, ASSOCIATION SCHEMES).

    … development is presented in the context of association schemes. Partitioning by order-free designs extends naturally to any association scheme when cocliques are generalized to {Ø,i} -cliques. This extended partitioning is applied to generalized hexagons.

    arizona-thes Repository record for PARTITIONING STRONGLY REGULAR GRAPHS (BALANCED INCOMPLETE BLOCK DESIGNS, ASSOCIATION SCHEMES). (opens in a new tab)

  20. Independent Sets and Eigenspaces

    … Thirdly, the graphs that arise belong to association schemes that have already been studied in other contexts. Our first problem involves covering arrays on graphs, which arises in computer science. The goal is to find a smallest covering array on a given graph <i>G</i>. It is known that …

    waterloo Repository record for Independent Sets and Eigenspaces (opens in a new tab)

Page 1 of 3