Related papers: Algebraic and transcendental formulas for the smal…

Using a recent improvement by Bettin and Chandee to a bound of Duke, Friedlander and Iwaniec~(1997) on double exponential sums with Kloosterman fractions, we establish a uniformity of distribution result for the fractional parts of Dedekind…

Taking (2+1)-dimensional pure Einstein gravity for arbitrary genus $g$ as a model, we investigate the relation between the partition function formally defined on the entire phase space and the one written in terms of the reduced phase…

Let $b(n)$ be the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ consists of distinct odd parts, and $\pi_2$ and $\pi_3$ consist of parts divisible by $4$. Utilizing modular forms, Lin obtained the generating…

The minimal excludant of an integer partition is the least positive integer missing from the partition. Let $\sigma_o\text{mex}(n)$ (resp., $\sigma_e\text{mex}(n)$) denote the sum of odd (resp., even) minimal excludants over all the…

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…

The minimal excludant, or "mex" function, on a set $S$ of positive integers is the least positive integer not in $S$. In a recent paper, Andrews and Newman extended the mex-function to integer partitions and found numerous surprising…

This paper studies partitions in the space of antimonotonic boolean functions on sets of n elements. The antimonotonic functions are the antichains of the partially ordered set of subsets. We analyse and characterise a natural partial…

The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…

Andrews and Newman introduced the mex-function $\text{mex}_{A,a}(\lambda)$ for an integer partition $\lambda$ of a positive integer $n$ as the smallest positive integer congruent to $a$ modulo $A$ that is not a part of $\lambda$. They then…

For a prime $p$, let $Z(p)$ be the smallest positive integer $n$ so that $p$ divides $F_{n}$, the $n$th term in the Fibonacci sequence. Paul Bruckman and Peter Anderson conjectured a formula for $\zeta(m)$, the density of primes $p$ for…

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

The explicit formulas of operations, in particular addition and multiplication, of $p $-adic integers are presented. As applications of the results, at first the explicit formulas of operations of Witt vectors with coefficients in…

Bringmann, Lovejoy, and Osburn showed that the generating functions of the spt-overpartition functions spt(n), spt1(n), spt2(n), and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews,…

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

In this paper we study the partial Brauer $\mathbb{C}$-algebras $\mathfrak{R}_n(\delta,\delta')$, where $n \in \mathbb{N}$ and $\delta,\delta'\in\mathbb{C}$. We show that these algebras are generically semisimple, construct the Specht…

For $ k \in \mathbb{N}$ we introduce an idempotent subalgebra, the spherical partition algebra ${\mathcal{SP} }_{k}$, of the partition algebra ${\mathcal{P} }_{k}$, that we define using an embedding associated with the trivial…

We prove multiplicative congruences mod $2^{12}$ for George Andrews's partition function, $\overline{\mathcal{EO}}(n)$, the number of partitions of $n$ in which every even part is less than each odd part and only the largest even part…

Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we presented sub-tree based upper and lower bounds on the partition…

In this paper we propose an Almansi-type decomposition for slice regular functions of several quaternionic variables. Our method yields $2^n$ distinct and unique decompositions for any slice function with domain in $\mathbb{H}^n$. Depending…

This article discusses the classical problem of how to calculate $r_n(m)$, the number of ways to represent an integer $m$ by a sum of $n$ squares from a computational efficiency viewpoint. Although this problem has been studied in great…