HAL (Le Centre pour la Communication Scientifique Directe), Aug 26, 2020
We present a structural approach of some results about jumps in the behavior of the profile (alia... more We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thiéry and the second author. A monomorphic decomposition of a relational structure R is a partition of its domain V (R) into a family of sets (V x) x∈X such that the restrictions of R to two finite subsets A and A ′ of V (R) are isomorphic provided that the traces A ∩ V x and A ′ ∩ V x have the same size for each x ∈ X. Let S µ be the class of relational structures of signature µ which do not have a finite monomorphic decomposition. We show that if a hereditary subclass D of S µ is made of ordered relational structures then it contains a finite subset A such that every member of D embeds some member of A. Furthermore, for each R ∈ A the profile of the age A(R) of R (made of finite substructures of R) is at least exponential. We deduce that if the profile of a hereditary class of finite ordered structures is not bounded by a polynomial then it is at least exponential. This result is a part of classification obtained by Balogh, Bollobás and Morris (2006) for ordered graphs.
Let C be a class of finite combinatorial structures. The profile of C is the function ϕ C which c... more Let C be a class of finite combinatorial structures. The profile of C is the function ϕ C which counts, for every integer n, the number ϕ C (n) of members of C defined on n elements, isomorphic structures been identified. The generating function of C is H C (x) := n 0 ϕ C (n)x n. Many results about the behavior of the function ϕ C have been obtained. Albert and Atkinson have shown that the generating series of several classes of permutations are algebraic. In this paper, we show how their results extend to classes of ordered binary relational structures; putting emphasis on the notion of hereditary well quasi order, we discuss some of their questions and answer one.
Balogh, Bollobás and Morris (2006) have described a threshold phenomenon in the behavior of the p... more Balogh, Bollobás and Morris (2006) have described a threshold phenomenon in the behavior of the profile of hereditary classes of ordered graphs. In this paper, we give an other look at their result based on the notion of monomorphic decomposition of a relational structure introduced in [32]. We prove that the class S of ordered binary structures which do not have a finite monomorphic decomposition has a finite basis (a subset A such that every member of S embeds some member of A). In the case of ordered reflexive directed graphs, the basis has 1242 members and the profile of their ages grows at least as the Fibonacci function. From this result, we deduce that the following dichotomy property holds for every hereditary class C of finite ordered binary structures of a given finite type. Either there is an integer ℓ such that every member of C has a monomorphic decomposition into at most ℓ blocks and in this case the profile of C is bounded by a polynomial of degree ℓ − 1 (and in fact is a polynomial), or C contains the age of a structure which does not have a finite monomorphic decomposition, in which case the profile of C is bounded below by the Fibonacci function.
We present a structural approach of some results about jumps in the behavior of the profile (alia... more We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thiéry and the second author. A monomorphic decomposition of a relational structure R is a partition of its domain V (R) into a family of sets (V x) x∈X such that the restrictions of R to two finite subsets A and A ′ of V (R) are isomorphic provided that the traces A ∩ V x and A ′ ∩ V x have the same size for each x ∈ X. Let S µ be the class of relational structures of signature µ which do not have a finite monomorphic decomposition. We show that if a hereditary subclass D of S µ is made of ordered relational structures then it contains a finite subset A such that every member of D embeds some member of A. Furthermore, for each R ∈ A the profile of the age A(R) of R (made of finite substructures of R) is at least exponential. We deduce that if the profile of a hereditary class of finite ordered structures is not bounded by a polynomial then it is at least exponential. This result is a part of classification obtained by Balogh, Bollobás and Morris (2006) for ordered graphs.
Reçu le ***** ; accepté après révision le +++++ Présenté par Résumé. Nous présentons une approche... more Reçu le ***** ; accepté après révision le +++++ Présenté par Résumé. Nous présentons une approche structurelle de résultats de sauts dans le comportement du profil de classes héréditaires de structures finies. Nous partons de la notion suivante dueà N.Thiéry et au second auteur. Une décomposition monomorphe d'une structure relationnelle R est une partition de son domaine V (R) en une famille de parties (Vx) x∈X telles que les restrictions de Rà deux parties finies A et A ′ de V (R) sont isomorphes pourvu que les traces A ∩ Vx et A ′ ∩ Vx aient même cardinalité pour tout x ∈ X. Soit Sµ la classe des structures relationnelles de signature µ qui n'ont pas de décomposition monomorphe finie. Nous montrons que si une sous classe héréditaire D de Sµ est formée de structures relationnelles ordonnées elle contient un ensemble fini A tel que toutélément de D abrite unélément de A. En outre, pour chaque R ∈ A, le profil de l'âge A(R) de R (consistant en les sous-structures finies de R) est au moins exponentiel. Il en résulte que, si le profil d'une classe héréditaire de structures ordonnées n'est pas borné par un polynôme, il est au moins exponentiel. Un résultat faisant partie d'une classification obtenue par Balogh, Bollobás et Morris en 2006 pour les graphes ordonnés.
Theory of relations is the framework of this thesis. It is about enumeration of finite structures... more Theory of relations is the framework of this thesis. It is about enumeration of finite structures. Let C be a class of finite combinatorial structures, the profile of C is the function ϕ C which count, for every n, the number of members of C defined on n elements, isomorphic structures been identified. The generating function for C is H C (X) := n≧0 ϕ C (n)X n. Many results about the behavior of the function ϕ C have been obtained. Albert and Atkinson have shown that the generating series of the profile of some classes of permutations are algebraic. This result fits in the frame of theory of relations, we show how its conclusion extends to classes of ordered binary structures using the notions of theory of relations. This is the subject of the first part of this thesis.
This paper is a contribution to the study of hereditary classes of finite graphs. We classify the... more This paper is a contribution to the study of hereditary classes of finite graphs. We classify these classes according to the number of prime structures they contain. We consider such classes that are minimal prime: classes that contain infinitely many primes but every proper hereditary subclass contains only finitely many primes. We give a complete description of such classes. In fact, each one of these classes is a well-quasi-ordered age and there are uncountably many of them. Eleven of these ages are almost multichainable; they remain well-quasi-ordered when labels in a well-quasi-ordering are added, hence have finitely many bounds. Five ages among them are exhaustible. Among the remaining ones, only countably many remain well-quasi-ordered when one label is added, and these have finitely many bounds (except for the age of the infinite path and its complement). The others have infinitely many bounds. Except for six examples, members of these ages we characterize are permutation graphs. In fact, every age which is not among the eleven ones is the age of a graph associated to a uniformly recurrent word on the integers. A description of minimal prime classes of posets and bichains is also provided. Our results support the conjecture that if a hereditary class of finite graphs does not remain well-quasi-ordered by adding labels in a well-quasi ordered set to these graphs, then it is not well-quasi-ordered if we add just two constants to each of these graphs Our description of minimal prime classes uses a description of minimal prime graphs [61] and previous work by Sobrani [65, 66] and the authors [45, 51] on properties of uniformly recurrent words and the associated graphs. The completeness of our description is based on classification results of Chudnovsky, Kim, Oum and Seymour [18] and Malliaris and Terry [42].
Theory of relations is the framework of this thesis. It is about enumeration of finite structures... more Theory of relations is the framework of this thesis. It is about enumeration of finite structures. Let C be a class of finite combinatorial structures, the profile of C is the function ϕ C which count, for every n, the number of members of C defined on n elements, isomorphic structures been identified. The generating function for C is H C (X) := n≧0 ϕ C (n)X n. Many results about the behavior of the function ϕ C have been obtained. Albert and Atkinson have shown that the generating series of the profile of some classes of permutations are algebraic. This result fits in the frame of theory of relations, we show how its conclusion extends to classes of ordered binary structures using the notions of theory of relations. This is the subject of the first part of this thesis.
Let C be a class of finite combinatorial structures. The profile of C is the function ϕ C which c... more Let C be a class of finite combinatorial structures. The profile of C is the function ϕ C which counts, for every integer n, the number ϕ C (n) of members of C defined on n elements, isomorphic structures been identified. The generating function of C is H C (x) := n 0 ϕ C (n)x n. Many results about the behavior of the function ϕ C have been obtained. Albert and Atkinson have shown that the generating series of several classes of permutations are algebraic. In this paper, we show how their results extend to classes of ordered binary relational structures; putting emphasis on the notion of hereditary well quasi order, we discuss some of their questions and answer one.
This paper is a contribution to the study of hereditary classes of finite graphs. We classify the... more This paper is a contribution to the study of hereditary classes of finite graphs. We classify these classes according to the number of prime structures they contain. We consider such classes that are minimal prime: classes that contain infinitely many primes but every proper hereditary subclass contains only finitely many primes. We give a complete characterization of such classes. In fact, each one of these classes is a well quasi ordered age and there are uncountably many of them. Eleven of these ages remain well quasi ordered when labels in a well quasi ordering are added. Among the remaining ones, countably many remain well quasi ordered when one label is added. Except for six examples, members of these ages we characterize are permutation graphs. In fact, every age which is not among the eleven ones is the age of a graph associated to a uniformly recurrent 0-1 word on the integers. A characterization of minimal prime classes of posets and bichains is also provided.
We present a structural approach of some results about jumps in the behavior of the profile (alia... more We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thiéry and the second author. A monomorphic decomposition of a relational structure R is a partition of its domain V (R) into a family of sets (Vx)x∈X such that the restrictions of R to two finite subsets A and A′ of V (R) are isomorphic provided that the traces A∩Vx and A′ ∩Vx have the same size for each x ∈ X . Let Sμ be the class of relational structures of signature μ which do not have a finite monomorphic decomposition. We show that if a hereditary subclass D of Sμ is made of ordered relational structures then it contains a finite subset A such that every member of D embeds some member of A. Furthermore, for each R ∈ A the profile of the age A(R) of R (made of finite substructures of R) is at least exponential. We deduce that if the profile of a hereditary class of finite ord...
Balogh, Bollobás and Morris (2006) have described a threshold phenomenon in the behavior of the p... more Balogh, Bollobás and Morris (2006) have described a threshold phenomenon in the behavior of the profile of hereditary classes of ordered graphs. In this paper, we give an other look at their result based on the notion of monomorphic decomposition of a relational structure introduced in [32]. We prove that the class S of ordered binary structures which do not have a finite monomorphic decomposition has a finite basis (a subset A such that every member of S embeds some member of A). In the case of ordered reflexive directed graphs, the basis has 1242 members and the profile of their ages grows at least as the Fibonacci function. From this result, we deduce that the following dichotomy property holds for every hereditary class C of finite ordered binary structures of a given finite type. Either there is an integer ℓ such that every member of C has a monomorphic decomposition into at most ℓ blocks and in this case the profile of C is bounded by a polynomial of degree ℓ − 1 (and in fact is a polynomial), or C contains the age of a structure which does not have a finite monomorphic decomposition, in which case the profile of C is bounded below by the Fibonacci function.
HAL (Le Centre pour la Communication Scientifique Directe), Aug 26, 2020
We present a structural approach of some results about jumps in the behavior of the profile (alia... more We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thiéry and the second author. A monomorphic decomposition of a relational structure R is a partition of its domain V (R) into a family of sets (V x) x∈X such that the restrictions of R to two finite subsets A and A ′ of V (R) are isomorphic provided that the traces A ∩ V x and A ′ ∩ V x have the same size for each x ∈ X. Let S µ be the class of relational structures of signature µ which do not have a finite monomorphic decomposition. We show that if a hereditary subclass D of S µ is made of ordered relational structures then it contains a finite subset A such that every member of D embeds some member of A. Furthermore, for each R ∈ A the profile of the age A(R) of R (made of finite substructures of R) is at least exponential. We deduce that if the profile of a hereditary class of finite ordered structures is not bounded by a polynomial then it is at least exponential. This result is a part of classification obtained by Balogh, Bollobás and Morris (2006) for ordered graphs.
Let C be a class of finite combinatorial structures. The profile of C is the function ϕ C which c... more Let C be a class of finite combinatorial structures. The profile of C is the function ϕ C which counts, for every integer n, the number ϕ C (n) of members of C defined on n elements, isomorphic structures been identified. The generating function of C is H C (x) := n 0 ϕ C (n)x n. Many results about the behavior of the function ϕ C have been obtained. Albert and Atkinson have shown that the generating series of several classes of permutations are algebraic. In this paper, we show how their results extend to classes of ordered binary relational structures; putting emphasis on the notion of hereditary well quasi order, we discuss some of their questions and answer one.
Balogh, Bollobás and Morris (2006) have described a threshold phenomenon in the behavior of the p... more Balogh, Bollobás and Morris (2006) have described a threshold phenomenon in the behavior of the profile of hereditary classes of ordered graphs. In this paper, we give an other look at their result based on the notion of monomorphic decomposition of a relational structure introduced in [32]. We prove that the class S of ordered binary structures which do not have a finite monomorphic decomposition has a finite basis (a subset A such that every member of S embeds some member of A). In the case of ordered reflexive directed graphs, the basis has 1242 members and the profile of their ages grows at least as the Fibonacci function. From this result, we deduce that the following dichotomy property holds for every hereditary class C of finite ordered binary structures of a given finite type. Either there is an integer ℓ such that every member of C has a monomorphic decomposition into at most ℓ blocks and in this case the profile of C is bounded by a polynomial of degree ℓ − 1 (and in fact is a polynomial), or C contains the age of a structure which does not have a finite monomorphic decomposition, in which case the profile of C is bounded below by the Fibonacci function.
We present a structural approach of some results about jumps in the behavior of the profile (alia... more We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thiéry and the second author. A monomorphic decomposition of a relational structure R is a partition of its domain V (R) into a family of sets (V x) x∈X such that the restrictions of R to two finite subsets A and A ′ of V (R) are isomorphic provided that the traces A ∩ V x and A ′ ∩ V x have the same size for each x ∈ X. Let S µ be the class of relational structures of signature µ which do not have a finite monomorphic decomposition. We show that if a hereditary subclass D of S µ is made of ordered relational structures then it contains a finite subset A such that every member of D embeds some member of A. Furthermore, for each R ∈ A the profile of the age A(R) of R (made of finite substructures of R) is at least exponential. We deduce that if the profile of a hereditary class of finite ordered structures is not bounded by a polynomial then it is at least exponential. This result is a part of classification obtained by Balogh, Bollobás and Morris (2006) for ordered graphs.
Reçu le ***** ; accepté après révision le +++++ Présenté par Résumé. Nous présentons une approche... more Reçu le ***** ; accepté après révision le +++++ Présenté par Résumé. Nous présentons une approche structurelle de résultats de sauts dans le comportement du profil de classes héréditaires de structures finies. Nous partons de la notion suivante dueà N.Thiéry et au second auteur. Une décomposition monomorphe d'une structure relationnelle R est une partition de son domaine V (R) en une famille de parties (Vx) x∈X telles que les restrictions de Rà deux parties finies A et A ′ de V (R) sont isomorphes pourvu que les traces A ∩ Vx et A ′ ∩ Vx aient même cardinalité pour tout x ∈ X. Soit Sµ la classe des structures relationnelles de signature µ qui n'ont pas de décomposition monomorphe finie. Nous montrons que si une sous classe héréditaire D de Sµ est formée de structures relationnelles ordonnées elle contient un ensemble fini A tel que toutélément de D abrite unélément de A. En outre, pour chaque R ∈ A, le profil de l'âge A(R) de R (consistant en les sous-structures finies de R) est au moins exponentiel. Il en résulte que, si le profil d'une classe héréditaire de structures ordonnées n'est pas borné par un polynôme, il est au moins exponentiel. Un résultat faisant partie d'une classification obtenue par Balogh, Bollobás et Morris en 2006 pour les graphes ordonnés.
Theory of relations is the framework of this thesis. It is about enumeration of finite structures... more Theory of relations is the framework of this thesis. It is about enumeration of finite structures. Let C be a class of finite combinatorial structures, the profile of C is the function ϕ C which count, for every n, the number of members of C defined on n elements, isomorphic structures been identified. The generating function for C is H C (X) := n≧0 ϕ C (n)X n. Many results about the behavior of the function ϕ C have been obtained. Albert and Atkinson have shown that the generating series of the profile of some classes of permutations are algebraic. This result fits in the frame of theory of relations, we show how its conclusion extends to classes of ordered binary structures using the notions of theory of relations. This is the subject of the first part of this thesis.
This paper is a contribution to the study of hereditary classes of finite graphs. We classify the... more This paper is a contribution to the study of hereditary classes of finite graphs. We classify these classes according to the number of prime structures they contain. We consider such classes that are minimal prime: classes that contain infinitely many primes but every proper hereditary subclass contains only finitely many primes. We give a complete description of such classes. In fact, each one of these classes is a well-quasi-ordered age and there are uncountably many of them. Eleven of these ages are almost multichainable; they remain well-quasi-ordered when labels in a well-quasi-ordering are added, hence have finitely many bounds. Five ages among them are exhaustible. Among the remaining ones, only countably many remain well-quasi-ordered when one label is added, and these have finitely many bounds (except for the age of the infinite path and its complement). The others have infinitely many bounds. Except for six examples, members of these ages we characterize are permutation graphs. In fact, every age which is not among the eleven ones is the age of a graph associated to a uniformly recurrent word on the integers. A description of minimal prime classes of posets and bichains is also provided. Our results support the conjecture that if a hereditary class of finite graphs does not remain well-quasi-ordered by adding labels in a well-quasi ordered set to these graphs, then it is not well-quasi-ordered if we add just two constants to each of these graphs Our description of minimal prime classes uses a description of minimal prime graphs [61] and previous work by Sobrani [65, 66] and the authors [45, 51] on properties of uniformly recurrent words and the associated graphs. The completeness of our description is based on classification results of Chudnovsky, Kim, Oum and Seymour [18] and Malliaris and Terry [42].
Theory of relations is the framework of this thesis. It is about enumeration of finite structures... more Theory of relations is the framework of this thesis. It is about enumeration of finite structures. Let C be a class of finite combinatorial structures, the profile of C is the function ϕ C which count, for every n, the number of members of C defined on n elements, isomorphic structures been identified. The generating function for C is H C (X) := n≧0 ϕ C (n)X n. Many results about the behavior of the function ϕ C have been obtained. Albert and Atkinson have shown that the generating series of the profile of some classes of permutations are algebraic. This result fits in the frame of theory of relations, we show how its conclusion extends to classes of ordered binary structures using the notions of theory of relations. This is the subject of the first part of this thesis.
Let C be a class of finite combinatorial structures. The profile of C is the function ϕ C which c... more Let C be a class of finite combinatorial structures. The profile of C is the function ϕ C which counts, for every integer n, the number ϕ C (n) of members of C defined on n elements, isomorphic structures been identified. The generating function of C is H C (x) := n 0 ϕ C (n)x n. Many results about the behavior of the function ϕ C have been obtained. Albert and Atkinson have shown that the generating series of several classes of permutations are algebraic. In this paper, we show how their results extend to classes of ordered binary relational structures; putting emphasis on the notion of hereditary well quasi order, we discuss some of their questions and answer one.
This paper is a contribution to the study of hereditary classes of finite graphs. We classify the... more This paper is a contribution to the study of hereditary classes of finite graphs. We classify these classes according to the number of prime structures they contain. We consider such classes that are minimal prime: classes that contain infinitely many primes but every proper hereditary subclass contains only finitely many primes. We give a complete characterization of such classes. In fact, each one of these classes is a well quasi ordered age and there are uncountably many of them. Eleven of these ages remain well quasi ordered when labels in a well quasi ordering are added. Among the remaining ones, countably many remain well quasi ordered when one label is added. Except for six examples, members of these ages we characterize are permutation graphs. In fact, every age which is not among the eleven ones is the age of a graph associated to a uniformly recurrent 0-1 word on the integers. A characterization of minimal prime classes of posets and bichains is also provided.
We present a structural approach of some results about jumps in the behavior of the profile (alia... more We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thiéry and the second author. A monomorphic decomposition of a relational structure R is a partition of its domain V (R) into a family of sets (Vx)x∈X such that the restrictions of R to two finite subsets A and A′ of V (R) are isomorphic provided that the traces A∩Vx and A′ ∩Vx have the same size for each x ∈ X . Let Sμ be the class of relational structures of signature μ which do not have a finite monomorphic decomposition. We show that if a hereditary subclass D of Sμ is made of ordered relational structures then it contains a finite subset A such that every member of D embeds some member of A. Furthermore, for each R ∈ A the profile of the age A(R) of R (made of finite substructures of R) is at least exponential. We deduce that if the profile of a hereditary class of finite ord...
Balogh, Bollobás and Morris (2006) have described a threshold phenomenon in the behavior of the p... more Balogh, Bollobás and Morris (2006) have described a threshold phenomenon in the behavior of the profile of hereditary classes of ordered graphs. In this paper, we give an other look at their result based on the notion of monomorphic decomposition of a relational structure introduced in [32]. We prove that the class S of ordered binary structures which do not have a finite monomorphic decomposition has a finite basis (a subset A such that every member of S embeds some member of A). In the case of ordered reflexive directed graphs, the basis has 1242 members and the profile of their ages grows at least as the Fibonacci function. From this result, we deduce that the following dichotomy property holds for every hereditary class C of finite ordered binary structures of a given finite type. Either there is an integer ℓ such that every member of C has a monomorphic decomposition into at most ℓ blocks and in this case the profile of C is bounded by a polynomial of degree ℓ − 1 (and in fact is a polynomial), or C contains the age of a structure which does not have a finite monomorphic decomposition, in which case the profile of C is bounded below by the Fibonacci function.
Uploads
Papers by Djamila oudrar