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

  1. 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)

  2. Algorithms for generating integer partitions.

    … thesis 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. …

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

  3. Integer Partitions Under Certain Finiteness Conditions

    This dissertation focuses on problems related to integer partitions under various finiteness restrictions. Much of our work involves the collection of partitions fitting inside a fixed partition $\lambda$, and the associated generating function $G_{\lambda}$. In Chapter 2, we discuss the …

    mtu Repository record for Integer Partitions Under Certain Finiteness Conditions (opens in a new tab)

  4. Half-integral weight Kloosterman sums and integer partitions

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-05-01

    uiuc Repository record for Half-integral weight Kloosterman sums and integer partitions (opens in a new tab)

  5. The Combinatorics of Integer Partitions Enumerated by some Exotic Weights

    Identities of integer partitions generally state that two dissimilar appearing families of partitions are in fact equinumerous when both are restricted to any fixed size. Euler's theorem is a classic example of such an identity, which equates the number of partitions with odd parts to the number of …

    mtu Repository record for The Combinatorics of Integer Partitions Enumerated by some Exotic Weights (opens in a new tab)

  6. Combinatorial approaches to problems about integer partitions and q-series

    … set of objects we study is a class of core partitions. We prove a recursive formula for the generating polynomial for the number of parts of s-core partitions into d-distinct parts with a given maximum hook length. Applications of the main result of this section include formulas for the …

    uiuc Repository record for Combinatorial approaches to problems about integer partitions and q-series (opens in a new tab)

  7. Matrix representations for integer partitions : some consequences and a new approach

    … two-line matrix representations for some sets of integer partitions and mock theta functions. In the firrst part of the text, we classify the partitions generated by six different mock theta functions, according to the sum of the second line of their associated matrices, and present some closed …

    brazil-ufrgs Repository record for Matrix representations for integer partitions : some consequences and a new approach (opens in a new tab)

  8. Asymptotic Analysis of Discrete Random Structures: Constrained Integer Partitions and Aggregating Particle Systems

    … distributions over the spaces of strict integer partitions (i.e. with distinct parts) into sums of perfect q-th powers (e.g. squares). The model is calibrated via the hyper-parameters <N> and <M> controlling the expected weight and length of partitions. In this framework, we obtain a …

    whiterose Download PDF for Asymptotic Analysis of Discrete Random Structures: Constrained Integer Partitions and Aggregating Particle Systems (opens in a new tab)

  9. 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)

  10. The Degrees of the Irreducible Representations of the Symmetric Group with Respect to Primes

    … representations, characters of representations, integer partitions, conjugacy classes, class functions, and tableaux. Some other key ingredients in our work include using character tables to classify the irreducible rep- resentations of the symmetric group and the hook-length formula to easily …

    calpoly Repository record for The Degrees of the Irreducible Representations of the Symmetric Group with Respect to Primes (opens in a new tab)

  11. Computing the Residue Class of Partition Numbers

    … the study of congruence properties of the integer partition function $p(n)$ by showing that $$p(5n+4) \equiv 0 \mod{5}$$ and $$p(7n+5) \equiv 0 \mod{7}$$ hold for all integers $n$. These results attracted a lot of interest in the mathematical community and inspired other mathematicians to …

    waterloo Repository record for Computing the Residue Class of Partition Numbers (opens in a new tab)

  12. Partition functions and Fourier coefficients of modular forms

    The theories of integer partitions and modular forms are intimately connected subjects in modern number theory, with many deep questions lying in the intersection of these areas. The goal of this work is to investigate a collection of problems in this direction, particularly on various methods for …

    utk-theses Repository record for Partition functions and Fourier coefficients of modular forms (opens in a new tab)

  13. Irreducible Representations from Group Actions on Trees

    … irreducible representations associated with the integer partitions $(n)$ and $(1^n)$ appear in the representations. We describe a new sign reversing involution with fixed points that provide a combinatorial interpretation for the number of times the irreducible associated with the integer …

    calpoly Repository record for Irreducible Representations from Group Actions on Trees (opens in a new tab)

  14. Combinatorial and Asymptotic Statistical Properties of Partitions and Unimodal Sequences

    … the diagrams of unimodal sequences of positive integers. These diagrams consist of columns of squares in the plane; the upper boundary is called the shape. For various types of unimodal sequences, we show that, as the number of squares tends to infinity, 100% of shapes are near a certain …

    lsu-thes Repository record for Combinatorial and Asymptotic Statistical Properties of Partitions and Unimodal Sequences (opens in a new tab)

  15. Directed graph limits and directed threshold graphs

    … their graphons. We finish by defining integer partition homomorphisms and giving an analog to graphons for integer partitions.

    nebraska Repository record for Directed graph limits and directed threshold graphs (opens in a new tab)

  16. Arithmetic of partition functions and q-combinatorics

    Integer partitions play important roles in diverse areas of mathematics such as q-series, the theory of modular forms, representation theory, symmetric functions and mathematical physics. Among these, we study the arithmetic of partition functions and q-combinatorics via bijective methods, q-series …

    uiuc Repository record for Arithmetic of partition functions and q-combinatorics (opens in a new tab)

  17. Combinatorial Aspects of the Ikeda Lift via Extended Gross-Keating Data

    … denoted by 𝜙(𝑎; 𝐵), where 𝑎 is a positive integer and 𝐵 is a symmetric positive-definite half-integral matrix; appearing in the Fourier coefficient formulas of a linear version of the Ikeda lift due to W. Kohnen. We develop new methods for computing 𝜙(𝑎; 𝐵) via the extended Gross-Keating …

    oklahoma-thes Repository record for Combinatorial Aspects of the Ikeda Lift via Extended Gross-Keating Data (opens in a new tab)

  18. Statistical models for frequency distributions of count data with applications to scientometrics

    … combinatorics and the theory of random integer partitions to gain valuable insights into the data structure, which examines Young diagrams and their scaling limits. These insights are then applied to model and estimate production metrics, including the h-index and g-index.

    whiterose Download PDF for Statistical models for frequency distributions of count data with applications to scientometrics (opens in a new tab)

  19. Profiles of Large Combinatorial Structures

    … with weighted cycles, involutions, and integer partitions. Random permutations in which each cycle carries a multiplicative weight $\sigma$ have probability $(1-\gamma)^\sigma$ of having a random element be in a cycle of length longer than $\gamma n$; this limit law also holds for cycles …

    penn Repository record for Profiles of Large Combinatorial Structures (opens in a new tab)

  20. Asymptotic Formulae for Restricted Unimodal Sequences

    … problems, such as counting the number of integer partitions, lie at the intersection of various branches of mathematics including combinatorics, number theory, and analysis. Extending partitions to integer unimodal sequences has also yielded interesting combinatorial results and asymptotic …

    lsu-thes Repository record for Asymptotic Formulae for Restricted Unimodal Sequences (opens in a new tab)

Page 1 of 2