- # TODO: Un-hard-code this. It should be possible to get the "next"
- # name based on the parent's generator names.
- names = 'f'
- names = normalize_names(W.dimension(), names)
+ # Figure out a non-conflicting set of names to use.
+ valid_names = ['f','g','h','a','b','c','d']
+ name_idx = 0
+ names = normalize_names(W.dimension(), valid_names[0])
+ # This loops so long as the list of collisions is nonempty.
+ # Just crash if we run out of names without finding a set that
+ # don't conflict with the parent algebra.
+ while [y for y in names if y in superalgebra.variable_names()]:
+ name_idx += 1
+ names = normalize_names(W.dimension(), valid_names[name_idx])