ﻻ يوجد ملخص باللغة العربية
In this article we study the norm of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of current research by both authors. We survey known results and give new results related to this all-but-overlooked object, which, it turns out, plays a comparable role in partition theory to the size, length, and other standard partition statistics.
We study a bijective map from integer partitions to the prime factorizations of integers that we call the supernorm of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors of natural nu
Let $f(n)$ and $g(n)$ be the number of unordered and ordered factorizations of $n$ into integers larger than one. Let $F(n)$ and $G(n)$ have the additional restriction that the factors are coprime. We establish the asymptotic bounds for the sums of $
It is a well-known conjecture in the theory of irregularities of distribution that the L1 norm of the discrepancy function of an N-point set satisfies the same asymptotic lower bounds as its L^2 norm. In dimension d=2 this fact has been established b
In an additive group (G,+), a three-dimensional corner is the four points g, g+d(1,0,0), g+d(0,1,0), g+d(0,0,1), where g is in G^3, and d is a non-zero element of G. The Ramsey number of interest is R_3(G) the maximal cardinality of a subset of G^3 t
One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was strengthened by Subba