Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
CRANK 0 PARTITIONS AND THE PARITY OF THE PARTITION FUNCTION
View through CrossRef
A well-known problem regarding the integer partition function p(n) is the parity problem, how often is p(n) even or odd? Motivated by this problem, we obtain the following results: (1) A generating function for the number of crank 0 partitions of n. (2) An involution on the crank 0 partitions whose fixed points are called invariant partitions. We then derive a generating function for the number of invariant partitions. (3) A generating function for the number of self-conjugate rank 0 partitions.
Title: CRANK 0 PARTITIONS AND THE PARITY OF THE PARTITION FUNCTION
Description:
A well-known problem regarding the integer partition function p(n) is the parity problem, how often is p(n) even or odd? Motivated by this problem, we obtain the following results: (1) A generating function for the number of crank 0 partitions of n.
(2) An involution on the crank 0 partitions whose fixed points are called invariant partitions.
We then derive a generating function for the number of invariant partitions.
(3) A generating function for the number of self-conjugate rank 0 partitions.
Related Results
Partition Narratives in Literature and Films.
Partition Narratives in Literature and Films.
Partition of the Indian subcontinent is the darkest chapter in our history. India was divided into two halves and the reason of this fateful division was a consequence of many even...
Common Cases of Partition Recovery
Common Cases of Partition Recovery
A number of automatic operations are carried out by partition recovery tools
in an effort to repair damaged or erased partitions and/or recover data from them. A
deleted partition ...
Partition Diversity in Complex Networks
Partition Diversity in Complex Networks
Diversité des partitions dans les réseaux complexes
La diversité des partitions dans les réseaux complexes provient de la coexistence de multiples manières plausibl...
Quelques résultats combinatoires autour de la décomposition de Littlewood
Quelques résultats combinatoires autour de la décomposition de Littlewood
Cette thèse s'intéresse à des objets de combinatoire énumérative et plus particulièrement aux partitions d'entiers. Les partitions et les tableaux de Young sont des objets combinat...
Research On Roundness Error Consistency Model For Crank Journal Cylindrical grinding
Research On Roundness Error Consistency Model For Crank Journal Cylindrical grinding
Abstract
Cylindrical grinding is an important way to form the external shape error of the crank journal, and the accuracy consistency directly affects the interchangeabilit...
Comparative Study of Crank-Nicolson and Modified Crank-Nicolson Numerical methods to solve linear Partial Differential Equations
Comparative Study of Crank-Nicolson and Modified Crank-Nicolson Numerical methods to solve linear Partial Differential Equations
Objectives: This paper aims to address the limitations of the Crank-Nicolson Finite Difference method and propose an improved version called the modified Crank-Nicolson method. Met...
Impact of Stiffness of Quadriceps on the Pedaling Rate of Maximal Cycling
Impact of Stiffness of Quadriceps on the Pedaling Rate of Maximal Cycling
Propulsive power is one of the factors that determine the performance of sprint cycling. Pedaling rate is related to power output, and stiffness is associated with improving perfor...
An Algorithmic Classification of Generalized Pseudo-Anosov Homeomorphisms via Geometric Markov Partitions
An Algorithmic Classification of Generalized Pseudo-Anosov Homeomorphisms via Geometric Markov Partitions
Une Classification Algorithmique des Homéomorphismes Pseudo-Anosov Généralisés via les Partitions Géométriques de Markov
Cette thèse vise à fournir une classificati...