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
mbers. 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.
We identify a class of semi-modular forms invariant on special subgroups of $GL_2(mathbb Z)$, which includes classical modular forms together with complementary classes of functions that are also nice in a specific sense. We define an Eisenstein-like
series summed over integer partitions, and use it to construct families of semi-modular forms.
A palindromic composition of $n$ is a composition of $n$ which can be read the same way forwards and backwards. In this paper we define an anti-palindromic composition of $n$ to be a composition of $n$ which has no mirror symmetry amongst its parts.
We then give a surprising connection between the number of anti-palindromic compositions of $n$ and the so-called tribonacci sequence, a generalization of the Fibonacci sequence. We conclude by defining a new q-analogue of the Fibonacci sequence, which is related to certain equivalence classes of anti-palindromic compositions
Refining a result of Erdos and Mays, we give asymptotic series expansions for the functions $A(x)-C(x)$, the count of $nleq x$ for which every group of order $n$ is abelian (but not all cyclic), and $N(x)-A(x)$, the count of $nleq x$ for which every
group of order $n$ is nilpotent (but not all abelian).
In recent work, G. E. Andrews and G. Simay prove a surprising relation involving parity palindromic compositions, and ask whether a combinatorial proof can be found. We extend their results to a more general class of compositions that are palindromic
modulo $m$, that includes the parity palindromic case when $m=2$. We then provide combinatorial proofs for the cases $m=2$ and $m=3$.
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 well known that for all $ngeq1$ the number $n+ 1$ is a divisor of the central binomial coefficient ${2nchoose n}$. Since the $n$th central binomial coefficient equals the number of lattice paths from $(0,0)$ to $(n,n)$ by unit steps north or ea
st, a natural question is whether there is a way to partition these paths into sets of $n+ 1$ paths or $n+1$ equinumerous sets of paths. The Chung-Feller theorem gives an elegant answer to this question. We pose and deliver an answer to the analogous question for $2n-1$, another divisor of ${2nchoose n}$. We then show our main result follows from a more general observation regarding binomial coefficients ${nchoose k}$ with $n$ and $k$ relatively prime. A discussion of the case where $n$ and $k$ are not relatively prime is also given, highlighting the limitations of our methods. Finally, we come full circle and give a novel interpretation of the Catalan numbers.
We look at upper bounds for the count of certain primes related to the Fermat numbers $F_n=2^{2^n}+1$ called elite primes. We first note an oversight in a result of Krizek, Luca and Somer and give the corrected, slightly weaker upper bound. We then a
ssume the Generalized Riemann Hypothesis for Dirichlet L functions and obtain a stronger conditional upper bound.
Schinzel and Wojcik have shown that if $alpha, beta$ are rational numbers not $0$ or $pm 1$, then $mathrm{ord}_p(alpha)=mathrm{ord}_p(beta)$ for infinitely many primes $p$, where $mathrm{ord}_p(cdot)$ denotes the order in $mathbb{F}_p^{times}$. We be
gin by asking: When are there infinitely many primes $p$ with $mathrm{ord}_p(alpha) > mathrm{ord}_p(beta)$? We write down several families of pairs $alpha,beta$ for which we can prove this to be the case. In particular, we show this happens for 100% of pairs $A,2$, as $A$ runs through the positive integers. We end on a different note, proving a version of Schinzel and W{o}jciks theorem for the integers of an imaginary quadratic field $K$: If $alpha, beta in mathcal{O}_K$ are nonzero and neither is a root of unity, then there are infinitely many maximal ideals $P$ of $mathcal{O}_K$ for which $mathrm{ord}_P(alpha) = mathrm{ord}_P(beta)$.
