Related papers: Partition function of the cyclic group

Recently, Hirschhorn and the first author considered the parity of the function $a(n)$ which counts the number of integer partitions of $n$ wherein each part appears with odd multiplicity. They derived an effective characterization of the…

For a random partition, one of the most basic questions is: what can one expect about the parts which arise? For example, what is the distribution of the parts of random partitions modulo $N$? Since most partitions contain a $1$, and indeed…

A $k$-regular partition into distinct parts is a partition into distinct parts with no part divisible by $k$. In this paper, we provide a general method to establish the unimodality of $k$-regular partition into distinct parts where the…

A necklace is an equivalence class of words of length $n$ over an alphabet under the cyclic shift (rotation) operation. As a classical object, there have been many algorithmic results for key operations on necklaces, including counting,…

George Andrews recently proved a new identity between the cardinalities of the set of Semi-Fibonacci partitions and the set of partitions into powers of two with all parts appearing an odd number of times. This paper extends the identity to…

We consider the number of the $6$-regular partitions of $n$, $b_6(n)$, and give infinite families of congruences modulo $3$ (in arithmetic progression) for $b_6(n)$. We also consider the number of the partitions of $n$ into distinct parts…

Let $pod_2(n)$ denote the number of $2$-regular partitions of $n$ with distinct odd parts (even parts are unrestricted). In this article, we obtain congruences for $pod_2(n)$ mod $2$ and mod $8$ using some generating function manipulations…

The (n,k)-arrangement graph A(n,k) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are adjacent if they agree in exactly k-1 positions. We introduce a cyclic decomposition for k-permutations…

In this article we give an order-dividing bijective function between cyclic and non cyclic groups of finite order. In particular, we prove that there exists a bijective function from D_{2n} to Z_{2n} for any natural integer n; and from Z_p…

Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially $q$-analogues, have useful interpretations related to actions and representations of the cyclic group. We propose a definition of sieving for an…

A convenient way to calculate $N$-particle quantum partition functions is by confining the particles in a weak harmonic potential instead of using a finite box or periodic boundary conditions. There is, however, a slightly different…

An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…

A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains. For positive integers $m$ and $n$, let $N(m,n)$ denote the set of all compositions $\alpha=(\alpha_1,\cdots,\alpha_m)$,…

Let $k,l,m,n$, and $\mu$ be positive integers. A $\mathbb{Z}_\mu$--{\it scheme of valency} $(k,l)$ and {\it order} $(m,n)$ is a $m \times n$ array $(S_{ij})$ of subsets $S_{ij} \subseteq \mathbb{Z}_\mu$ such that for each row and column one…

It is conjectured that for every pair $(\ell,m)$ of odd integers greater than 2 with $m \equiv 1\; \pmod{\ell}$, there exists a cyclic two-factorization of $K_{\ell m}$ having exactly $(m-1)/2$ factors of type $\ell^m$ and all the others of…

Let $s,t$ be natural numbers, and fix an $s$-core partition $\sigma$ and a $t$-core partition $\tau$. Put $d=\gcd(s,t)$ and $m= lcm(s,t)$, and write $N_{\sigma, \tau}(k)$ for the number of $m$-core partitions of length no greater than $k$…

It is shown in [7] by Venkaiah in 2015 that a category of the number of generalized can be computed using the expression \begin{equation*} e(n, q) = \frac{1}{(q-1) ord(\lambda) n} \sum^{ord(\lambda)n}_{\substack{t \in \mathbb{F}_q \setminus…

Given a sequence $S=(s_1,\dots,s_m) \in [0, 1]^m$, a block $B$ of $S$ is a subsequence $B=(s_i,s_{i+1},\dots,s_j)$. The size $b$ of a block $B$ is the sum of its elements. It is proved in [1] that for each positive integer $n$, there is a…

In this article, we identify the existence of a divisibility relationship between the number of ring homomorphisms and surjective group homomorphisms. We demonstrate that for finite cyclic structures, the number of ring homomorphisms from…

It is well-known that the 2-Thief-Necklace-Splitting problem reduces to the discrete Ham Sandwich problem. In fact, this reduction was crucial in the proof of the PPA-completeness of the Ham Sandwich problem [Filos-Ratsikas and Goldberg,…