Related papers: Even and odd compositions with restricted parts
Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…
We give the first general constructions of even length quaternary Legendre pairs: there is a quaternary Legendre pair of length $(q-1)/2$ for every prime power $q$ congruent to $1$ modulo $4$, and there is a quaternary Legendre pair of…
In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…
In this paper we give a precise estimate of the discrepancy of a class of uniformly distributed sequences of partitions. Among them we found a large class having low discrepancy (which means of order 1/N. One of them is the…
By means of the derivative operator and Chu-Vandermonde convolution, four families of summation formulas involving harmonic numbers with even or odd indexes are established.
For a positive integer $r$, George Andrews proved that the set of partitions of $n$ in which odd multiplicities are at least $2r + 1$ is equinumerous with the set of partitions of $n$ in which odd parts are congruent to $2r + 1$ modulo $4r…
In this paper, we provide a new and sharper bound for the Legendre coefficients of differentiable functions and then derive a new error bound of the truncated Legendre series in the uniform norm. The key idea of proof relies on integration…
We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…
Weird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the existence of odd weird numbers has been an open problem. In this work, we describe our computational effort to search for odd weird numbers, which…
A classic theorem of Uchimura states that the difference between the sum of the smallest parts of the partitions of $n$ into an odd number of distinct parts and the corresponding sum for an even number of distinct parts is equal to the…
Considering Schur positivity of differences of plethysms of homogeneous symmetric functions, we introduce a new relation on integer partitions. This relation is conjectured to be a partial order, with its restriction to one part partitions…
Integer partitions have fascinated people for centuries, from Ramanujan's groundbreaking congruences to the modern theory of modular forms. This paper investigates the statistical properties of odd unimodal sequences--a natural refinement…
In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain normalizer chain is linked to the sequence of partitions of…
The crank-mex theorem states that the number of integer partitions of $n$ with nonnegative crank equals the number with odd minimal excludant (mex). Andrews and M. Newman recently refined that result in terms of the number of parts greater…
Translation from the Latin of Euler's "Demonstratio theorematis circa ordinem in summis divisorum observatum" (1760). E244 in the Enestroem index. In his previous paper E243, Euler stated the pentagonal number theorem and assuming it proved…
We prove that the number of partitions of an integer into at most b distinct parts of size at most n forms a unimodal sequence for n sufficiently large with respect to b. This resolves a recent conjecture of Stanley and Zanello.
In this note we conjecture Rogers-Ramanujan type colored partition identities for an array with odd number of rows w such that the first and the last row consist of even positive integers. In a strange way this is different from the…
A composition of $n\in\NN$ is an ordered collection of one or more positive integers whose sum is $n$. The number of summands is called the number of parts of the composition. A palindromic composition of $n$ is a composition of $n$ in…
For positive integers $s$ and $L \geq 3$, Berkovich and Uncu (Ann. Comb. $23$ ($2019$) $263$--$284$) conjectured an inequality between the sizes of two closely related sets of partitions whose parts lie in the interval $\{s, \ldots, L+s\}$.…
The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…