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 1661 for “"partitions"”.

  1. Partitions/ apparitions

    This Masters Report discusses my pivotal works from the past three years, as well as the generative concepts and stories behind them. Ubiquitous forms and anachronistic processes, pushed to the periphery for sheer abundance or seeming obsolescence, are two of my points of focus.

    texas Repository record for Partitions/ apparitions (opens in a new tab)

  2. Vector Partitions

    Integer partitions have been studied by many mathematicians over hundreds of years. Many identities exist between integer partitions, such as Euler’s discovery that every number has the same amount of partitions into distinct parts as into odd parts. These identities can be proven using methods …

    etsu Repository record for Vector Partitions (opens in a new tab) Download PDF for Vector Partitions (opens in a new tab)

  3. Complexity and Partitions

    … the complexity of sets, i.e., the complexity of partitions into two parts. But often it is more appropriate to represent natural problems by partitions into more than two parts. A particularly interesting class of such problems consists of classification problems for relations. For instance, a …

    wurz-thes Repository record for Complexity and Partitions (opens in a new tab)

  4. Genus one partitions

    … of a partition, and calculate the number of partitions of maximal genus. The generating series for genus zero and genus one rooted hypermonopoles is obtained in closed form by specializing the genus series for hypermaps. We discuss the connection between partitions and rooted hypermonopoles, …

    waterloo Repository record for Genus one partitions (opens in a new tab)

  5. Partitions and Hook lengths

    zurich Restricted access

  6. Random Matrices and Partitions

    … our focus to models of random three-dimensional partitions, in order to deal with these random shapes the Schur process is introduced and its correlation functions are computed. This gives us a way to find asymptotics for plane partitions and pyramid partitions in the case where all q parameters …

    temple Repository record for Random Matrices and Partitions (opens in a new tab)

  7. Partitions of finite frames

    … can design an efficient algorithm to find the partitions guaranteed by Corollary 1.5." This corollary states that given a set of vectors in C whose outer products sum to the identity there exists a partition of these vectors such that norms of the outer-product sums of each subset satisfy an …

    rowan Repository record for Partitions of finite frames (opens in a new tab)

  8. Counting Restricted Integer Partitions

    … first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with a family of identities which can be deduced by iterating a recurrence satisfied by $p_b(n)$ in a suitable way. These identities can then be used to calculate $p_b(n)$ for large values of $n$. The …

    cuny-grad Repository record for Counting Restricted Integer Partitions (opens in a new tab)

  9. Alliance Partitions in Graphs.

    For a graph G=(V,E), a nonempty subset S contained in V is called a defensive alliance if for each v in S, there are at least as many vertices from the closed neighborhood of v in S as in V-S. If there are strictly more vertices from the closed neighborhood of v in S as in V-S, then S is a strong …

    etsu Repository record for Alliance Partitions in Graphs. (opens in a new tab) Download PDF for Alliance Partitions in Graphs. (opens in a new tab)

  10. Asymptotic Properties of Partitions

    Made available in DSpace on 2014-12-05T21:50:07Z (GMT). No. of bitstreams: 1 0018159.pdf: 1175807 bytes, checksum: 3bd896f94ef741e37dae77d2cc42c092 (MD5) Previous issue date: 1956

    uiuc Repository record for Asymptotic Properties of Partitions (opens in a new tab)

  11. Bayesian inference for random partitions

    I consider statistical inference for clustering, that is the arrangement of experimental units in homogeneous groups. In particular, I discuss clustering for multivariate binary outcomes. Binary data is not very informative, making it less meaningful to proceed with traditional (deterministic) …

    texas Repository record for Bayesian inference for random partitions (opens in a new tab)

  12. Dependent mixtures and random partitions

    … dependent mixture models and dependent random partitions with applications to biomedical data. A mixture model implies a random distribution over partitions by randomly assigning individual observations to latent subpopulations that correspond to the distinct components of the mixture. …

    texas Repository record for Dependent mixtures and random partitions (opens in a new tab)

  13. Algebra Structure On Set Partitions

    … algebra is an algebra with a basis of set partitions diagrams. Its subalgebra includes diagram algebras such as the uniform block permutations and the group algebra of the symmetric group. We connect the Hopf algebra of uniform block permutations to the diagram algebra known as the party …

    york Repository record for Algebra Structure On Set Partitions (opens in a new tab)

  14. Precise Partitions Of Large Graphs

    First by using an easy application of the Regularity Lemma, we extend some known results about cycles of many lengths to include a specified edge on the cycles. The results in this chapter will help us in rest of this thesis. In 2000, Enomoto and Ota posed a conjecture on the existence of path …

    gsu Repository record for Precise Partitions Of Large Graphs (opens in a new tab)

  15. <i>m</i>-ARY Partitions

    We study the number of ways in which n ≥ 0 be written as the sum of powers of m ≥ 2. After briefly discussing historical results and examples, we prove recurrence relations, exact formulae, bounds, and asymptotic formulae. The proofs are based on elementary reasoning using induction and the mean …

    clemson Repository record for <i>m</i>-ARY Partitions (opens in a new tab)

  16. Algorithms for generating integer partitions.

    … we consider the problem of generating integer partitions. We provide an overview of all known algorithms for the sequential generation of partitions of an integer. The performance is measured and compared separately for the standard and multiplicity representation of integer partitions. We …

    ottawa-retro Repository record for Algorithms for generating integer partitions. (opens in a new tab)

Page 1 of 84