This paper considers the problem of generating lex-leader symmetry-breaking formulas for per-mutation groups whose orbit constituents have bounded size. We prove that one can find an ordering of the permutation domain for which there is a polynomial size lex-leader formula. This generalizes the results of [Luks and Roy, 2004] which considered the problem for permu-tation groups with orbits of size 2. Our con-struction is based on writing a Boolean for-mula that captures the logic of Sims’s meth-ods ([Sims, 1971]) to test membership in per-mutation groups, a classic result in computa-tional group theory.
This work presents an approach to the Maximum Permutation Code Problem (MPCP) that exploits the orbi...
AbstractLet G be a permutation group on a set Ω such that G has no fixed points in Ω. If, for a give...
This work presents an approach to the Maximum Permutation Code Problem (MPCP) that exploits the orbi...
This paper consider the problem of generating symmetry-breaking formulas for permutation groups acti...
Abstract Symmetry-breaking formulas, introduced by Crawford, Ginsberg, Luks and Roy, are supplementa...
AbstractWe prove that the minimal base size for the permutation action of the sporadic simple Baby m...
AbstractGiven a permutation group G acting on a set X we consider the orbits of the induced group on...
International audienceWe consider integer linear programs whose solutions are binary matrices and wh...
Symmetry reduction techniques aim to combat the state-space explosion problem for model checking by ...
Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic orderi...
This talk is based on the paper by Xiaorui Sun and John Wilmes, "Structure and automorphisms of prim...
Abstract We address the long-standing conjecture that all permutations have polynomially bounded wor...
Abstract. We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maxi...
AbstractIf a sequence of transitive permutation groups G of degree n have orders which are not too l...
This talk is based on the paper by Xiaorui Sun and John Wilmes, "Structure and automorphisms of prim...
This work presents an approach to the Maximum Permutation Code Problem (MPCP) that exploits the orbi...
AbstractLet G be a permutation group on a set Ω such that G has no fixed points in Ω. If, for a give...
This work presents an approach to the Maximum Permutation Code Problem (MPCP) that exploits the orbi...
This paper consider the problem of generating symmetry-breaking formulas for permutation groups acti...
Abstract Symmetry-breaking formulas, introduced by Crawford, Ginsberg, Luks and Roy, are supplementa...
AbstractWe prove that the minimal base size for the permutation action of the sporadic simple Baby m...
AbstractGiven a permutation group G acting on a set X we consider the orbits of the induced group on...
International audienceWe consider integer linear programs whose solutions are binary matrices and wh...
Symmetry reduction techniques aim to combat the state-space explosion problem for model checking by ...
Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic orderi...
This talk is based on the paper by Xiaorui Sun and John Wilmes, "Structure and automorphisms of prim...
Abstract We address the long-standing conjecture that all permutations have polynomially bounded wor...
Abstract. We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maxi...
AbstractIf a sequence of transitive permutation groups G of degree n have orders which are not too l...
This talk is based on the paper by Xiaorui Sun and John Wilmes, "Structure and automorphisms of prim...
This work presents an approach to the Maximum Permutation Code Problem (MPCP) that exploits the orbi...
AbstractLet G be a permutation group on a set Ω such that G has no fixed points in Ω. If, for a give...
This work presents an approach to the Maximum Permutation Code Problem (MPCP) that exploits the orbi...