Orientador: Orlando Lee / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-23T03:38:43Z (GMT). No. of bitstreams: 1 Pereira_LuizFernandodeFaria_M.pdf: 862122 bytes, checksum: 06f038348723d2201293366e75808ffd (MD5) Previous issue date: 2013 / Resumo: Uma partição em caminhos de um grafo dirigido é uma partição do conjunto de vértices deste grafo em caminhos dirigidos. Dada uma métrica sobre partições em caminhos chamada k-norma, o problema de interesse é estabelecer para um dado grafo quais das suas partições em caminhos tem a menor k-norma dentre todas as suas possíveis partições em caminhos. Chamamos estas partições de k-ótimas. Na década de 1980, Claude Berge conjecturou que para toda partição k-ótima, existe um conjunto de k conjuntos independentes disjuntos que, em certo sentido, interceptam o maior número possível de caminhos desta partição. A validade ou a falsidade desta proposição ainda não foi demonstrada, e ela é conhecida como a conjectura de Berge sobre partições em caminhos. Nesta dissertação, fizemos um estudo geral sobre a conjectura de Berge, sua história recente, e o trabalho matemático que foi desenvolvido sobre ela. Exibimos demonstrações para diversos casos particulares da conjectura que já foram resolvidos, como para grafos bipartidos, hamiltonianos, acíclicos, partições compostas somente de caminhos curtos, partições compostas somente de caminhos longos, e para valores fixos de k. Uma parte significativa do trabalho foi dedicada à reescrita da demonstração recente do caso particular onde k = 2, feita por Eli Berger e Irith Hartman, e uma análise do método usado / Abstract: A path partition of a directed graph is a partition of its vertex set into directed paths. Given a metric over path partitions called the k-norm, the problem we are interested in is to determine for a given graph which of its path partitions have the smallest k-norm among all possible path partitions. These partitions are called k-optimal. In the 1980's, Claude Berge conjectured that for every k-optimal path partition, there exists a set of k disjoint independent sets which intercepts the maximum number of paths in this partition. The validity of this proposition has not yet been demonstrated, and it is known as Berge's conjecture on path partitions. In this work, we consider Berge's conjecture, its recent history, and the related mathematical work that has been accomplished. We show proofs for many particular cases of the conjecture, including for acyclic graphs, bipartite graphs, hamiltonian graphs, partitions which include only short paths, partitions which include only long paths, and for fixed values of k. A significant part of this work was dedicated to the rewriting of a recent proof for the particular case where k = 2 by Eli Berger and Irith Hartman, and an analysis of their method / Mestrado / Ciência da Computação / Mestre em Ciência da Computação

>Magister Scientiae - MSc / The aim of this dissertation is to provide an exposition of the Birch and Swinnerton-Dyer Conjecture, considered by many to be one of the most important unsolved problems in modern Mathematics. A review of topics in Algebraic Number Theory and Algebraic Geometry is provided in order to provide a characterisation for elliptic curves over rational numbers. We investigate the group structure of rational points on elliptic curves, and show that this group is finitely generated by the Mordell-Weil Theorem. The Shafarevich-Tate group is introduced by way of an example. Thereafter, with the use of Galois Cohomology, we provide a general definition of this mysterious group. We also discuss invariants like the regulator and real period, which appear in the Birch and Swinnerton-Dyer Conjecture. After defining the L-function, we state the Birch and Swinnerton-Dyer Conjecture and discuss results which have been proved and some consequences. We discuss numerical verification of the Conjecture, and show some computations, including an example of our own.

In 1971, Ganea put forth a conjecture that the LS category of the Cartesian product of a topological space X with a sphere Sn is always exactly 1 higher than the LS category of X by itself. Several special cases of this conjecture were proven in the years following, however the question remained open until 1998 when Iwase produced not just one, but infinitely many counterexamples. In this thesis, we study the methods implemented by Iwase, culminating in the construction of his counterexample.

In 1975, Sheehan conjectured that every simple 4-regular hamiltonian graph has a second Hamilton cycle. If Sheehan's Conjecture holds, then the result can be extended to all simple d-regular hamiltonian graphs with d at least 3. First, we survey some previous results which verify the existence of a second Hamilton cycle if d is large enough. We will then demonstrate some techniques for finding a second Hamilton cycle that will be used throughout this paper. Finally, we use these techniques and show that for certain 4-regular Hamiltonian graphs whose automorphism group is large enough, a second Hamilton cycle exists.

