Tesi sul tema "Espèce combinatoire"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-38 saggi (tesi di laurea o di dottorato) per l'attività di ricerca sul tema "Espèce combinatoire".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi le tesi di molte aree scientifiche e compila una bibliografia corretta.
Ayadi, Mohamed. "Propriétés algébriques et combinatoires des espaces topologiques finis". Electronic Thesis or Diss., Université Clermont Auvergne (2021-...), 2022. http://www.theses.fr/2022UCFAC106.
Testo completoImbert, Michel. "Combinatoire des revêtements : cellulation des espaces de Hurwitz". Université Joseph Fourier (Grenoble), 1998. http://www.theses.fr/1998GRE10228.
Testo completoVidal, Samuel. "Groupe modulaire et cartes combinatoires : génération et comptage". Thesis, Lille 1, 2010. http://www.theses.fr/2010LIL10180/document.
Testo completoThis thesis is about combinatoric and algorithmic aspects of maps. Using the species theory of Joyal, we get enumerative results concerning labeled and unlabeled maps both rooted or not, of any genus, by the number of their edges and faces. We relate the combinatorics of maps to the asymptotics of the Airy function by a unexpected matching of the generating series of triangular maps and the asymptotic development of the Airy function.We also give an algorithm able to produce an exhaustive list of triangular maps, in constant amortized time in the rooted case
Rogalski-Muret, Janine. "Acquisition de la bidimensionalité (combinatoire, espace, mesure) chez les élèves d’âge scolaire et préscolaire". Paris 7, 1985. http://www.theses.fr/1985PA077079.
Testo completoGimenez, Pierre-François. "Apprentissage de préférences en espace combinatoire et application à la recommandation en configuration interactive". Thesis, Toulouse 3, 2018. http://www.theses.fr/2018TOU30182/document.
Testo completoThe analysis and the exploitation of preferences occur in multiple domains, such as economics, humanities and psychology. E-commerce got interested in the subject a few years ago with the surge of product personalisation. Our study deals with the representation and the learning of preferences on objects described by a set of attributes. These combinatorial spaces are huge, which makes the representation of an ordering in extenso intractable. That's why preference representation languages have been built: they can represent preferences compactly on these huge spaces. In this dissertation, we study preference representation languages and preference learning.Our work focuses on two approaches. Our first approach led us to propose the DRC algorithm for inference in Bayesian networks. While other inference algorithms use the sole Bayesian network as a source of information, DRC makes use of the fact that Bayesian networks are often learnt from a set of examples either chosen or observed. Such examples are a valuable source of information that can be used during the inference. Based on this observation, DRC uses not only the Bayesian network structure that captures the conditional independences between attributes, but also the set of examples, by estimating the probabilities directly from it. DRC is particularly adapted to problems with a dynamic probability distribution but static conditional independences. Our second approach focuses on the learning of k-LP-trees from sold items examples. We formally define the problem and introduce a score and a distance adapted to it. Our theoretical results include a learning algorithm of k-LP-trees with a convergence property, a linear LP-tree algorithm minimising the score we defined and a sample complexity result: a number of examples logarithmic in the number of attributes is enough to learn a "good" linear LP-tree. We finally present an experimental contribution that evaluates different languages whose models are learnt from a car sales history. The models learnt are used to recommend values in interactive configuration of Renault cars. The interactive configuration is a process in which the user chooses a value, one attribute at a time. The recommendation precision (the proportion of recommendations that would have been accepted by the user) and the recommendation time are measured. Besides, the parameters that influence the recommendation quality are investigated. Our results are promising: these methods, described either in the literature or in our contributions, are fast enough for an on-line use and their success rate is high, even close to the theoretical maximum
Clais, Antoine. "Immeubles à angles droits et modules combinatoires au bord". Thesis, Lille 1, 2014. http://www.theses.fr/2014LIL10143/document.
Testo completoThe object of this thesis is to study the geometry of right-angled buildings. These spaces, defined by J. Tits, are singular spaces that can be seen as trees of higher dimension. The thesis is divided in two parts. In the first part, we describe how the notion of parallel residues allows to understand the action of a group on the building. As a corollary we recover that in Coxeter groups and in graph products intersections of parabolic subgroups are parabolic. In the second part, we discuss the quasiconformal structure of boundaries of right-angled hyperbolic buildings thanks to combinatorial tools. In particular, we exhibit some examples of buildings of dimension 3 and 4 whose boundary satisfy the combinatorial Loewner property. This property is a weak version of the Loewner property. This part is motivated by the fact that the quasiconformal structure of the boundary led to many results of rigidity in hyperbolic spaces since G.D. Mostow. In the case of buildings of dimension 2, many works have been done by M. Bourdon and H. Pajot. In particular, the Loewner property on the boundary permitted them to prove the quasi-isometry rigidity for some buildings of dimension 2
LIRA, DE LIMA ARILEIDE. "Groupes speciaux : aspects algebriques et combinatoires de la theorie des espaces d'ordres abstraits". Paris 7, 1996. http://www.theses.fr/1996PA077090.
Testo completoPoinsot, Laurent. "Contributions à l'Algèbre, à l'Analyse et à la Combinatoire des Endomorphismes sur les Espaces de Séries". Habilitation à diriger des recherches, Université Paris-Nord - Paris XIII, 2011. http://tel.archives-ouvertes.fr/tel-00639676.
Testo completoGras, Robin. "Structure des espaces de recherche, complexité des algorithmes d'optimisation combinatoire stochastique et applications à la bioinformatque". [S.l.] : [s.n.], 2004. http://www.irisa.fr/centredoc/publis/HDR/2004/irisapublication.2005-08-03.0926359967.
Testo completoHamez, Alexandre. "Génération efficace de grands espaces d'états". Paris 6, 2009. http://www.theses.fr/2009PA066648.
Testo completoLemoine, Julien. "Méthodes algorithmiques pour la résolution des jeux combinatoires". Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2011. http://tel.archives-ouvertes.fr/tel-00839385.
Testo completoDelcroix-Oger, Bérénice. "Hyperarbres et Partitions semi-pointées : aspects combinatoires, algébriques et homologiques". Thesis, Lyon 1, 2014. http://www.theses.fr/2014LYO10243/document.
Testo completoThis thesis is dedicated to the combinatorial, algebraic and homological study of hypertrees and semi-pointed partitions. More precisely, we study algebraic and homological structures built from hypertrees and semi-pointed partitions. After recalling briefly the notions needed, we use the theory of species of structures to compute the action of the symmetric group on the homology of the hypertree posets. This action is the same as the action of the symmetric group linked with the anticyclic structure of the PreLie operad. We refine our computations on a grading of the homology : Whitney homology. This study is a motivation for the introduction of the notion of edge-decorated hypertrees. A one-to-one correspondence of decorated hypertrees with box trees and decorated partitions enables us to compute a close formula for the cardinality of decorated hypertrees, thanks to a Prüfer code. Moreover, we adapt computation methods of characters on incidence Hopf algebras, introduced by W. Schmitt for families of bounded posets, to families of unbounded posets satisfying some additional properties, called triangle and diamond posets. We apply these results to the hypertree posets. Finally, we unveil a new family of posets : the semi-pointed partition posets, which generalize both partition posets and pointed partition posets. We show the Cohen-Macaulayness of these posets and obtain, thanks to species theory, a closed formula for the dimension of its unique homology group, which extend the ones established for partition posets and pointed partition posets
Delecroix, Vincent. "Combinatoire et dynamique du flot de Teichmüller". Phd thesis, Université de la Méditerranée - Aix-Marseille II, 2011. http://tel.archives-ouvertes.fr/tel-00653165.
Testo completoTourtchine, Victor. "Sur les questions combinatoires de la théorie spectrale des nœuds". Paris 7, 2002. http://www.theses.fr/2002PA077187.
Testo completoAlbert, Julien. "Propriétés combinatoires et arithmétiques de certaines suites automatiques et substitutives". Phd thesis, Université Paris Sud - Paris XI, 2006. http://tel.archives-ouvertes.fr/tel-00820430.
Testo completoWeinberg, Benjamin. "Analyse et résolution approchée de problèmes d'optimisation combinatoire : application au problème de coloration de graphe". Lille 1, 2004. https://pepite-depot.univ-lille.fr/LIBRE/Th_Num/2004/50376-2004-Weinberg.pdf.
Testo completoWeinberg, Benjamin Talbi El-Ghazali. "Analyse et résolution approchée de problèmes d'optimisation combinatoire application au problème de coloration de graphe /". Villeneuve d'Ascq : Université des sciences et technologies de Lille, 2007. https://iris.univ-lille1.fr/dspace/handle/1908/973.
Testo completoN° d'ordre (Lille 1) : 3467. Résumé en français et en anglais. Titre provenant de la page de titre du document numérisé. Bibliogr. 9 p.
Dubbeld, Sabrina. "La forme comme idée, la sculpture comme combinatoire : la mythologie individuelle d’Etienne-Martin (1913-1995) : Abécédaire et Demeures". Thesis, Paris 10, 2016. http://www.theses.fr/2016PA100139.
Testo completoEtienne-Martin's production remains relatively unknown to this day. The several studies and publications dedicated to it have not been sufficient for the sculptor to be given the place he deserves in Art History, and the understanding of his work still is evasive. This can be explained by three main causes: the nature and the function of the artist’s biography in relation to his sculptural, graphical and written work is hard to grasp; the Abécédaire, Etienne-Martin’s own conceptual system built in the 60s is still puzzling; and the roles of esoterism and spirituality in his work are still unclear. In an effort to address these issues, we will rely on the examination of his work, of his library as well as that of thousands of unpublished pages in which he tells the story of his childhood, of his creations and mostly of the Abécédaire. Through the use of secondary sources, this study will be put into perspective, both in a transversal and multidisciplinary way. It sheds light on the deeply synthetic language of the artist. Thanks to the expression of his own individual mythology, Etienne-Martin has succeeded in creating a work in which each sculpture is not simply a distinct entity. On the contrary, it finds its place inside a structure endowed with a combinatorial principle and able to forge new creations. Owing to its conceptual and formal characteristics, as well as to the questions it raises, this memorial work resonates deeply with the research of his contemporaries
Orantin, Nicolas. "Du développement topologique des modèles de matrices à la théorie des cordes topologiques : combinatoire de surfaces par la géométrie algébrique". Phd thesis, Université Pierre et Marie Curie - Paris VI, 2007. http://tel.archives-ouvertes.fr/tel-00173162.
Testo completoje montre que pour un choix particulier des paramètres, ces objets peuvent être rendus invariants modulaires et sont solutions des équations d'anomalie holomorphe de la théorie de Kodaira-Spencer donnant un nouvel élément vers la preuve de la conjecture de Dijkgraaf-Vafa.
Haïssinsky, Peter. "Dynamique conforme dans les espaces métriques". Habilitation à diriger des recherches, Université de Provence - Aix-Marseille I, 2009. http://tel.archives-ouvertes.fr/tel-00367259.
Testo completoViennot, Simon. "Programme modulaire pour la résolution des jeux combinatoires : application au Sprouts et au Cram". Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2011. http://tel.archives-ouvertes.fr/tel-00839388.
Testo completoBerger, Clemens. "Une version effective du théorème de Hurewicz". Phd thesis, Grenoble 1, 1991. http://tel.archives-ouvertes.fr/tel-00339314.
Testo completoBarazer, Simon. "Geometric recursion and volumes of moduli spaces : Oriented ribbon graphs, acyclic decomposion, “Cut-and-Join” operators". Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASM003.
Testo completoIn this thesis we study the relations between topological and geometric recursions and Masur Veech volumes of moduli spaces of quadratic and Abelian differentials. We chose to study ribbon graphs because they can be used to compute these volumes. In the case of trivalent ribbon graphs we give a geometric recursion formula that was also independently found in "On the Kontsevich geometry of the combinatorial Teichmüller space". We also study oriented ribbon graphs, in this case we found decomposition of graphs that we call "The acyclic decomposition''. This decomposition allow to decompose general oriented ribbon graphs into graphs with only one vertex. Using this we are able to compute volumes of their moduli spaces. We relate the acyclic decomposition to cut and joins operators. At the end of the memoir we study degenerations of ribbon graphs and show that volumes of moduli spaces of oriented ribbon graphs admit continuous extensions
Kraemer, Pierre. "Modèles topologiques pour la multirésolution". Université Louis Pasteur (Strasbourg) (1971-2008), 2008. https://publication-theses.unistra.fr/public/theses_doctorat/2008/KRAEMER_Pierre_2008.pdf.
Testo completoPetite, Samuel. "Laminations et pavages du demi-plan hyperbolique". Phd thesis, Université de Bourgogne, 2005. http://tel.archives-ouvertes.fr/tel-00011423.
Testo completoeuclidien $\R^2$ et du demi-plan hyperbolique \H. Un pavage de $\R^2$ ou de \H, code une action
d'un groupe d'isom{é}tries (soit le groupe des translations du plan, soit le groupe des
transformations affines) sur un espace m{é}trique compact $\Omega$ de sorte que les propri{é}t{é}s de
cette action sont reli{é}es avec les propri{é}t{é}s combinatoires du pavage. Les actions obtenues par
cette mani{è}re ont des comportements tr{è}s vari{é}s. Pour certains cas, comme par exemple pour le
pavage de Penrose, cette action est libre et minimale. Ceci donne {à} l'espace $\Omega$ une structure
de lamination particuli{è}re appell{é}e {\it sol{é}no{\"\i}de}. Localement, cet espace est le produit d'un
ensemble de Cantor par un ouvert du plan euclidien (resp. hyperbolique). Dans cette th{è}se, nous
{é}tudions principalement le comportement statistique des orbites de telles actions. Pour cela nous
caract{é}risons les mesures finies invariantes pour ces actions ainsi que les mesures harmoniques des
sol{é}no{\"\i}des associ{é}s. Il apparait des diff{é}rences fondamentales dans les techniques utilis{é}es entre
le cas euclidien et le cas hyperbolique. Nous donnons de plus, pour tout entier $r\geq 1$ des
exemples explicites de pavages du demi-plan hyperbolique dont le syst{è}me dynamique associ{é} est une
action libre et minimale poss{é}dant $r$ mesures finies invariantes et ergodiques.
De, mourgues Quentin. "A combinatorial approach to Rauzy-type dynamics". Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCD056/document.
Testo completoRauzy-type dynamics are group (or monoid) actions on a collection of combinatorial objects. The first and best known example concerns an action on permutations, associated to interval exchange transformations (IET) for the Poincaré map on compact orientable translation surfaces. The equivalence classes on the objects inducedby the group action are related to components of the moduli spaces of Abelian differentials with prescribed singularities, and, in two variants of the problem, have been classified by Kontsevich and Zorich, and by Boissy, through methods involving both combinatorics, algebraic geometry, topology and dynamical systems. In the first half of this thesis, we provide a purely combinatorial proof of both classification theorems. Our proof can be interpreted geometrically and the over archingidea is close to that of Kontsevich and Zorich, although the techniques arerather different. Not all Rauzy-type dynamics have a geometrical correspondence however, and some parts of this first proof do not seem to generalize well.In the second half of the thesis we develop a new method, that we call the labelling method. This second method is not completely disjoint from the first one, but it the new crucial ingredient of considering a sort of ‘monodromy’ for the dynamics, in away that we now sketch. Many statements in this thesis are proven by induction. It is conceivable to prove, by induction, a classification theorem for unlabelled objects. However, as the labelling method will show, it is easier to prove two statements in parallel within the same induction, the one on the unlabelled objects, and an apparently much harder one, on the monodromy of the labelled objects. Although the final result is stronger than the initial aim, by virtue of the stronger inductive hypothesis, the method may work more easily.This second approach extends to several other Rauzy-type dynamics. Our firststep is to apply the labelling method to derive a second proof of the classificationtheorem for the Rauzy dynamics. Then we apply it to the study of two other Rauzy-type dynamics (one of which is strictly related to the Rauzy dynamics on non-orientable surfaces), and finally we inventory a surprisingly high number of Rauzy-type dynamics for which the labelling
Pequignot, Yann. "Better-quasi-order : ideals and spaces". Sorbonne Paris Cité, 2015. http://www.theses.fr/2015USPCC270.
Testo completoThis thesis deals with combinatorics, order theory and descriptive set theory. The first contribution is to the theory of well-quasi-orders (wqo) and better-quasi-orders (bqo). The main result is the proof of a conjecture made by Maurice Pouzet in 1978 his thèse d'état which states that any wqo whose ideal completion remainder is bqo is actually bqo. Our proof relies on new results with both a combinatorial and a topological flavour concerning maps from a front into a compact metric space. The second contribution is of a more applied nature and deals with topological spaces. We define a quasi-order on the subsets of every second countable To topological space in a way that generalises the Wadge quasi-order on the Baire space, while extending its nice properties to virtually all these topological spaces. The Wadge quasi-order of reducibility by continuous functions is wqo on Borel subsets of the Baire space, this quasi-order is however far less satisfactory for other important topological spaces such as the real line, as Hertling, Ikegami and Schlicht notably observed. Some authors have therefore studied reducibility with respect to some classes of discontinuous functions to remedy this situation. We propose instead to keep continuity but to weaken the notion of function to that of relation. Using the notion of admissible representation studied in Type-2 theory of effectivity, we define the quasi-order of reducibility by relatively continuous relations. We show that this quasi-order both refines the classical hierarchies of complexity and is wqo on the Borel subsets of virtually every second countable To space - including every (quasi-)Polish space
Rital, Soufiane. "Hypergraphe de Voisinage Spatiocolorimétrique. Application en traitement d'images : Détection decontours et du bruit". Phd thesis, Université de Bourgogne, 2004. http://tel.archives-ouvertes.fr/tel-00011832.
Testo completocette théorie et sur l'analyse de leur adéquation avec des problématiques de l'image et particulièrement la détection de contours et la suppression de bruit.
Dans un premier temps, nous étudions la représentation par hypergraphes de voisinage spatiocolorimétrique de l'image. Trois représentations sont présentées incorporant des propriétés globales, locales, des mesures de similarité et des mesures de dissimilarité.
Ensuite, on utilise les propriétés des hypergraphes engendrées par la représentation afin de définir des modèles structurels de bruit et de contour. Ceci nous permet ainsi de déduire des algorithmes de suppression de bruit et d'extraction de contours sur des images
à niveaux de gris et couleur. Les performances des approches proposées sont comparées aux solutions classiquement utilisées.
Enfin, la représentation par hypergraphe de voisinage
spatiocolorimétrique s'est avérée efficace pour
le traitement des images bas niveaux.
Zuber, Hugues. "Variétés caractéristiques et non formalité des fibres de Milnor". Phd thesis, Université de Nice Sophia-Antipolis, 2009. http://tel.archives-ouvertes.fr/tel-00440281.
Testo completoRouabhi, Miloud. "Analyse sémantico-cognitive de prépositions en vue d'un traitement automatique". Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUL032.
Testo completoThis study aims to unify in a single approach the descriptions given by cognitive semantics and associated representations, studied by formal semantics. Cognitive semantics consists to associate the meanings of the analyzed with schemes. Formal semantics consists in studying the modes of representation of these schemes and the relations to the observables. Our study is based on the general model developed at the Paris-Sorbonne University in the LaLIC group, using the GAC model (Applicative and Cognitive Grammar) and GRACE (GRammar Applicative Cognitive and Enunciative), these two models use the one hand to the topology and on the other hand to the combinatory logic in order to an automatic processing of meanings. We have chosen to study the problem of the three prepositions: dans, sous and à of French and their equivalences in Arabic, this leads us to search for invariants associated with these three prepositions or relators, the preposition dans refers to the interiority of a place, be it spatial, temporal, spatial-temporal, notional or activity and the preposition sous refers to a specific place or generated by another place whose closing is taken. The preposition à refers to the closing of a place, here the place is cognitive or abstract place, sufficiently general that according to the context can take more particular values
Gamot, Juliette. "Algorithms for Conditional Search Space Optimal Layout Problems". Electronic Thesis or Diss., Université de Lille (2022-....), 2023. http://www.theses.fr/2023ULILB042.
Testo completoThis thesis falls within the scope of layout optimization, which is an important stage in the design of complex multidisciplinary engineering systems such as aerospace vehicles. Optimal layout problems (OLPs) involve finding the best arrangement of a set of components within a single- or multi-container system or space to meet specific objectives (cost reduction, performance enhancement, etc.) while satisfying various constraints (geometrical, functional, etc.). Dealing with OLPs is challenging both in terms of their formulation and their efficient and effective resolution. Actually, OLPs are often highly constrained and involve many mixed decision variables (continuous, discrete/categorial) which may be fixed or conditional. Conditional variables are highly useful to define different design choices when the set of components to be arranged is variable and dynamic. Consequently, their resolution requires the use of advanced optimization algorithms combining different classes of (mixed-variable) methods including metaheuristics and Bayesian optimization.The overall objective of the thesis is to investigate OLPs, their formulation in different contexts, their resolution using various optimization methods and their hybridization, and their validation within the framework of aerospace vehicle design. The contributions of the thesis are organized in two parts corresponding to two types of OLPs. In the first (resp. second) part, the set of components to be arranged is fixed (variable or conditional) involving fixed search space OLPs or FSS-OLPs (resp. conditional search space OLPs or CSS-OLPs). In both cases, the system/space in which the components are arranged is considered single- or multi-container.In the first part, a survey of constrained mixed-variable FSS-OLPs is proposed including their generic formulations, applications and resolution methods with a particular focus on quasi-physical methods and population-based metaheuristics. Based on a virtual force system (VF) quasi-physical algorithms emulate the principle of physical laws in system dynamics and deal efficiently with highly constrained problems. A variant (namely CSO-VF) of these algorithms is devised for solving single-container FSS-OLPs. In CSO-VF, the positions and orientations of the components are evolved using VF. To deal with multi-container systems, CSO-VF is combined with a Genetic Algorithm (GA) in a two-stage algorithm that assigns the components to the containers and optimizes their layout. These single- and multi-container algorithms are assessed considering satellite module FSS-OLPs that are representative benchmarks.In the second part, a survey of constrained mixed-variable CSS-OLPs is proposed in the same way than in the first part. Conditional variables involve more complex OLPs. Actually, for instance, in the context of aerospace concept design, a given amount of fuel could be included in a container in either one large tank or two smaller ones. Therefore, as the number of components to position is not the same in both cases the number of design variables as well as constraint functions vary during the optimization process. To deal with single-container CSS-OLPs, two approaches have been investigated: the first one is a GA revisited considering hidden variables, leading to variable-geometry OLPs (in objective and constraint functions). The second approach is a two-stage surrogate guided-CSO-VF algorithm combining Bayesian Optimization with CSO-VF. Bayesian Optimization selects the components with are considered by CSO-VF for layout optimization. This latter approach has been extended with a GA in a three-stage algorithm to tackle multi-container CSS-OLPs. Finally, all the algorithms are evaluated and compared based on their application to CSS variants of satellite module OLPs
Disarlo, Valentina. "Combinatorial methods in Teichmüller theory". Doctoral thesis, Scuola Normale Superiore, 2013. http://hdl.handle.net/11384/85687.
Testo completoGerber, Thomas. "Matrices de décomposition des algèbres d'Ariki-Koike et isomorphismes de cristaux dans les espaces de Fock". Phd thesis, Université François Rabelais - Tours, 2014. http://tel.archives-ouvertes.fr/tel-01057480.
Testo completoDisarlo, Valentina. "Combinatorial methods in Teichmüller theory". Phd thesis, Université de Strasbourg, 2013. http://tel.archives-ouvertes.fr/tel-00875029.
Testo completoParshina, Olga. "Structures périodiques en mots morphiques et en colorations de graphes circulants infinis". Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1071/document.
Testo completoThe content of the thesis is comprised of two parts: one deals with combinatorial properties of infinite words and the other with graph coloring problems.The first main part of the manuscript concerns regular structures in infinite aperiodic words, such as arithmetic subsequences and complete first returns.We study the function that outputs the maximal length of a monochromatic arithmetic subsequence (an arithmetic progression) as a function of the common difference d for a family of uniform morphic words, which includes the Thue-Morse word. We obtain the explicit upper bound on the rate of growth of the function and locations of arithmetic progressions of maximal lengths and difference d. To study periodic arithmetic subsequences in infinite words we define the notion of an arithmetic index and obtain upper and lower bounds on the rate of growth of the function of arithmetic index in the same family of words.Another topic in this direction involves the study of two new complexity functions of infinite words based on the notions of open and closed words. We derive explicit formulae for the open and closed complexity functions for an Arnoux-Rauzy word over an alphabet of finite cardinality.The second main part of the thesis deals with perfect colorings (a.k.a. equitable partitions) of infinite graphs of bounded degree. We study Caley graphs of infinite additive groups with a prescribed set of generators. We consider the case when the set of generators is composed of integers from the interval [-n,n], and the case when the generators are odd integers from [-2n-1,2n+1], where n is a positive integer. For both families of graphs, we obtain a complete characterization of perfect 2-colorings
Dufour, Guillaume. "Cubulations de variétés hyperboliques compactes". Phd thesis, Université Paris Sud - Paris XI, 2012. http://tel.archives-ouvertes.fr/tel-00690334.
Testo completoTremblay, Hugo. "Analyse des opérateurs différentiels combinatoires moléculaires et atomiques". Mémoire, 2012. http://www.archipel.uqam.ca/5101/1/M12621.pdf.
Testo completoPréville-Ratelle, Louis-François. "Combinatoire des espaces coinvariants trivariés du groupe symétrique". Thèse, 2012. http://www.archipel.uqam.ca/5360/1/D2403.pdf.
Testo completo