Related papers: N-colored generalized Frobenius partitions: Genera…

Improving on some results of J.-L. Nicolas \cite {Ndeb}, the elements of the set ${\cal A}={\cal A}(1+z+z^3+z^4+z^5)$, for which the partition function $p({\cal A},n)$ (i.e. the number of partitions of $n$ with parts in ${\cal A}$) is even…

Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…

Let $\Phi$ be an finite root system with corresponding reflection group $W$ and let $m$ be a nonnegative integer. We consider the generalized cluster complex $\Delta^m(\Phi)$ defined by S. Fomin and N. Reading and the poset $NC_{(m)}(W)$ of…

Let $k$ be an algebraically closed field of characteristic $p > 3$. Let $A$ be an abelian surface over $k$. Fix an integer $n \geq 1$ such that $p \nmid n$ and let $K^{[n]}$ be the $n$-th Generalized Kummer Variety associated to $A$. In…

We generalize the asymptotic estimates by Bubboloni, Luca and Spiga (2012) on the number of $k$-compositions of $n$ satisfying some coprimality conditions. We substantially refine the error term concerning the number of $k$-compositions of…

We develop filtered-graded techniques for algebras in monoidal categories with the main goal of establishing a categorical version of Bongale's 1967 result: A filtered deformation of a Frobenius algebra over a field is Frobenius as well.…

In this paper we introduce and study a family $\Phi_k$ of arithmetic functions generalizing Euler's totient function. These functions are given by the number of solutions to the equation $\gcd(x_1^2+\ldots +x_k^2, n)=1$ with $x_1,\ldots,x_k…

Let $m$ be a positive integer and let $\rho(m,n)$ be the proportion of permutations of the symmetric group ${\rm Sym}(n)$ whose order is coprime to $m$. In 2002, Pouyanne proved that $\rho(n,m)n^{1-\frac{\phi(m)}{m}}\sim \kappa_m$ where…

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…

Fix a partition $\mu=(\mu_1,\dotsc,\mu_m)$ of an integer $k$ and positive integer $d$. For each $n>k$, let $\chi^\lambda_\mu$ denote the value of the irreducible character of $S_n$ at a permutation with cycle type…

In this paper, we discuss P(n), the number of ways in which a given integer n may be written as a sum of primes. In particular, an asymptotic form P_as(n) valid for n towards infinity is obtained analytically using standard techniques of…

Let $C$ be a modular category of Frobenius-Perron dimension $dq^n$, where $q$ is a prime number and $d$ is a square-free integer. We show that if $q>2$ then $C$ is integral and nilpotent. In particular, $C$ is group-theoretical. In the…

Andrews and Merca [J. Combin. Theory Ser. A 203 (2024), Art. 105849] recently obtained two interesting results on the sum of the parts with the same parity in the partitions of $n$ (the modulo $2$ case), the proof of which relies on…

The feedback class of a locally Brunovsky linear system is fully determined by the decomposition of state space as direct sum of system invariants [4]. In this paper we attack the problem of enumerating all feedback classes of locally…

In this paper we prove that the number of partitions into squares with an even number of parts is asymptotically equal to that of partitions into squares with an odd number of parts. We further show that, for $ n $ large enough, the two…

In this paper we generalize an identity first given by Heinrich Eduard Heine in his treatise, {\it Handbuch der Kugelfunctionen, Theorie und Anwendungen (1881), which gives a Fourier series for $1/[z-\cos\psi]^{1/2}$, for $z,\psi\in\R$, and…

Let S and T be sets of positive integers and let a be a fixed positive integer. An a-shifted partition identity has the form p(S,n)=p(T,n-a), for all n greater or equal to a. Here p(S,n) is the number partitions of n whose parts are…

For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. Then it is well known that only finitely many positive integers…

Let $N \geq2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. Frobenius number of this $N$-tuple is defined to be the largest positive integer that cannot be expressed as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are…

We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews' results in [5]. The novelty is that the method constructs solutions to functional equations…