Dans les années 90 Garsia et Haiman ont introduit le $mathfrak S_n$-module des emph{harmoniques diagonales}, c'est à dire les co-invariants de l'action diagonale du groupe symétrique $mathfrak S_n$ sur les polynômes à deux ensembles de $n$ variables. Ils ont proposé la conjecture selon laquelle le caractère de Frobenius bi-gradué de leur module est $abla e_n$, où $abla$ est un opérateur sur l'anneau des fonction symétriques. En 2002, Haiman prouva cette conjecture. Quelques années plus tard, Haglund, Haiman, Loehr, Remmel et Ulyanov proposèrent une formule combinatoire pour la fonction symétrique $abla e_n$, qu'ils appelèrent la emph{conjecture shuffle}. Les objets combinatoires qui y figurent sont les chemins de Dyck étiquetés. Un raffinement emph{compositionnel} de cette formule fut ensuite proposé par Haglund, Morse et Zabrocki. C'était ce raffinement que Carlsson et Mellit réussirent enfin à montrer en 2018, établissant ainsi le emph{théorème shuffle}. La emph{conjecture Delta} est une paire de formules combinatoires pour la fonction symétrique $Delta'_{e_{n-k-1}}e_n$ en termes des chemins de Dyck étiquetés et décorés, qui généralise le théorème shuffle. Elle fut proposée par Hagund, Remmel et Wilson en 2015 est reste aujourd'hui un problème ouvert. Dans la même publication les auteurs proposèrent une formule pour $Delta_{h_m}Delta'_{e_{n-k-1}}e_n$ en termes de chemins de Dyck partiellement étiquetés et décorés, appelé emph{conjecture Delta généralisée}. Nous proposons un raffinement compositionnel de la conjecture Delta en utilisant des nouveaux opérateurs de fonctions symétriques: les opérateurs Theta. Nous généralisons les arguments combinatoires que Carlsson et Mellit utilisèrent pour la preuve du théorème shuffle au contexte de la conjecture Delta. Nous prouvons également la formule pour $Delta_{h_m} abla e_n$ en termes de chemins de Dyck partiellement étiqueté, c'est à dire le cas $k=0$ de la conjecture Delta généralisée. En 2006, Can et Loehr proposèrent la emph{conjecture carré}, exprimant la fonction symétrique $(-1)^{n-1}abla p_n$ en termes de chemins carrés étiquetés. Sergel montra que le théorème shuffle implique la conjecture carré. Nous généralisons le résultat de Sergel en montrant que une des formules de la conjecture Delta généralisée implique une formule combinatoire de la fonction $(-1)^{n-k}Delta_{h_m}Theta_kp_{n-k}$ e / Doctorat en Sciences / info:eu-repo/semantics/nonPublished

Nous contribuons à la conjecture de Malle sur le nombre d'extensions galoisiennes finies E d'un corps de nombres K donné, de groupe de Galois G et dont la norme du discriminant est bornée par y. Nous établissons une minoration de ce nombre pour tout groupe fini G et sur tout corps de nombres K contenant un certain corps de nombres K'. Pour ce faire, on part d'une extension galoisienne régulière F/K(T) que l'on spécialise. On démontre une version forte du théorème d'Irréductibilté de Hilbert qui compte le nombre d'extensions spécialisées et pas seulement le nombre de points de spécialisation. Nous arrivons aussi à prescrire le comportement local en certains premiers des extensions spécialisées. En conséquence, on déduit de nouveaux résultats sur le problème local-global de Grunwald, en particulier pour certains groupes non résolubles. Afin d'arriver à nos fins, nous démontrons des résultats en géométrie diophantienne sur la recherche de points entiers sur des courbes algébriques. / We contribute to the Malle conjecture on the number of finite Galois extensions E of some number field K of Galois group G and of discriminant of norm bounded by y. We establish a lower bound for every group G and every number field K containing a certain number field K'. To achieve this goal, we start from a regular Galois extension F/K(T) that we specialize. We prove a strong version of the Hilbert Irreducibility Theorem which counts the number of specialized extensions and not only the specialization points. We can also prescribe the local behaviour of the specialized extensions at some primes. Consequently, we deduce new results on the local-global Grunwald problem, in particular for some non-solvable groups. To reach our goals, we prove some results in diophantine geometry about the number of integral points on an algebraic curve.

京都大学 / 0048 / 新制・課程博士 / 博士(理学) / 甲第20753号 / 理博第4329号 / 新制||理||1622(附属図書館) / 京都大学大学院理学研究科数学・数理解析専攻 / (主査)教授 森脇 淳, 教授 雪江 明彦, 教授 並河 良典 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DFAM

No description available.

We study the analytic properties of the Eisenstein Series of $frac {1}{2}$-integral weight associated with the Hecke congruence subgroup $Gamma_0(4)$. Using these properties we obtain asymptotics for sums of certain Dirichlet $L$-series. We also obtain a formula reducing the study of Selberg's Eigenvalue Conjecture to the study of the nonvanishing of the Eisenstein Series $E(z,s)$ for Hecke congruence subgroups $Gamma_0(N)$ at $s=frac {1+i}{2}$.

The purpose of this paper is to provide new examples supporting a conjecture of Ash, Doud, and Pollack. This conjecture involves Galois representations taking Gal(Q bar/Q) to the general linear group of 3 x 3 matrices in characterisic 2, and our examples are where complex conjugation is mapped to the identity. Since this case has not yet been examined, the results of this paper are quite significant.