Related papers: Some Partitionings of Complete Designs

In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Gra{\ss}mannian into joins are discussed. This framework admits a generalization of large set recursion methods for block designs to…

Consider the set $\{1,2,\ldots,3n\}$. We are interested in the number of partitions of this set into subsets of three elements each, where the sum of two of them equals the third. We give some criteria such a partition has to fulfill, which…

We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.

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 give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…

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…

Let $D=(V,A)$ be a directed graph of order $n\geq 6$. Let $W$ be a subset of $V$ with $|W|\geq 6$. Suppose that every vertex of $W$ has degree at least $(3n-3)/2$ in $D$. Then for any integer partition $|W|=n_1+n_2$ with $n_1\geq 3$ and…

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…

Trades are important objects in combinatorial design theory that may be realized as certain elements of kernels of inclusion matrices. Total trades were introduced recently by Ghorbani, Kamali and Khosravshahi, who showed that over a field…

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 use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In…

In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…

In this paper, we show that for all v\pmod 1 (mod 3), there exists a super- simple (v, 4, 2) directed design. Also, we show that for these parameters there exists a super-simple (v, 4, 2) directed design whose each defining set has at least…

In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…

We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…

The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of…

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…

Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a…

This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…

This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…