Related papers: A Partition Theorem

A partition of a positive integer $n$ is said to be $t$-core if none of its hook lengths are divisible by $t$. Recently, two analogues, $\overline{a}_t(n)$ and $\overline{b}_t(n)$, of the $t$-core partition function, $c_t(n)$, have been…

In a celebrated article, Moreira proved for every finite coloring of the set of naturals, there exists a monochromatic copy of the form $\{x,x+y,xy\},$ which gives a partial answer to one of the central open problems of Ramsey theory asking…

Let $\mathcal{A}=\left(a_i\right)_{i=1}^\infty$ be a weakly increasing sequence of positive integers and let $k$ be a fixed positive integer. For an arbitrary integer $n$, the restricted partition $p_\mathcal{A}(n,k)$ enumerates all the…

A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

Given two combinatorial notions $\mathsf{P}_0$ and $\mathsf{P}_1$, can we encode $\mathsf{P}_0$ via $\mathsf{P}_1$. In this talk we address the question where $\mathsf{P}_0$ is 3-coloring of integers and $\mathsf{P}_1$ is product of…

Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such…

For all positive integers $k,l,n$, the Little Glaisher theorem states that the number of partitions of $n$ into parts not divisible by $k$ and occurring less than $l$ times is equal to the number of partitions of $n$ into parts not…

For a set of nonnegative integers $S$ let $R_{S}(n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$. In this paper we focus on partitions of the natural numbers into two sets…

We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…

In this note we examine Littlewood's proof of the prime number theorem. We show that this can be extended to provide an equivalence between the prime number theorem and the non-vanishing of Riemann's zeta-function on the one-line. Our…

Using the properties of the ideal of the coordinate Hermite interpolation on n-dimensional grid [4], we prove that the extension k in k[x1, x2, ..., xn] / (f1(x1), ..., fn(xn)) has a primitive element if and only if at most one of the…

This short note establishes an abstract Hales--Jewett theorem for semigroups equipped with a finite family of retractions. The proof relies on the interplay between retractions and tensor products of ultrafilters.

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…

Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…

In the quantum theory, using the notion of partial supersymmetry, in which some, but not all, operators have superpartners we derive the Euler theorem in partition theory. The paraferminic partition function gives another identity in…

We consider $(k,j)$-colored partitions, partitions in which $k$ colors exist but at most $j$ colors may be chosen per size of part. In particular these generalize overpartitions. Advancing previous work, we find new congruences, including…

We consider the family B-tilde of bounded nonvanishing analytic functions f(z) = a_0 + a_1 z + a_2 z^2 + ... in the unit disk. The coefficient problem had been extensively investigated, and it is known that |a_n| <= 2/e for n=1,2,3, and 4.…

We prove that for all integers $\Delta,r \geq 2$, there is a constant $C = C(\Delta,r) >0$ such that the following is true for every sequence $\mathcal{F} = \{F_1, F_2, \ldots\}$ of graphs with $v(F_n) = n$ and $\Delta(F_n) \leq \Delta$,…

We apply some recent developments of Baldoni-Beck-Cochet-Vergne on vector partition function, to Kostant's and Steinberg's formulae, for classical Lie algebras $A\_r$, $B\_r$, $C\_r$, $D\_r$. We therefore get efficient {\tt Maple} programs…