Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 737 for “"conjecture"”.
-
The maximal rank conjecture
… d. In this thesis, we prove the Maximal Rank Conjecture, which determines the Hilbert function of C Pr.
-
Generalizations Of The Segal Conjecture
… This generalises Carlsson's proof of the Segal conjecture.
-
Iterative Connections and Abhyankar's Conjecture
… of this work is about the differential Abhyankar conjecture for iterative Picard-Vessiot extensions (IPV-extensions). This conjecture is concerned with the problem which linear algebraic groups occur as iterative differential Galois groups of IPV-extensions with restricted singular locus. In this …
-
An Introduction to Fröberg's Conjecture
<p>The goal of this thesis is to make Fröberg's conjecture more accessible to the average math graduate student by building up the necessary background material to understand specific examples where Fröberg's conjecture is true.</p>
-
Kippenhahn's Conjecture: Counterexamples and Quantisation
… problem in matrix theory, known as Kippenhahn's Conjecture. It was formulated in 1951 by Rudolf Kippenhahn. The conjecture concerns two-variable linear pencils, say in variables x and y with hermitian matrix coefficients H and K respectively. The conjecture relates the eigenvalues of the linear …
-
Domination in graphs: Vizing's conjecture
Vizing's conjecture remains one of the biggest open problems in domination in graph theory today. The conjecture states that the domination number of the Cartesian product of two graphs is at least as large as the product of the domination numbers of the two factor graphs. The aim of this thesis is …
-
Tutte's first colour-cycle conjecture
This thesis presents a proof of Conjecture I (see Section 35) of W. T. Tutte's paper "A contribution to the theory of chromatic polynomials''. It is believed that this conjecture has not previously been resolved. Sections 25 and 38 are original. The remainder of the thesis is a summary of the …
-
Ádám's Conjecture and Arc Reversal Problems
<p>A. Ádám conjectured that for any non-acyclic digraph <em>D</em>, there exists an arc whose reversal reduces the total number of cycles in <em>D</em>. In this thesis we characterize and identify structure common to all digraphs for which Ádám's conjecture holds. We investigate quasi-acyclic …
-
On the Strong Direct Summand Conjecture
… aim is the study the Vanishing of Maps of Tor Conjecture of Hochster and Huneke. We mainly focus on an equivalent characterization called the Strong Direct Summand Conjecture, due to N. Ranganathan. Our results are separated into three chapters. In Chapter 3, we prove special cases of the …
-
The p-adic local langlands conjecture
Let k be a p-adic field. Split reductive groups over k can be described up to k- isomorphism by a based root datum alone, but other groups, called rational forms of the split group, involve an action of the Galois group of k. The Galois action on the based root datum is shared by members of an …
-
A Survey of the Hadamard Conjecture
Hadamard matrices are defined, and their basic properties outlined. A survey of historical and recent literature follows, in which a number of existence theorems are examined and given context. Finally, a new result for Hadamard matrices over $\Z_2$ is presented and given a graph-theoretic …
-
The Ordinary Weight conjecture and Dade's Projective Conjecture for p-blocks with an extra-special defect group
… Various generalizations of Alperin's Weight Conjecture and McKay's Conjecture are due to Reinhard Knorr, Geoffrey R. Robinson and Everett C. Dade. We follow Geoffrey R. Robinson's approach to consider the Ordinary Weight Conjecture, and Dade's Projective Conjecture. The general question is …
-
Dade's Conjecture for the McLaughlin Simple Group
… the first of what was to be a series of conjectures concerned with counting characters in the blocks of finite groups. Specifically, Dade's so-called Ordinary Conjecture asserts that if a finite group G has trivial p-core, and B is a p-block of G of positive defect, then the number k(B,d) …
-
Counterexamples related to the Sato-Tate conjecture
… be an elliptic curve. The Sato--Tate conjecture, now a theorem, tells us that the angles $\theta_p =\cos^{-1}\left(\frac{a_p}{2\sqrt p}\right)$ are equidistributed in $[0,\pi]$ with respect to the measure $\frac{2}{\pi}\sin^2\theta\, d\theta$ if $E$ is non-CM (resp.~$\frac{1}{2\pi} d …
-
Dade's Conjecture for the McLaughlin Simple Group
… the first of what has to be a series of conjectures concerned with counting characters in the blocks of finite groups. Specifically, Dade's so-called Ordinary Conjecture asserts that if a finite group G has trivial p-core and B is a p-block of G of positive defect, then the number $k(B,\ …
-
The Grade Conjecture and asymptotic intersection multiplicity
… this thesis, we study Peskine and Szpiro's Grade Conjecture and its connection with asymptotic intersection multiplicity $\chi_\infty$. Given an $A$-module $M$ of finite projective dimension and a system of parameters $x_1, \ldots, x_r$ for $M$, we show, under certain assumptions on $M$, that …
-
A solution to the Papadimitriou-Ratajczak conjecture
… point-to-point routing. Here we resolve a conjecture of Papadimitrion and Ratajczak that every 3-connected planar graph admits a greedy embedding into the Eulidean plane. This immediately implies that all 3-connected graphs that exclude K₃,₃ as a minor admit a greedy embedding into the …
Page 1 of 37