Do you want to publish a course? Click here

The product of parts or norm of a partition

80   0   0.0 ( 0 )
 Added by Robert Schneider
 Publication date 2019
  fields
and research's language is English




Ask ChatGPT about the research

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.



rate research

Read More

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 numbers. The supernorm is connected to a family of maps we define, which suggests the potential to apply techniques from partition theory to identify and prove multiplicative properties of integers. We make a brief study of pertinent analytic aspects of the supernorm. Then, as an application of supernorma mappings (i.e., pertaining to the supernorm statistic), we prove an analogue of a formula of Kural-McDonald-Sah to give arithmetic densities of subsets of $mathbb N$ instead of natural densities in $mathbb P$ like previous formulas of this type; this builds on works of Alladi, Ono, Wagner, and the first and third authors. Finally, using a table of supernormal additive-multiplicative correspondences, we conjecture Abelian-type formulas that specialize to our main theorem and other known results.
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 $F(n)^{beta}$ and $G(n)^{beta}$ up to $x$ for all real $beta$ and the asymptotic bounds for $f(n)^{beta}$ and $g(n)^{beta}$ for all negative $beta$.
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 by Halasz, while in higher dimensions the problem is wide open. In this note, we establish a series of dichotomy-type results which state that if the L^1 norm of the discrepancy function is too small (smaller than the conjectural bound), then the discrepancy function has to be large in some other function space.
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 that does not contain a three-dimensional corner. Furstenberg and Katznelson have shown R_3(Z_N) is little-o of N^3, and in fact the corresponding result holds in all dimensions, a result that is a far reaching extension of the Szemeredi Theorem. We give a new proof of the finite field version of this fact, a proof that is a common generalization of the Gowers proof of Szemeredis Theorem for four term progressions, and the result of Shkredov on two-dimensional corners. The principal tool are the Gowers Box Norms.
113 - Daniel C. McDonald 2014
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 Subbarao in 1966 to say that both $p(2n)$ and $p(2n+1)$ take each value of parity infinitely often. These results have received several other proofs, each relying to some extent on manipulating generating functions. We give a new, self-contained proof of Subbaraos result by constructing a series of bijections and involutions, along the way getting a more general theorem concerning the enumeration of a special subset of integer partitions.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا