Let fd(n), n > d ≥ 2, be the smallest positive integer such that any set of fd(n) points, in general position in Rd , contains n points in convex position. Let hd(n, k), n > d ≥ 2 and k ≥ 0, denote the smallest number with the property that in any set of hd(n, k) points, in general position in Rd , there are n points in convex position whose convex hull contains at most k other points. Previous result of Valtr states that h4(n, 0) does not exist for all n ≥ 249. We show that h4(n, 0) does not exist for all n ≥ 137. We show that h3(8, k) ≤ f3(8) for all k ≥ 26, h4(10, k) ≤ f4(10) for all k ≥ 147 and h5(12, k) ≤ f5(12) for all k ≥ 999. Next, let fd(k, n) be the smallest number such that in every set of fd(k, n) points, in general position in Rd , there are n points whose convex hull has at least k vertices. We show that, for arbitrary integers n ≥ k ≥ d + 1, d ≥ 2, fd(k, n) ≥ (n − 1) (k − 1)/(cd logd−2 (n − 1)) , where cd > 0 is a constant dependent only on the dimension d. 1

A caracterização de redes e o estudo de sistemas, ambos utilizando grafos, é algo muito usado por várias áreas científicas. Uma das linhas deste estudo é denominada de grafos aleatórios, que por sua vez auxilia na criação de modelos para análise de redes reais. Consideramos um modelo de grafo aleatório não homogêneo criado por Kang, Pachón e Rodríguez (2016), cuja construção é feita a partir da realização do grafo binomial G(n; p). Para este modelo, estudamos argumentos e métodos usados para encontrar resultados sobre o limiar de conectividade, importante propriedade relacionada a existência assintótica de vértices e componentes isolados. Em seguida, constatamos algumas características positivas e negativas a respeito da utilização do grafo para modelar redes reais complexas, onde usamos de simulações computacionais e medidas topológicas. / The characterization of networks and the study of systems, both using graphs, is very used by several scientific areas. One of the lines of this study is called random graphs, which in turn assists in creating models for the analysis of real networks. We consider an inhomogeneous random graph model created by Kang, Pachón e Rodríguez (2016), where its construction is made from the realization of the binomial graph G(n; p). For this model, we studied the arguments and methods used to find results on the connectivity threshold, important property related to asymptotic existence of vertices and isolated components. Then we found some positive and negative characteristics about the use of the graph to model complex real networks, using computer simulations and topological measures.

A caracterização de redes e o estudo de sistemas, ambos utilizando grafos, é algo muito usado por várias áreas científicas. Uma das linhas deste estudo é denominada de grafos aleatórios, que por sua vez auxilia na criação de modelos para análise de redes reais. Consideramos um modelo de grafo aleatório não homogêneo criado por Kang, Pachón e Rodríguez (2016), cuja construção é feita a partir da realização do grafo binomial G(n; p). Para este modelo, estudamos argumentos e métodos usados para encontrar resultados sobre o limiar de conectividade, importante propriedade relacionada a existência assintótica de vértices e componentes isolados. Em seguida, constatamos algumas características positivas e negativas a respeito da utilização do grafo para modelar redes reais complexas, onde usamos de simulações computacionais e medidas topológicas. / The characterization of networks and the study of systems, both using graphs, is very used by several scientific areas. One of the lines of this study is called random graphs, which in turn assists in creating models for the analysis of real networks. We consider an inhomogeneous random graph model created by Kang, Pachón e Rodríguez (2016), where its construction is made from the realization of the binomial graph G(n; p). For this model, we studied the arguments and methods used to find results on the connectivity threshold, important property related to asymptotic existence of vertices and isolated components. Then we found some positive and negative characteristics about the use of the graph to model complex real networks, using computer simulations and topological measures.

No description available.

Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-07-23T15:16:49Z No. of bitstreams: 1 JOSÉ EDER SALVADOR DE VASCONCELOS - DISSERTAÇÃO PPGMAT 2009..pdf: 634118 bytes, checksum: e65e70c702364b197a36f09e8d1ef296 (MD5) / Made available in DSpace on 2018-07-23T15:16:49Z (GMT). No. of bitstreams: 1 JOSÉ EDER SALVADOR DE VASCONCELOS - DISSERTAÇÃO PPGMAT 2009..pdf: 634118 bytes, checksum: e65e70c702364b197a36f09e8d1ef296 (MD5) Previous issue date: 2009-11 / Capes / O número de cocircuitos disjuntos em uma matróide é delimitado pelo seu posto. Existem, no entanto, matróides de posto arbitrariamente grande que não contêm dois cocircuitos disjuntos. Considere, por exemplo,M(Kn) eUn,2n. Além disso, a matróide bicircularB(Kn) pode ter posto arbitrariamente grande, mas não tem 3 cocircuitos disjuntos. Nós apresentaremos uma prova, obtida por Jim Geelen e Kasper Kabell em (5), para o seguinte fato: para cadak en, existe uma constantec tal que, seM é uma matróide com posto no mínimoc, entãoM temk cocircuitos disjuntos ou contém uma das seguintes matróides como menorUn,2n,M(Kn) ouB(Kn). / The number of disjoint cocircuits in a matroid is bounded by its rank. There are, however, matroids of rank arbitrarily large that do not contain two disjoint cocircuits. Consider, for example,M(kn) andUn,2n. Moreover, the bicircular matroidB(kn) may have arbitrarily large rank but do not have 3 disjoints cocircuits. We show a proof obtained by Jim Geelen and Kasper Kabell in (5) to the following fact: for everyk andn, there is a constantc such that ifM is a matroid with rank at leastc, thenM hask disjoint cocircuits orM contains one of the following matroids as a minorUn,2n, M(kn) orB(kn).

In the course of evolution, genomes diverge from their ancestors either via global mutations and by rearrangement of their chromosomal segments, or through local mutations within their genes. In this thesis (Chapters: 2, 3 and 4) we analyze the evolution of genomes based on different rearrangement operations including: in Chapter 2 both restricted and unrestricted double-cut-and-join (DCJ) operations, in Chapter 3 both internal and general reversal and translocation (IRT and HP, respectively) operations, and in Chapter 4 translocation, weighted reversal (WR) and maximum length reversal (MLR) operations. Based on the rearrangement operation chosen we can model the evolution of genomes as a discrete or continuous-time Markov chain process on the space of signed genomes. For each model of evolution, we study the stochastic process by investigating the time up to which the difference between the number of operations along the evolutionary trajectory and the edit distance of the genome from its ancestor is negligible, as soon as these two values starts diverging drastically from one another we say the process escapes from parsimony. One of the major parameters in the known edit distance formulas between any two genomes (such as reversal, DCJ, IRT, HP and translocation) is the number of cycles in their breakpoint graph. For DCJ, IRT and HP models by adopting the method elaborated by Berestycki and Durret, we estimate the number of cycles in the breakpoint graph of the genome at time t and its ancestor by the number of tree components of the random graph constructed from the model of evolution at time t, which is an Erdös-Rényi. We also proved that for each of the DCJ, IRT and HP models of evolution, the process on a genome of size n is bound to its parsimonious estimate up to t ≈ n/2 steps. Since the random graph constructed from the models of evolution for the translocation, WR and MLR processes are not Erdös-Rényi, the proofs of their parsimony- bound require more advanced mathematical tools, however our simulation shows for the translocation, two types of WR, and MLR (except for reversals with very short maximum length) models, the escape from parsimony do not occur before n/2 steps, where n is the number of genes in the genome. A basic result in this field is due to Berestycki and Durrett, from 2006, who found that a random transposition (pairwise exchange of the elements in the corresponding permutation of the genome) evolves along its parsimonious path of evolution up to n/2 steps, where n is the number of the genes. Although, this transposition model is applicable solely for evolution of a unichromosomal ancestor which remains unichromosomal at each step t of the process; however for the DCJ, IRT, HP and translocation models the genomes are multichromosomal which increases the difficulty of the problem at hand. The models studied in Chapters 2 - 4 are all based on signed permutation representations of genomes, where each "gene" occurs exactly once, with either positive or negative polarity. The same genes occur in all the genomes being considered. There is no distinction between the same gene in two different genomes. In Chapter 5 we generalize our representation to genes that may have several copies of a gene, which differ only by a few point mutations. This leads to problems of identifying copies in two genomes that are primary orthologs, under the assumptions of differentials in point mutation rate. We provide algorithms, software and test examples.

Em teoria dos números, o teorema de Erdös-Kac, também conhecido como o teorema fundamental de teoria probabilística dos números, diz que se w(n) denota a quantidade de fatores primos distintos de n, então a sequência de funções de distribuições N definidas por FN(x) = (1/N) #{n <= N : (w(n) log log N)/(log log N)^(1/2)} <= x}, converge uniformemente sobre R para a distribuição normal padrão. Neste trabalho desenvolvemos todos os teoremas necessários para uma demonstração analítica, que nos permitirá encontrar a ordem de erro da convergência acima. / In number theory, the Erdös-Kac theorem, also known as the fundamental theorem of probabilistic number theory, states that if w(n) is the number of distinct prime factors of n, then the sequence of distribution functions N, defined by FN(x) = (1/N) #{n <= N : (w(n) log log N)/(log log N)^(1/2)} <= x}, converges uniformly on R to the standard normal distribution. In this work we developed all theorems needed to an analytic demonstration, which will allow us to find an order of error of the above convergence.

Em teoria dos números, o teorema de Erdös-Kac, também conhecido como o teorema fundamental de teoria probabilística dos números, diz que se w(n) denota a quantidade de fatores primos distintos de n, então a sequência de funções de distribuições N definidas por FN(x) = (1/N) #{n <= N : (w(n) log log N)/(log log N)^(1/2)} <= x}, converge uniformemente sobre R para a distribuição normal padrão. Neste trabalho desenvolvemos todos os teoremas necessários para uma demonstração analítica, que nos permitirá encontrar a ordem de erro da convergência acima. / In number theory, the Erdös-Kac theorem, also known as the fundamental theorem of probabilistic number theory, states that if w(n) is the number of distinct prime factors of n, then the sequence of distribution functions N, defined by FN(x) = (1/N) #{n <= N : (w(n) log log N)/(log log N)^(1/2)} <= x}, converges uniformly on R to the standard normal distribution. In this work we developed all theorems needed to an analytic demonstration, which will allow us to find an order of error of the above convergence.

Le thème central à cette thèse est l'étude des propriétés des classes de graphes définies par sous-structures interdites et leurs applications.La première direction que nous suivons a trait aux beaux ordres. À l'aide de théorèmes de décomposition dans les classes de graphes interdisant une sous-structure, nous identifions celles qui sont bellement-ordonnées. Les ordres et sous-structures considérés sont ceux associés aux notions de contraction et mineur induit. Ensuite, toujours en considérant des classes de graphes définies par sous-structures interdites, nous obtenons des bornes sur des invariants comme le degré, la largeur arborescente, la tree-cut width et un nouvel invariant généralisant la maille.La troisième direction est l'étude des relations entre les invariants combinatoires liés aux problèmes de packing et de couverture de graphes. Dans cette direction, nous établissons de nouvelles relations entre ces invariants pour certaines classes de graphes. Nous présentons également des applications algorithmiques de ces résultats. / The central theme of this thesis is the study of the properties of the classes of graphs defined by forbidden substructures and their applications.The first direction that we follow concerns well-quasi-orders. Using decomposition theorems on graph classes forbidding one substructure, we identify those that are well-quasi-ordered. The orders and substructures that we consider are those related to the notions of contraction and induced minor.Then, still considering classes of graphs defined by forbidden substructures, we obtain bounds on invariants such as degree, treewidth, tree-cut width, and a new invariant generalizing the girth.The third direction is the study of the links between the combinatorial invariants related to problems of packing and covering of graphs. In this direction, we establish new connections between these invariants for some classes of graphs. We also present algorithmic applications of the results.

A l’articulation de la théorie des nombres et de la didactique des mathématiques, notre recherche vise à étudier la question de la transposition du travail du mathématicien, via l’analyse de processus de recherche de chercheurs, élèves et étudiants sur la recherche d’un même problème non résolu : la conjecture d’Erdös-Straus. Les analyses mathématiques et épistémologiques nous ont permis d’identifier différents aspects du travail du mathématicien et les éléments moteurs dans l’avancée de ses recherches. Cela nous a conduit à développer la notion de « geste » de la recherche pour décrire, analyser et mettre en perspective les processus de recherche des trois publics. Ces analyses ont mis en évidence les potentialités du problème pour créer une situation de recherche de problèmes en classe, plaçant les élèves dans une position proche de celle du mathématicien. Les analyses didactiques se sont appuyées sur la construction d’une telle situation puis sur sa mise à l’épreuve dans un contexte de laboratoire avec des élèves de terminale scientifique. Nous avons analysé finement les processus de recherche des élèves à l’aide des outils méthodologiques développés dans les analyses mathématiques et épistémologiques. Les analyses ont mis en évidence la richesse des procédures mises en oeuvre, un travail effectif dela dialectique entre les connaissances mathématiques et les heuristiques mobilisées, et selonles groupes, une mise en oeuvre de démarches de type expérimental, l’approfondissement de connaissances mathématiques notionnelles et une acquisition d’heuristiques expertes de recherche de problème non résolu. Elles montrent également la pertinence de la notion de «geste » de la recherche pour étudier la question de la transposition du travail des chercheurs. / Our thesis deals with the transposition of mathematician’s reserach activity in mathematical classroom, in the domain of number theory. Our research focuses on the study of a research process for researchers, pupils and students involved in the research of an unsolved problem: the Erdös-Straus conjecture. Our mathematical and epistemological analyses allow us to identify different aspects of the mathematician’s work and the elements for progress in his research. The notion of “gesture” is developed to describe, analyze and contextualize different research processes. This analysis reveals the potentiality of this problem to create a research situation in classroom, where pupils are in a position similar to the mathematician’s one. Didactical analyses are based on the construction of such a situation and its experimentation in laboratory. We study the research process of the students with the methodological tools developed in mathematical and epistemological analyses. This analysis shows several potentiality of this situation: a wealth of procedures implemented, effective work on the dialectical aspects of the mathematical research activity and implementation of experimental approach. The notion of “gesture” is relevant to consider the question of the transposition of mathematician’s work.