To appear in Volume 19 of DMTCS.Recent research on the combinatorics of finite sets has explored the structure of symmetric difference-closed sets, and recent research in combinatorial group theory has concerned the enumeration of commuting involutions in $S_{n}$ and $A_{n}$. In this article, we consider an interesting combination of these two subjects, by introducing classes of symmetric difference-closed sets of elements which correspond in a natural way to commuting involutions in $S_{n}$ and $A_{n}$. We consider the natural combinatorial problem of enumerating symmetric difference-closed sets consisting of subsets of sets consisting of pairwise disjoint $2$-subsets of $[n]$, and the problem of enumerating symmetric difference-closed set...
A permutomino of size n is a polyomino determined by particular pairs $(\pi_1, \pi_2)$ of permutatio...
Difference sets belong both to group theory and to combinatorics. Studying them requires tools from ...
We characterize those symmetric designs with a Singer group G which admit a quasi-regular G-invarian...
To appear in Volume 19 of DMTCS.International audienceRecent research on the combinatorics of finite...
A collection of sets is symmetric-difference-free, respectively symmetric difference-closed, if the ...
We investigate different types of permutation containment, principally by involutions. We give an ex...
A permutomino of size n is a polyomino determined by particular pairs of permutations of length n. I...
For a positive integer $n$, a collection $S$ of subsets of $[n]=\{1,\ldots,n\}$ is called symmetric ...
An element of a Coxeter group W is fully commutative if any two of its reduced decompositions are re...
AbstractLet Ak be the set of permutations in the symmetric group Sk with prefix 12. This paper conce...
AbstractThe correspondence between a (96,20,4) symmetric design having regular automorphism group an...
All non-abelian finite simple groups can be symmetrically generated by involutions. An algorithm whi...
CombinatoricsLet (w_n)0 < n be the sequence known as Integer Sequence A047749 In this paper, we show...
AbstractIn a recent paper, Brenti shows that enumerating a conjugacy class of Sn with respect to exc...
This monograph provides a self-contained introduction to symmetric functions and their use in enumer...
A permutomino of size n is a polyomino determined by particular pairs $(\pi_1, \pi_2)$ of permutatio...
Difference sets belong both to group theory and to combinatorics. Studying them requires tools from ...
We characterize those symmetric designs with a Singer group G which admit a quasi-regular G-invarian...
To appear in Volume 19 of DMTCS.International audienceRecent research on the combinatorics of finite...
A collection of sets is symmetric-difference-free, respectively symmetric difference-closed, if the ...
We investigate different types of permutation containment, principally by involutions. We give an ex...
A permutomino of size n is a polyomino determined by particular pairs of permutations of length n. I...
For a positive integer $n$, a collection $S$ of subsets of $[n]=\{1,\ldots,n\}$ is called symmetric ...
An element of a Coxeter group W is fully commutative if any two of its reduced decompositions are re...
AbstractLet Ak be the set of permutations in the symmetric group Sk with prefix 12. This paper conce...
AbstractThe correspondence between a (96,20,4) symmetric design having regular automorphism group an...
All non-abelian finite simple groups can be symmetrically generated by involutions. An algorithm whi...
CombinatoricsLet (w_n)0 < n be the sequence known as Integer Sequence A047749 In this paper, we show...
AbstractIn a recent paper, Brenti shows that enumerating a conjugacy class of Sn with respect to exc...
This monograph provides a self-contained introduction to symmetric functions and their use in enumer...
A permutomino of size n is a polyomino determined by particular pairs $(\pi_1, \pi_2)$ of permutatio...
Difference sets belong both to group theory and to combinatorics. Studying them requires tools from ...
We characterize those symmetric designs with a Singer group G which admit a quasi-regular G-invarian...