Results 21 to 30 of about 361,091 (296)
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 An equitable partition into branchings in a digraph is a partition of the arc set into branchings such that the sizes of any two branchings differ at most by one.
Kenjiro Takazawa
doaj +1 more source
On the Minimum Common Integer Partition Problem [PDF]
, 2006 We introduce a new combinatorial optimization problem in this paper, called the Minimum Common Integer Partition (MCIP) problem, which was inspired by computational biology applications including ortholog assignment and DNA fingerprint assembly.
Liu, Z +7 more
core +1 more source
An Integer Programming Formulation of the Minimum Common String Partition Problem. [PDF]
PLoS ONE, 2015 We consider the problem of finding a minimum common string partition (MCSP) of two strings, which is an NP-hard problem. The MCSP problem is closely related to genome comparison and rearrangement, an important field in Computational Biology.
S M Ferdous, M Sohel Rahman
doaj +1 more source
On additive partitions of integers
Discrete Mathematics, 1978 Let \(U=\{u_n\}\), \(u_{n+2}=u_{n+1}+u_n\), \(n\geq 1\), \(u_1=1\), \(u_2> u_1\), be a linear recurrence sequence. It is shown that the set of positive integers can be partitioned uniquely into two disjoint subsets such that the sum of any two distinct numbers from any one set can never be in \(U\).
Krishnaswami Alladi +2 more
openaire +2 more sources
European Journal of Combinatorics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konrad Engel +2 more
openaire +2 more sources
Efficient partition of integer optimization problems with one-hot encoding
Scientific Reports, 2019 Quantum annealing is a heuristic algorithm for solving combinatorial optimization problems, and hardware for implementing this algorithm has been developed by D-Wave Systems Inc.
Shuntaro Okada +2 more
doaj +1 more source
Recursive formulae for the multiplicative partition function
International Journal of Mathematics and Mathematical Sciences, 1999 For a positive integer n, let f(n) be the number of essentially different ways of writing n as a product of factors greater than 1, where two factorizations of a positive integer are said to be essentially the same if they differ only in the order of the
Jun Kyo Kim, Sang Guen Hahn
doaj +1 more source
Communal Partitions of Integers
Integers, 2012 Abstract.There is a well-known formula due to Andrews that counts the number of incongruent triangles with integer sides and a fixed perimeter.
openaire +3 more sources
Composite Fermions and Integer Partitions
Journal of Combinatorial Theory, Series A, 2001 The authors prove the unimodality of integer partitions with at most \(a\) parts, all parts less than or equal to \(b\), that are required to contain either repeated or consecutive parts. The proof uses the KOH theorem [\textit{D. Zeilberger}, Am. Math. Mon. 96, No. 7, 590-602 (1989; Zbl 0726.05005)].
Arthur T. Benjamin +3 more
openaire +2 more sources
On the Distribution of the spt-Crank
Mathematics, 2013 Andrews, Garvan and Liang introduced the spt-crank for vector partitions. We conjecture that for any n the sequence {NS (m, n)}m is unimodal, where NS (m, n) is the number of S-partitions of size n with crank m weight by the spt-crank.
Robert C. Rhoades +2 more
doaj +1 more source