Related papers: Rooted partitions and number-theoretic functions
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…
The elementary symmetric partition function is a map on the set of partitions. It sends a partition lambda to the partition whose parts are the summands in the evaluation of the elementary symmetric function on the parts of lambda. These…
Let e_k(x_1,...,x_l) be an elementary symmetric polynomial and let mu = (mu_1,...,mu_l) be an integer partition. Define pre_k(mu) to be the partition whose parts are the summands in the evaluation e_k(mu_1,...,mu_l). The study of such…
A pair of numbers is amicable if each number equals the sum of the proper divisors of the other. This paper after exploring the history and evolution of amicable numbers, introduces a novel characterization of amicable pairs whose greatest…
Motivated by a recent paper of Straub, we study the distribution of integer partitions according to the length of their largest hook, instead of the usual statistic, namely the size of the partitions. We refine Straub's analogue of Euler's…
Observing a multiple version of the divisor function we introduce a new zeta function which we call a multiple finite Riemann zeta function. We utilize some $q$-series identity for proving the zeta function has an Euler product and then,…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
The main aim of this paper is twofold: (1) Suggesting a statistical mechanical approach to the calculation of the generating function of restricted integer partition functions which count the number of partitions --- a way of writing an…
The homogeneous weights and the M\"obius functions and Euler phi-functions on finite rings are discussed; some computational formulas for these functions on finite principal ideal rings are characterized; for the residue rings of integers,…
Recently, Andrews, Dixit and Yee defined two partition functions $p_{\omega}(n)$ and $p_{\nu}(n)$ that are related with Ramanujan's mock theta functions $\omega(q)$ and $\nu(q)$, respectively. In this paper, we present two variable…
In this paper, we generalize a few important results in Integer Partitions; namely the results known as Stanley's theorem and Elder's theorem, and the congruence results proposed by Ramanujan for the partition function. We generalize the…
In this note we study numerically the combinatorics of curves and geodesics on the torus with one boundary component. A potential computational difficulty is avoided by counting inside specific orbits of the mapping class group up to a…
The partition function of a factor graph and the partition function of the dual factor graph are related to each other by the normal factor graph duality theorem. We apply this result to the classical problem of computing the partition…
We establish two expansions of the Potts model partition function of a graph. One is along the deletions of a graph, a rewritten formula given in Biggs (1977). The other is along the contractions of a graph. Then, we specialize the…
We extend the Euler's totient function (from arithmetic) to any irreducible subfactor planar algebra, using the Mobius function of its biprojection lattice, as Hall did for the finite groups. We prove that if it is nonzero then there is a…
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…
In this note, we provide three new, very short proofs of two interesting congruences for Merca's partition function $a(n)$, which enumerates integer partitions where the odd parts have multiplicity at most 2. These modulo 2 congruences were…
We revisit several partition-theoretic generating functions, including the theta quotients from Ramanujan's lost notebook, MacMahon's partition functions, and reciprocal sums of parts in partitions, through the lens of the classical Fa\`{a}…
We obtain a unification of two refinements of Euler's partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodt's insertion algorithm for a generalization of the Andrews-Olsson partition identity is used…
We derive continued fractions for partition generating functions, utilizing both Euler's techniques and Ramanujan's techniques. Although our results are for integer partitions there is scope to extend this work to vector partitions,…