Related papers: Fraenkel's Partition and Brown's Decomposition

Decompositional theories describe the ways in which a global physical system can be split into subsystems, facilitating the study of how different possible partitions of a same system interplay, e.g. in terms of inclusions or signalling. In…

Let $n$ particles move in standard Brownian motion in one dimension, with the process terminating if two particles collide. This is a specific case of Brownian motion constrained to stay inside a Weyl chamber; the Weyl group for this…

Given integer $n > 0$ and $m > 1$, we call a partition of set $[n] = \{1, \dots, n\}$ {\em $m$-good} if each of the partitioning sets is of size at most $m$ and the sum of numbers in it is a power of $m$, that is, $m^t$ for some $t \geq 0$.…

We construct an easily described family of partitions of the positive integers into $n$ disjoint sets with essentially the same structure for every $n \geq 2$. In a special case, it interpolates between the Beatty $\frac{1}{\phi} +…

Let $p(n)$ denote the partition function. In this article, we will show that congruences of the form $$ p(m^j\ell^kn+B)\equiv 0\mod m \text{for all} n\ge 0 $$ exist for all primes $m$ and $\ell$ satisfying $m\ge 13$ and $\ell\neq 2,3,m$.…

We determine the decomposition numbers of the partition algebra when the characteristic of the ground field is zero or larger than the degree of the partition algebra. This will allow us to determine for which exact values of the parameter…

We consider some $q$-series which depend on a pair of positive integers $(k,m)$. While positivity of these series holds for the first few values of $(k,m)$, the situation is quite unclear for other values of $(k,m)$. In addition, our series…

In 1973 Fraenkel discovered interesting sequences which split the positive integers. These sequences became famous, because of a related unsolved conjecture. Here we construct combinatorial games, with `playable' rulesets, with these…

Given a sequence of $N$ positive real numbers $\{a_1,a_2,..., a_N \}$, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of $a_j$ over the two sets is…

Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…

The number-theoretical problem of partition of an integer corresponds to $D=2$. This problem obeys the Bose--Eeinstein statistics, where repeated terms are admissible in the partition, and to the Fermi--Dirac statistics, where they are…

A positive linear recurrence sequence is of the form $H_{n+1} = c_1 H_n + \cdots + c_L H_{n+1-L}$ with each $c_i \ge 0$ and $c_1 c_L > 0$, with appropriately chosen initial conditions. There is a notion of a legal decomposition (roughly,…

By definition a separable state has the form \sum A_i \otimes B_i, where 0 \leq A_i, B_i for each i. In this paper we consider the class of states which admit such a decomposition with B_1, ..., B_p having independent images. We give a…

We consider a branching Brownian motion which starts from $0$ with drift $\mu \in \mathbb{R}$ and we focus on the number $Z_x$ of particles killed at $-x$, where $x>0$. Let us call $\mu_0$ the critical drift such that there is a positive…

It is well known that every positive integer can be expressed as a sum of nonconsecutive Fibonacci numbers provided the Fibonacci numbers satisfy $F_n =F_{n-1}+F_{n-2}$ for $n\geq 3$, $F_1 =1$ and $F_2 =2$. In this paper, for any…

This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…

If X and Y are independent, Y and Z are independent, and so are X and Z, one might be tempted to conclude that X, Y, and Z are independent. But it has long been known in classical probability theory that, intuitive as it may seem, this is…

We prove that the number of partitions of the hypercube ${\bf Z}_q^n$ into $q^m$ subcubes of dimension $n-m$ each for fixed $q$, $m$ and growing $n$ is asymptotically equal to $n^{(q^m-1)/(q-1)}$. For the proof, we introduce the operation…

We introduce the notion of "separation of conditions" meaning that a description of statistical data obtained from experiments, performed under a set of different conditions, allows for a decomposition such that each partial description…

This paper consists of two prongs. Firstly, we prove that any Specht module labelled by a 2-separated partition is semisimple and we completely determine its decomposition as a direct sum of graded simple modules. Secondly, we apply these…