Related papers: On arithmetic partitions of Z_n

In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…

We study the computational complexity of the membership problem for arithmetic circuits over natural numbers with division. We consider different subsets of the operations {intersection,union,complement,+,x,/}, where / is the element-wise…

A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…

The partition function $p(n)$ has been a testing ground for applications of analytic number theory to combinatorics. In particular, Hardy and Ramanujan invented the "circle method" to estimate the size of $p(n)$, which was later perfected…

Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…

Let $C_n$ denote a cyclic group of order $n$. In this paper we investigate modules and chain complexes over the constant integral Mackey functor $\underline{\mathbb{Z}}$ and perform some related homological calculations. Along the way we…

The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…

We provide a systematic method to compute arithmetic sums including some previously computed by Alaca, Alaca, Besge, Cheng, Glaisher, Huard, Lahiri, Lemire, Melfi, Ou, Ramanujan, Spearman and Williams. Our method is based on quasimodular…

We develop the theory of copartitions, which are a generalization of partitions with connections to many classical topics in partition theory, including Rogers-Ramanujan partitions, theta functions, mock theta functions, partitions with…

We study M(n), the number of distinct values taken by multinomial coefficients with upper entry n, and some closely related sequences. We show that both pP(n)/M(n) and M(n)/p(n) tend to zero as n goes to infinity, where pP(n) is the number…

Following T. H. Chan, we consider the problem of approximation of a given rational fraction a/q by sums of several rational fractions a_1/q_1, ..., a_n/q_n with smaller denominators. We show that in the special cases of n=3 and n=4 and…

We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…

In his book \emph{Topics in Analytic Number Theory}, Hans Rademacher conjectured that the limits of certain sequences of coefficients that arise in the ordinary partial fraction decomposition of the generating function for partitions of…

We prove two "master" convolution theorems for multivariate determinantal polynomials. The methods used include basic properties of what we call a "minor-orthogonal" ensemble as well as properties of the mixed discriminant of matrices. We…

Here we develop a technique of computing the invariants of $n-$ary forms and systems of forms using the discriminants of corresponding multilinear forms built of their partial derivatives, which should be cosidered as analogues of classical…

Bismut and Zhang computed the ratio of the Ray-Singer and the combinatorial torsions corresponding to non-unitary representations of the fundamental group. In this note we show that for representations which belong to a connected component…

Let $m\ge 2$ be a fixed positive integer. Suppose that $m^j \leq n< m^{j+1}$ is a positive integer for some $j\ge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this…

The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of…

In 2022, Z.-W. Sun defined \begin{equation*} w_k^{(\alpha)}{(x)}=\sum_{j=1}^{k}w(k,j)^{\alpha}x^{j-1}, \end{equation*} where $k,\alpha$ are positive integers and $w(k,j)=\frac{1}{j}\binom{k-1}{j-1}\binom{k+j}{j-1}$. Let $(x)_{0}=1$ and…

The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…