Results 251 to 260 of about 361,091 (296)
False and partial Eisenstein-type series related to unimodal sequences. [PDF]
Res Math SciBringmann K, Pandey BV, van Ittersum JW.
europepmc +1 more source
Any Topological Recursion on a Rational Spectral Curve is KP Integrable. [PDF]
Commun Math PhysAlexandrov A +4 more
europepmc +1 more source
Unattainable regions in the space of genetic relationships. [PDF]
J Math BiolMostad P, Egeland T, Vigeland MD.
europepmc +1 more source
On the minimum common integer partition problem
ACM Transactions on Algorithms, 2008 We introduce a new combinatorial optimization problem in this article, called the minimum common integer partition (MCIP) problem, which was inspired by computational biology applications including ortholog assignment and DNA fingerprint assembly.
exaly +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Bulletin of the Australian Mathematical Society, 2021
AbstractWe show that there are biases in the number of appearances of the parts in two residue classes in the set of ordinary partitions. More precisely, let $p_{j,k,m} (n)$ be the number of partitions of n such that there are more parts congruent to j modulo m than parts congruent to k modulo m for $m \geq 2$ . We prove that $p_{1,0,m} (n)$ is
BYUNGCHAN KIM, EUNMI KIM
openaire +1 more source
AbstractWe show that there are biases in the number of appearances of the parts in two residue classes in the set of ordinary partitions. More precisely, let $p_{j,k,m} (n)$ be the number of partitions of n such that there are more parts congruent to j modulo m than parts congruent to k modulo m for $m \geq 2$ . We prove that $p_{1,0,m} (n)$ is
BYUNGCHAN KIM, EUNMI KIM
openaire +1 more source
The complexity of Euler’s integer partition theorem [PDF]
Theoretical Computer Science, 2012 Euler’s integer partition theorem, which states that the number of partitions of an integer into odd integers is equal to the number of partitions into distinct integers, ranks 16 in Wells’ list of the most beautiful theorems (Wells, 1990) [15].
Elena Calude, Cristian Sorin Calude
exaly +2 more sources
On Product Partitions of Integers
Canadian Mathematical Bulletin, 1991AbstractLet p*(n) denote the number of product partitions, that is, the number of ways of expressing a natural number n > 1 as the product of positive integers ≥ 2, the order of the factors in the product being irrelevant, with p*(1) = 1. For any integer if d is an ith power, and = 1, otherwise, and let . Using a suitable generating function for p*(
Harris, V. C., Subbarao, M. V.
openaire +1 more source
Constrained Integer Partitions
2004We consider the problem of partitioning n integers into two subsets of given cardinalities such that the discrepancy, the absolute value of the difference of their sums, is minimized. The integers are i.i.d. random variables chosen uniformly from the set {1,...,M}. We study how the typical behavior of the optimal partition depends on n,M and the bias s,
Christian Borgs +3 more
openaire +1 more source
The “best” partition of an integer
BIT, 1974An algorithm, based on a conjecture, to compute a permutation whose repeated application to a given set will yield a maximum number of different orderings of that set is presented. The algorithm gives the lengths of the cycles required. This problem turns out to be equivalent to the problem of determining a partitionB(n) ofn for which the least common ...
openaire +2 more sources