Introduction
In combinatorial mathematics, the study of structures and their classifications is a vibrant area that often employs the concept of combinatorial species. A combinatorial species [1-3] provides a framework for counting and analyzing different structures (like graphs, trees, or permutations) by focusing on their combinatorial properties rather than their specific representations. This approach facilitates the comparison and enumeration of various configurations through the use of generating series [4,5].
An essential tool in this field is the hyperoctrahedral group, which arises in the study of symmetries of higher-dimensional geometric objects. Specifically, the hyperoctahedral group describes the symmetries of an n -dimensional cube [6], capturing the essence of permutations and reflections of its vertices. This group plays a crucial role in combinatorial enumeration and can be linked to various combinatorial species through its action.
To systematically analyze these species, mathematicians use ordinary generating series and exponential generating series. Ordinary generating series are particularly useful for counting sequences of combinatorial structures, while exponential generating series are tailored for structures where order matters, such as labeled objects.
The study of combinatorial species and the hyperoctahedral group is vital in understanding symmetrical structures and their properties in various mathematical contexts. Combinatorial species provide a framework for counting and categorizing combinatorial objects based on their structural characteristics, allowing for a deeper insight into their relationships and transformations.
This article, section 2 gives the theoretical foundations of combinatorial species and the hyperoctrahedral group Bn as a wreath product. The section 3 is devoted to the enumeration techniques based on the hyperoctrahedral group Bn.
Theoretical foundations
Combinatorial species: We consider the category B whose objects are the finite sets whose morphisms are the bijections, and the category εns of the finite sets whose morphisms are the functions.
Definition 2.1 [7] A species of structures is a functor .
This means that to any finite set U, we associate a finite set noted F[U] whose elements are called the F-structures on U. To any bijection
, we associate a function
, which we call transport morphism along β from the F -structures on U to the F-structures of V. Moreover, we ask for the functoriality properties: For
, we have
and for
, the identity of U,
It follows that for any bijection β the transport morphism F[βM] is a bijection. Indeed, for
, we have
Similarly, we have
.
Isomorphisms of species and isomorphism of F-structures:
Definition 2.2 [8] The species F and G are said to be isomorphic (and we write
) if there exists a natural isomorphism ϑ between the functors F and G.
This means that to any finite set U, we associate a bijection
such that for any bijection
, we have
. The following diagram commutes
Definition 2.3 Two F-structures
on U and
on V are said to be isomorphic, if there exist
, bijection, such that
. We then write
. The relation (being isomorphic) is an equivalent relation on
, and we denote the set of equivalence classes (or isomorphy classes or types of F-structures on U by
Proposition 2.1 Let
and
be the groups of permutations of U and
respectively. Then the map defined by the following is a homomorphism of groups
h :
|
|
|
|
|
|
Proof 2.1 We have:
Remark 2.1 This amounts to saying that we have an action of
on
. We note, that for
we call the group of automorphisms of t. We will write
instead
.
Remark 2.2 For any species F, there exists a (called associated) species
defined by:
And for any bijection
:
|
|
|
|
|
|
Remark 2.3 When
, we say that t is an asymmetric (or rigid or flat) F-structure on U.
Definition 2.4 The flat part of a species F is the subspecies
defined by
where the transport morphisms along the bijections are obtained by restriction.
Remark 2.4 We have
where we identify
with
. In a certain sense F measures the asymmetry and
the symmetry of the F-structures.
Hyperoctahedral group: The symmetric group
can be considered as a matrix group where
-matrices are permutation matrices (only one 1 per row and column, 0elsewhere) [9,10].
Let
,
;
,
.
at the ith column. This practice generalizes for the hyperoctahedral group, Bn, with the difference that the 1 of each row and column can be replaced by −1 (matrices of signed permutations).
Take the following matrix as an example:
that can be noted
where
,
and f(i) denotes the non-zero element of the ith row of the matrix. We can generalize this notation by the following definition.
Definition 2.5 (Hyperoctahedral group as a wreath product)
Let G be a finite group, H a subgroup of
. Let’s pose:
is a group with the following composition
where
denotes
and
,
. The identity element is
where
,
. The inverse
.
Bn is isomorphic to
[3], when the notation is abused by replacing in the permutation matrix
by 1 and −1 respectively. In other words, we have:
.
The hyperoctrahedral group Bn has subgroups:
.
.
.
In general, if we have a finite group G and H a subgroup of
, the wreath product
is the right semi-direct product of Gn by H with the following operation:
In particular, it is easy to verify that
is the unit element of
and the inverse of
is
.
Given the coxeter group of type
;
is the wreath product of
with the symmetric group
. So the following sequence is exact and short.
Moreover, the section s verifies
Generating series of a species of structures on Bn
The radius of convergence: In mathematics, the radius of convergence refers to the interval within which a power series converges to a function. For a power series of the form
Where an are the coefficients and c is the center of the series, the radius of convergence R can be determined using the formula:
This means that the series converges for all x such that
and diverges for
. At the endpoints
, the behavior of the series must be checked individually.
Generating series on Bn:
Definition 3.1 The generating series of a species of structures F on Bn is the formal power series
where
the number of F-structures on a set of n elements (labelled structures). Note that this series is a hyperoctahedral exponential type in the indeterminate x in sense that
appears in the denominator of the term of degree n.
The series F(x) is also called the hyperoctahedral exponential generating series of the species F. The following notation is used to designate the coefficients of formal power series. For a hyperoctahedral ordinary formal power series
we set
For a formal power series of hyperoctahedral exponential type, we then have
Relationship between hyperoctahedral ordinary and hyperoctahedral exponential generating function:
Lemma 3.1 Let
, let
be its hyperoctahedral ordinary generating function and
its hyperoctahedral exponential generating function. Then F(x) has an infinite radius of convergence.
Proof 3.1 Let
be arbitrary. Let us show that for all
, the series
converges. By hypothesis, there exist
and
such that
for all n. We have for all
:
and so
Proposition 3.1 Let
be a sequence whose hyperoctahedral ordinary generating function in G(x) and whose hyperoctahedral exponential generating function is F(x). Let
the radius of convergence of
. Then, we have for all
:
and the integral converges uniformly on the disk
where
.
Proof 3.2 Fix
. We choose
such that
and we set
. By hypothesis, there exists
such that
for all
since the series
converges and therefore
Then we have for all integer
and for all
:
which is integrable over
. By the Dominated Convergence Theorem, we get:
since
for all n.
Finally, we also have
and then
which tends to 0 when
.
Conclusion
In conclusion, the study of the hyperoctahedral group and its applications in combinatorial species reveals profound connections between algebra and combinatorics. By enumerating structures through the lens of the hyperoctahedral group, we uncover rich combinatorial objects and relationships that enhance our understanding of symmetry and structure. This interplay not only provides a robust framework for classifying and counting various configurations but also opens avenues for further exploration in both mathematical theory and practical applications.