English
Related papers

Related papers: Partitions of finite nonnegative integer sets with…

200 papers

Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…

Combinatorics · Mathematics 2023-01-11 Riccardo Aragona , Lorenzo Campioni , Roberto Civino , Massimo Lauria

We denote the number of partitions of $n$ wherein the even parts are distinct (and the odd parts are unrestricted) by $ped(n)$. In this paper, we will use generating function manipulations to obtain new congruences for $ped(n)$ modulo $24$.

Number Theory · Mathematics 2024-10-08 Hemjyoti Nath

For $m\geq 1$, let $0<b_0<b_1<...<b_m$ and $\ e_0,e_1,...,e_m>0$ be fixed positive integers. Assume there exists a prime $p$ and an integer $t>0$ such that $p^t\mid b_0$, but $p^t\nmid b_{i}\ {\rm for}\ 1\leq i\leq m$. Then, we prove that…

Number Theory · Mathematics 2011-08-31 Yan Li , Lianrong Ma

Let X = S \oplus G, where S is a countable abelian semigroup and G is a countably infinite abelian group such that {2g : g in G} is infinite. Let pi: X \to G be the projection map defined by pi(s,g) = g for all x =(s,g) in X. Let f:X \to…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

A partition n = p_1 + p_2 + ... + p_k with 1 <= p_1 <= p_2 <= ... <= p_k is called non-squashing if p_1 + ... + p_j <= p_{j+1} for 1 <= j <= k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the…

Combinatorics · Mathematics 2014-09-17 N. J. A. Sloane , James A. Sellers

Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…

Number Theory · Mathematics 2020-02-19 Chiranjit Ray , Rupam Barman

We study the poset of d-indivisible noncrossing partitions introduced by M\"uhle, Nadeau and Williams. These are noncrossing partitions such that each block has cardinality 1 modulo d and each block of the dual partition also has…

Combinatorics · Mathematics 2024-10-15 Richard Ehrenborg , Gábor Hetyei

Given an infinite sequence of positive integers $\cA$, we prove that for every nonnegative integer $k$ the number of solutions of the equation $n=a_1+...+a_k$, $a_1,\,..., a_k\in \cA$, is not constant for $n$ large enough. This result is a…

Number Theory · Mathematics 2013-05-09 Juanjo Rué

We prove that for a positive integer $c$ and any given $\varepsilon$, $0<\varepsilon<1$, the number $N(c)$ of equations $c=a+b$, $a<b$, with positive coprime integers $a$ and $b$, which satisfy the inequality $$c <…

Number Theory · Mathematics 2009-04-14 Constantin M. Petridi

A numerical semigroup is a cofinite subset of the non-negative integers that is closed under addition and contains 0. Each numerical semigroup $S$ with fixed smallest positive element $m$ corresponds to an integer point in a rational…

We study the generating function of the excess number of Rogers-Ramanujan partitions with odd rank over those with even rank, and, using combinatorial and analytical techniques, show that this generating function is closely connected with…

Combinatorics · Mathematics 2025-08-07 Atul Dixit , Gaurav Kumar , Aviral Srivastava

Two algorithms for computing $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, are described, and using a combination of these two algorithms, the resulting algorithm is $O(n^{3/2})$. The second algorithm uses a list…

Number Theory · Mathematics 2022-06-07 M. J. Kronenburg

In this note we give representations for the partition algebra A_3(Q) in Young's seminormal form. For this purpose, we also give characterizations of A_n(Q) and$A_{n-1/2}(Q).

Representation Theory · Mathematics 2010-02-03 Masashi Kosuda

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

Combinatorics · Mathematics 2018-05-01 Daniel Yaqubi , Madjid Mirzavaziri

In this note a bijection is constructed between the set of partitions of n simultaneously s-regular and t-distinct, and those simultaneously t-regular and s-distinct. Some implications of the map are discussed. As a generalized version of…

Combinatorics · Mathematics 2022-08-04 William J. Keith

In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…

Combinatorics · Mathematics 2024-07-01 Thomas Y. He , C. S. Huang , H. X. Li , X. Zhang

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on single-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

Logic · Mathematics 2014-10-21 Apoloniusz Tyszka

Let $D$ be a quaternion division algebra over a non-archimedean local field $F$ of characteristic zero. Let $E/F$ be a quadratic extension and $\rm{SL}_{n}^{*}(E) = {\rm{GL}}_{n}(E) \cap \rm{SL}_{n}(D)$. We study distinguished…

Representation Theory · Mathematics 2025-01-09 Kwangho Choiy , Shiv Prakash Patel

Let $G$ be an additive finite abelian group, and let $\mathrm{disc}(G)$ denote the smallest positive integer $t$ with the property that every sequence $S$ over $G$ with length $|S|\geq t $ contains two nonempty zero-sum subsequences of…

Combinatorics · Mathematics 2025-10-17 Wanzhen Hui , Xue Li

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…