Rank of a partition

In mathematics, particularly in the fields of number theory and combinatorics, the rank of a partition of a positive integer is a certain integer associated with the partition. In fact at least two different definitions of rank appear in the literature. The first definition, with which most of this article is concerned, is that the rank of a partition is the number obtained by subtracting the number of parts in the partition from the largest part in the partition. The concept was introduced by Freeman Dyson in a paper published in the journal Eureka. It was presented in the context of a study of certain congruence properties of the partition function discovered by the Indian mathematical genius Srinivasa Ramanujan. A different concept, sharing the same name, is used in combinatorics, where the rank is taken to be the size of the Durfee square of the partition. By a partition of a positive integer n we mean a finite multiset λ = { λk, λk − 1, . . . , λ1 } of positive integers satisfying the following two conditions: λk ≥ . . . ≥ λ2 ≥ λ1 > 0. λk + . . . + λ2 + λ1 = n. If λk, . . . , λ2, λ1 are distinct, that is, if λk > . . . > λ2 > λ1 > 0 then the partition λ is called a strict partition of n. The integers λk, λk − 1, ..., λ1 are the parts of the partition. The number of parts in the partition λ is k and the largest part in the partition is λk. The rank of the partition λ (whether ordinary or strict) is defined as λk − k. The ranks of the partitions of n take the following values and no others: n − 1, n −3, n −4, . . . , 2, 1, 0, −1, −2, . . . , −(n − 4), −(n − 3), −(n − 1). The following table gives the ranks of the various partitions of the number 5. Ranks of the partitions of the integer 5 The following notations are used to specify how many partitions have a given rank. Let n, q be a positive integers and m be any integer. The total number of partitions of n is denoted by p(n). The number of partitions of n with rank m is denoted by N(m, n). The number of partitions of n with rank congruent to m modulo q is denoted by N(m, q, n).

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (28)

Unités associées (1)

Concepts associés (4)

Cours associés (3)

Séances de cours associées (38)

The ABCD of topological recursion

Nicolas Gerson Orantin

Kontsevich and Soibelman reformulated and slightly generalised the topological recursion of [43], seeing it as a quantisation of certain quadratic Lagrangians in T*V for some vector space V. KS topological recursion is a procedure which takes as initial da ...

San Diego2024

Determination of server location in emergency care systems: an index proposal using data envelopment analysis and the hypercube queuing model

Caio Vitor Beojone

The objective of this article is to propose a new composite index (CI) that helps to determine the most effective location of servers in an Emergency Care System (ECS), using Benefit of the Doubt (BoD)/Data Envelopment Analysis (DEA) and the Hypercube queu ...

London2023

Hilbert series, the Higgs mechanism, and HEFT

Brian Quinn Henning

We expand Hilbert series technologies in effective field theory for the inclusion of massive particles, enabling, among other things, the enumeration of operator bases for non-linearly realized gauge theories. We find that the Higgs mechanism is manifest a ...

SPRINGER2023

MSE-421: Statistical mechanics

This course presents an introduction to statistical mechanics geared towards materials scientists. The concepts of macroscopic thermodynamics will be related to a microscopic picture and a statistical

PHYS-403: Computer simulation of physical systems I

The two main topics covered by this course are classical molecular dynamics and the Monte Carlo method.

COM-490: Large-scale data science for real-world data

This hands-on course teaches the tools & methods used by data scientists, from researching solutions to scaling up prototypes to Spark clusters. It exposes the students to the entire data science pipe

Crank of a partition

In number theory, the crank of a partition of an integer is a certain integer associated with the partition. The term was first introduced without a definition by Freeman Dyson in a 1944 paper published in Eureka, a journal published by the Mathematics Society of Cambridge University. Dyson then gave a list of properties this yet-to-be-defined quantity should have. In 1988, George E. Andrews and Frank Garvan discovered a definition for the crank satisfying the properties hypothesized for it by Dyson.

Congruences de Ramanujan

En mathématiques, les congruences de Ramanujan sont des congruences remarquables à propos de la fonction de partition p(n). Le mathématicien Srinivasa Ramanujan a découvert les congruences: Cela signifie que Si un nombre est congru à 4 modulo 5, c'est-à-dire qu'il est compris dans la suite 4, 9, 14, 19, 24, 29, . . . alors le nombre de ses partitions est un multiple de 5. Si un nombre est congru à 5 modulo 7, c'est-à-dire qu'il est compris dans la suite 5, 12, 19, 26, 33, 40, . . .

Partition function (number theory)

In number theory, the partition function p(n) represents the number of possible partitions of a non-negative integer n. For instance, p(4) = 5 because the integer 4 has the five partitions 1 + 1 + 1 + 1, 1 + 1 + 2, 1 + 3, 2 + 2, and 4. No closed-form expression for the partition function is known, but it has both asymptotic expansions that accurately approximate it and recurrence relations by which it can be calculated exactly. It grows as an exponential function of the square root of its argument.

Définir des partitions

Explore les partitions de l'ensemble vide à l'ensemble complet, illustrant les relations de sous-ensembles.

Quantum Action efficace

Explore l'action quantique efficace, son rôle dans la théorie des perturbations et l'organisation des corrélateurs dans l'espace momentum.

Diffusion classique: dynamique à deux corps CH-310: Dynamics and kinetics

Couvre la dispersion classique des systèmes à deux corps et leurs niveaux d'énergie.