Related papers: Congruence properties of binary partition function…

An FI-module $V$ over a commutative ring $\bf{k}$ encodes a sequence $(V_n)_{n \geq 0}$ of representations of the symmetric groups $(\mathfrak{S}_n)_{n \geq 0}$ over $\bf{k}$. In this paper, we show that for a "finitely generated" FI-module…

We show that for a fixed integer $n \neq \pm2$, the congruence $x^2 + nx \pm 1 \equiv 0 \pmod{\alpha}$ has the solution $\beta$ with $0 < \beta < \alpha$ if and only if $\alpha/\beta$ has a continued fraction expansion with sequence of…

The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of…

Recently, Amdeberhan, Sellers, and Singh introduced the notion of a generalized cubic partition function $a_c(n)$ and proved two isolated congruences via modular forms, namely, $a_3(7n+4)\equiv 0\pmod{7}$ and $a_5(11n+10)\equiv 0\pmod{11}$.…

Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…

We investigate integrality and divisibility properties of Fourier coefficients of meromorphic modular forms of weight $2k$ associated to positive definite integral binary quadratic forms. For example, we show that if there are no…

We present a class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ with bounded partial sums. The novelty here is that our functions do not need to have modulus bounded by $1$. The key feature is that they pretend to be the constant…

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

We compute the congruence class modulo 16 of the number of unique path partitions of $n$ (as defined by Olsson), thus generalising previous results by Bessenrodt, Olsson and Sellers [Ann. Combin. 13 (2013), 591-602].

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

In this paper we characterize, in terms of the prime divisors of $n$, the pairs $(k,n)$ for which $n$ divides $\sum_{j=1}^n j^{k}$. As an application, we study the sets $\mathcal{M}_f :=\{n: n \textrm{divides} \sum_{j=1}^n j^{f(n)} \}$ for…

If A is a set of nonnegative integers containing 0, then there is a unique nonempty set B of nonnegative integers such that every positive integer can be written in the form a+b, where a\in A and b\in B, in an even number of ways. We…

We study the function M(t,n) = Floor[ 1 / {t^(1/n)} ], where t is a positive real number, Floor[.] and {.} are the floor and fractional part functions, respectively. In a recent article in the Monthly, Nathanson proved that if log(t) is…

Commutators of a large class of bilinear operators and multiplication by functions in a certain subspace of the space of functions of bounded mean oscillations are shown to be jointly compact. Under a similar commutation, fractional…

The n-way number partitioning problem, a fundamental challenge in combinatorial optimization, has significant implications for applications such as fair division and machine scheduling. Despite these problems being NP-hard, many…

We give congruences modulo powers of 2 for the Fourier coefficients of certain level 2 modular functions with poles only at 0, answering a question posed by Andersen and the first author. The congruences involve a modulus that depends on…

We study an integer sequence associated with Cantor's division polynomials of a genus 2 curve having an integral point. We show that the reduction modulo $p$ of such a sequence is periodic for all but finitely many primes $p$, and describe…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called \emph{partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

For an integer $c\geq 1$, let $a_c(n)$ count the number of generalized cubic partitions of $n$, which are partitions of $n$ whose even parts may appear in $c$ different colors, and $d_c(n)$ count the number of partitions obtained by adding…