相关论文: Generating All Partitions: A Comparison Of Two Enc…

In this paper we give a fast algorithm to generate all partitions of a positive integer $n$. Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. It is known that the…

In this note, I discuss results on integer compositions/partitions given in the paper "A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions". I also experiment with four…

A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

In this report, we summarize the set partition enumeration problems and thoroughly explain the algorithms used to solve them. These algorithms iterate through the partitions in lexicographic order and are easy to understand and implement in…

In this paper, we introduce the generating functions of partition sequences. Partition sequences have a one-to-one correspondence with partitions. Therefore, the generating function has no multiplicity and appears meaningless initially.…

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…

We propose Composition Sampling, a simple but effective method to generate diverse outputs for conditional generation of higher quality compared to previous stochastic decoding strategies. It builds on recently proposed plan-based neural…

I propose two simple ways of generating the partitions of (n+1) from the partitions of n. A recurrence relation for P(n+1), the number of partitions of (n+1), in terms of P(n) and Q(n), where Q(n) denotes the number of partitions of n…

This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…

We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the…

We use generating functions to enumerate Arndt compositions, that is, integer compositions where there is a descent between every second pair of parts, starting with the first and second part, and so on. In 2013, J\"org Arndt noted that…

Can we use machine learning to compress graph data? The absence of ordering in graphs poses a significant challenge to conventional compression algorithms, limiting their attainable gains as well as their ability to discover relevant…

The paper introduce a new type of partitions where the largest part appears exactly once, and the remaining parts constitute a partition of that largest part. We derive the generating function associated with these partitions and…

New families of fourth-order composition methods for the numerical integration of initial value problems defined by ordinary differential equations are proposed. They are designed when the problem can be separated into three parts in such a…

This paper presents a new method for automatically generating numerical invariants for imperative programs. Given a program, our procedure computes a binary input/output relation on program states which over-approximates the behaviour of…

We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…

Using the slow triangle map (a type of multi-dimensional continued fraction algorithm), we exhibit a method for generating any number of new identities for subsets of integer partitions.

Recently, a novel method based on coding partitions [1]-[4] has been used to derive power series expansions to previously intractable problems. In this method the coefficients at $k$ are determined by summing the contributions made by each…

Conditional neural text generation models generate high-quality outputs, but often concentrate around a mode when what we really want is a diverse set of options. We present a search algorithm to construct lattices encoding a massive number…