Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with combinatorics
Search options questions only
not deleted
user 38205
Questions on the use of Mathematica in combinatorics, including the Combinatorica add-on package.
8
votes
4
answers
551
views
Climbing/Descending the Integer Ladder
A fun combinatoric puzzle that's popped up in my work that I think would be cute to have a Mathematica solution to, if anyone wants to give it a go. It's basically a ladder climbing/descending problem …
- 47.1k
0
votes
0
answers
46
views
Climbing/Descending the Multidimensional Integer Ladder
This is basically a follow-up to Climbing/Descending the Integer Ladder, but in multiple dimensions. It's basically just an index counting problem, but combinatoric blow-up makes it interesting.
In th …
- 47.1k
8
votes
3
answers
427
views
Find k smallest sum n-tuples
Given a collection of sorted lists {l1, l2, ...} I need to find the smallest k index tuples taken from these lists by summed value, e.g. given:
{
{1, 2, 3},
{5, 6, 7},
{3, 4, 5}
}
If k were 3 I …
- 47.1k
3
votes
1
answer
75
views
Sequence reconstruction from ordered subsamples
Given a sequence (we'll assume of integers) like
seq = {1, 0, 0, 1, 2, 0, 1}
I can take a random permutation
perm = BlockRandom[
RandomChoice@Permutations[{1, 0, 0, 1, 2, 0, 1}]
]
{1, 0, 1, 2, 0, …
- 47.1k
2
votes
1
answer
113
views
Splitting balls over sized bins
This is strongly related to Splitting a set of integers over a set of bins, but a much simpler case.
If we have $N$ indistinguishable balls and $k$ arbitrarily large distinguishable bins, we know the …
- 47.1k
6
votes
1
answer
134
views
Splitting a set of integers over a set of bins
I have a problem that feels like it should be simple but I'm just drawing a blank on. I've got a set of integers, e.g.
ogSet = PadRight[IntegerPartitions[20][[400]], 15]
{6, 4, 3, 3, 2, 1, 1, 0, 0, 0 …
- 47.1k