Related papers: A Simple Multiple Integral Solution to the Broken …

Suppose that we are given two independent sets I_b and I_r of a graph such that |I_b|=|I_r|, and imagine that a token is placed on each vertex in |I_b|. Then, the sliding token problem is to determine whether there exists a sequence of…

We apply a classic result in Theoretical Computer Science to solve a sticky problem, and give a neat and slick quick proof of half of it

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

An upward equilateral triangle of side $n$ can be partitioned into $n$ unit upward equilateral triangles and $\frac{n(n-1)}{2}$ unit rhombi with $60^{\circ}$ and $120^{\circ}$ angles. In this paper, we focus on understanding such partitions…

Let I be an independent set of a graph G. Imagine that a token is located on any vertex of I. We can now move the tokens of I along the edges of the graph as long as the set of tokens still defines an independent set of G. Given two…

Our object of study is the general class of stick-breaking processes with exchangeable length variables. These generalize well-known Bayesian non-parametric priors in an unexplored direction. We give conditions to assure the respective…

We consider the optimal conduction path of the one-dimensional variable-range hopping problem. We describe a hierarchical procedure for constructing the path which is in excellent agreement with numerical results obtained from a percolation…

If an n-side unit regular polygon is divided into m equal sized parts, then what is the minimum length of the split line ${l_{m,n}}$? This problem has its practical application in real world. This paper proved that ${l_{2,3}} = \sqrt…

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $\Delta(n,A)$ the number of ways to partition $n$ as the form…

The set of hook lengths of an integer partition $\lambda$ is the complement of some numerical semigroup $S$. There has been recent interest in studying the number of partitions with a given set of hook lengths. Very little is known about…

In this paper we present a new formula for the number of unrestricted partitions of $n$. We do this by introducing a correspondence between the number of unrestrited partitions of $n$ and the number of non-negative solutions of systems of…

The number partitioning problem consists of partitioning a sequence of positive numbers ${a_1,a_2,..., a_N}$ into two disjoint sets, ${\cal A}$ and ${\cal B}$, such that the absolute value of the difference of the sums of $a_j$ over the two…

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$.…

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

In this paper, we study a two-point boundary value problem consisting of the heat equation on the open interval $(0,1)$ with boundary conditions which relate first and second spatial derivatives at the boundary points. Moreover, the unique…

This short note deals with the so-called $ Sock \; Matching \; Problem$. We define $B_{n,k}$ as the number of all the finite sequences $a_1, \ldots, a_{2n}$ of nonnegative integers which contain at least one occurrence of $k$ $(1 \leq k…

Inspired by the work of Amdeberhan, Can, and Moll on broken necklaces, we define a broken bracelet as a linear arrangement of marked and unmarked vertices and introduce a generalization called $n$-stars, which is a collection of $n$ broken…

Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…

Given a set of integers, one can easily construct the set of their pairwise distances. We consider the inverse problem: given a set of pairwise distances, find the integer set which realizes the pairwise distance set. This problem arises in…

To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in general. In this paper we present an efficient solution for the homogeneous version of this problem; i.e. where the elements in each subset add…