I would like to construct the set of ordered partitions of a positive
integer n subject to a condition like this:
- if the partition is (l_1, l_2, ...), then I want to specify a
variant of slope: I want to specify integers a and b, or lists of
integers (a_1, a_2, ...) and (b_1, b_2, ...) and then I want to
replace the slope condition
max_slope >= l_i - l_{i+1} >= min_slope
with
max_slope >= a_i * l_i - b_i * l_{i+1} >= min_slope
For example, I want to be able to produce the ordered partitions (l_1,
l_2, ..., l_k) of n, with length k, such that
2l_i >= l_{i+1}
for all i.
Can someone help me to alter IntegerListsLex (I think this is the
right class) so that it allows for this functionality? The code in
combinat/integer_list.py looks a little complicated, and I'm hoping
someone can provide a quick answer.
Thanks,
John
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this group, send email to sage-combinat-de...@googlegroups.com.
To unsubscribe from this group, send email to
sage-combinat-devel+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/sage-combinat-devel?hl=en.
