Related papers: A Chinese Remainder Theorem for Partitions

Let $X$ be a nonempty set, and let $\mathcal{T}_X$ be the full transformation semigroup on $X$. For a partition $\mathcal{P} = \{X_i \;|\; i\in I\}$ of $X$, we consider the semigroup $T(X, \mathcal{P}) = \{f\in \mathcal{T}_X\;|\; \forall…

Let $N(m,n)$ denote the number of partitions of $n$ with rank $m$, and let $M(m,n)$ denote the number of partitions of $n$ with crank $m$. Chan and Mao proved that for any nonnegative integers $m$ and $n$, $N(m,n)\geq N(m+2,n)$ and for any…

We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{\alpha_1}... p_s^{\alpha_s} q_1^{2\beta_1}... q_t^{2\beta_t}$ with $\beta_1, ..., \beta_t$ in some finite set S satisfies…

We study the large $N$ limit of partition functions for 5d supersymmetric gauge theories with fundamental matter. Depending on the matter content, we find that the scaling behaviour at the leading order can be either $N^2$ or…

We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.

A subset $\mathcal{A}\subseteq\mathbb{Z}$ is called $s$-almost square universal if every sufficiently large positive integer can be written as a sum of at most $s$ squares of integers from $\mathcal{A}$. In this article, we study the…

A seminal theorem of Tverberg states that any set of $T(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Almost any collection of fewer points in…

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

This paper explores the ability of the Chinese Remainder Theorem formalism to model Montgomery-type algorithms. A derivation of CRT based on Qin's Identity gives Montgomery reduction algorithm immediately. This establishes a unified…

We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…

Consider partitions, of a cardinality $(q-1)(d+1)+1$ generic subset of euclidean $d$-space, into $q$ parts whose convex hulls have a nonempty intersection. We show that if these partitions are counted with appropriate signs $\pm 1$ then the…

For a polynomial f: {-1, 1}^n --> C, we define the partition function as the average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is a parameter. We present a quasi-polynomial algorithm, which, given such f, lambda…

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

We present a simple, natural #P-complete problem. Let G be a directed graph, and let k be a positive integer. We define q(G;k) as follows. At each vertex v, we place a k-dimensional complex vector x_v. We take the product, over all edges…

Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…

For integers $k,t \geq 2$, and $1\leq r \leq t$ let $D_k^\times(r,t;n)$ be the number of parts among all $k$-indivisible partitions of $n$ (i.e., partitions where all parts are not divisible by $k$) of $n$ that are congruent to $r$ modulo…

Let $H, K$ be subgroups of the permutation group $G$ of degree $n$ with $K\trianglelefteq G$ and $\sigma$ be a partition of the set of all different prime divisors of $|G/K|$. We prove that in polynomial time (in $n$) one can check $G/K$…

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

We derive closed formulas for the number of $k$-coloured partitions and the number of plane partitions of $n$ in terms of the Bell polynomials.

We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of…