相关论文: Unrefinable partitions into distinct parts in a no…
Let $p$ be any prime. We determine precisely those irreducible characters of symmetric groups which contain at most $p$ distinct linear constituents in their restriction to a Sylow $p$-subgroup, answering a question of Giannelli and…
A partial Steiner triple system is is $sequenceable$ if the points can be sequenced so that no proper segment can be partitioned into blocks. We show that, if $0 \leq a \leq (n-1)/3$, then there exists a nonsequenceable PSTS$(n)$ of size…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
The number of sequences of odd length in strict partitions (denoted as $\mathrm{sol}$), which plays a pivotal role in the first paper of this series, is investigated in different contexts, both new and old. Namely, we first note a direct…
Following Cayley, MacMahon, and Sylvester, define a non-unitary partition to be an integer partition with no part equal to one, and let $\nu(n)$ denote the number of non-unitary partitions of size $n$. In a 2021 paper, the sixth author…
We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…
Partitions of [n]={1,2,...,n} into sets of lists are counted by sequence number A000262 in the On-Line Encyclopedia of Integer Sequences. They are somewhat less numerous than partitions of [n] into lists of sets, A000670. Here we observe…
In this paper, we consider the set of partitions $pend(n)$ which enumerates the number of partitions of $n$ wherein the even parts are not allowed to be distinct. Using a result of Newman, we prove a few infinite families of congruences…
In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved
Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…
The covering number of a non-linear character $\chi$ of a finite group $G$ is the least positive integer $k$ such that every irreducible character of $G$ occurs in $\chi^k$. We determine the covering numbers of irreducible characters of the…
For a set of nonnegative integers $S$ let $R_{S}(n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$. In this paper we focus on partitions of the natural numbers into two sets…
For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…
In this paper we introduce a family of partitions of the set of natural numbers, Fibonacci-like partitions. In particular, we introduce a Fibonacci-like partition in a number of parts corresponding to the Fibonacci numbers, the standard…
The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…
We study explicit continued fraction expansions for certain series. Some of these expansions have symmetry that generalizes some remarkable examples discovered independently by Kmosek and Shallit. Furthermore, we prove the following…
A Goellnitz-Gordon partition is one in which the parts differ by at least 2, and where the inequality is strict if a part is even. Let Q_i(n) denote the number of partitions of n into distinct parts not congruent to i mod 4. By attaching…
It is well known that the number of partitions into distinct even parts equals the number of $4$-regular partitions. In this paper we prove identities relating certain restricted partitions into distinct even parts with restricted…
A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…
The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…