Log in

Relevant bibliographies by topics / Theorems / Dissertations / Theses

Dissertations / Theses on the topic 'Theorems'

To see the other types of publications on this topic, follow the link: Theorems.

Author: Grafiati

Published: 4 June 2021

Last updated: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Theorems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Coloretti, Guglielmo. "On Noether's theorems and gauge theories in hamiltonian formulation." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/18723/.

Full text

Abstract:

Nella tesi presente si propone una trattazione esaustiva sui teoremi di Noether, cardine delle più moderne ed avanzate teorie di gauge. In particolare si tenta di fornirne una misura matematica rigorosa senza allontanarsi dalla cruciale intuizione fisica che celano: la ricerca di simmetrie nella natura e la volontà di descrivere le interazioni conosciute con un singolo modello. Più avanti, trovando i caratteri dominanti e l'ispirazione nelle pubblicazioni di Noether, si affrontano i tratti generali della formulazione hamiltoniana delle teorie di gauge, presentando la struttura dell'azione per una particella relativistica, la teoria elettromagnetica e la teoria della relatività generale; si pongono infine alcuni interrogativi sui valori di contorno che emergono dal formalismo adottato. Inoltre, per ottenere un'esposizione più efficace e meno oscura, si accompagna ogni risultato con esempi opportuni.

APA, Harvard, Vancouver, ISO, and other styles

2

Hood, C. "Products and Kunneth theorems in cyclic homology and cohomology theories." Thesis, University of Warwick, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373079.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chen, Bin. "Functional limit theorems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ37060.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Poutiainen, H. (Hayley). "On Sylow’s theorems." Master's thesis, University of Oulu, 2015. http://urn.fi/URN:NBN:fi:oulu-201512012188.

Full text

Abstract:

Group theory is a mathematical domain where groups and their properties are studied. The evolution of group theory as an area of study is said to be the result of the parallel development of a variety of different studies in mathematics. Sylow’s Theorems were a set of theorems proved around the same time the concept of group theory was being established, in the 1870s. Sylow used permutation groups in his proofs which were then later generalized and shown to hold true for all finite groups. These theorems paved the way for more detailed study of abstract groups and they have had a remarkable impact on the progress of finite group theory. Sylow’s Theorems provide information about the number and nature of the subgroups of a given finite group. The three basic theorems discovered by Sylow are discussed in the paper in detail. Sylow’s Theorems prove the existence of Sylow p-subgroups for any prime p that divides the order of the group. They show that all Sylow p-subgroups are conjugate. And finally they indicate how one can determine the number of Sylow p-subgroups which exist. Due to the power of these theorems in finite group theory they have been proved by a large number of mathematicians in a variety of different ways, as is shown in the final chapter of the paper. The theory necessary to understand the Sylow’s Theorems is covered in the first four chapters of this paper, with Sylow’s Theorems being covered in the final chapter. Lagrange’s Theorem is the first important theorem and is found in Chapter 2. Lagrange’s Theorem links the size of the group and its subgroups. The corollary of Lagrange’s Theorem is not necessarily true and Sylow’s Theorems provided a solution to this particular issue. Cauchy’s Theorem as discussed in Chapter 4, is believed to have been the inspiration for Sylow’s Theorem of existence of the subgroups. Initially Cauchy’s Theorem made use of permutation groups as did Sylow’s Theorem. Cauchy’s Theorem states that if G is a finite group and p is a prime divisor of G then the group contains an element of order p, whilst Sylow’s Theorem generalizes the finding to show that if the group G is divisible by a prime p^n then G contains a subgroup whose order is then ^n. The final section of the paper deals with the consequences that Sylow’s Theorems have in terms of practical application to finite groups. The problem of the corollary to Lagrange’s Theorem and how Sylow’s Theorem provides a solution is also dealt with. The most important references in generating the theory needed for the paper comes from Joseph. J. Rotman: A first course in Abstract Algebra, 2nd ed. (Prentice Hall, Upper Saddle River, 2000) and I. N. Hernstein: Abstract Algebra (Prentice Hall, Upper Saddle River, 1995).

APA, Harvard, Vancouver, ISO, and other styles

5

Davies, Brian E., Graham M. L. Gladwell, Josef Leydold, and Peter F. Stadler. "Discrete Nodal Domain Theorems." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/976/1/document.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Johnson, O. "Entropy and limit theorems." Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.605633.

Full text

Abstract:

This thesis uses techniques based on Shannon entropy to prove probabilistic limit theorems. Chapter 1 defines entropy and Fisher information, and reviews previous work. We reformulate the Central Limit Theorem to state that the entropy of sums of independent identically distribution real-value random variables converges to its unique maximum, the normal distribution. This is called convergence in relative entropy, and is proved by Barron. Chapter 2 extends Barron's results to non-identically distributed random variables, extending the Lindeberg-Feller Theorem, under similar conditions. Next, in Chapter 3, we provide a proof for random vectors. In Chapter 4, we discuss convergence to other non-Gaussian stable distributions. Whilst not giving a complete solution to this problem, we provide some suggestions as to how the entropy theoretic method may apply in this case. The next two chapters concern random variables with values on compact groups. Although the situation is different, in that the limit distribution is uniform, again this is a maximum entropy distribution, so some of the same ideas will apply. In Chapter 7 we discuss conditional limit theorems, which relate to the problem in Statistical Physics of 'equivalence of ensembles'. We consider random variables equidistributed on the surface of certain types of manifolds, and show their projections are close to Gibbs densities. Once again, the proof involves convergence in relative entropy, establishing continuity of the projection map with respect to the Kullback-Leibler topology. The bound is sharp and provides a necessary and sufficient condition for convergence in relative entropy. If we consider the manifold as a surface of equal energy for a particular Hamiltonian, this implies that the microcanonical and canonical ensembles are close to one another.

APA, Harvard, Vancouver, ISO, and other styles

7

Rinsma, I. "Existence theorems for floorplans." Thesis, University of Canterbury. Mathematics, 1987. http://hdl.handle.net/10092/8425.

Full text

Abstract:

The existence of floorplans with given areas and adjacencies for the rooms cannot always be guaranteed. Rectangular, isometric and convex floorplans are considered. For each, the areas of the rooms and a graph representing the required internal adjacencies between the rooms is given. This thesis gives existence theorems for a floorplan satisfying these conditions. If the graph is maximal outerplanar, only a convex floorplan can always be guaranteed. Floorplans of each type can be found if the graph is a tree. A branching index is defined for a tree, and used to give the minimum number of vertices of degree 2 in any maximal outerplanar graph, in which the tree can be embedded. If the graph of adjacencies is a tree, and each room in the plan is external, once again only convex floorplans can always be guaranteed. Rectangular floorplans can always be found in some cases, depending on the embedding index of the tree.

APA, Harvard, Vancouver, ISO, and other styles

8

Eriksson, Andreas. "Index Theorems and Supersymmetry." Thesis, Uppsala universitet, Teoretisk fysik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-231033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Davies, Brian E., Josef Leydold, and Peter F. Stadler. "Discrete Nodal Domain Theorems." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/1674/1/document.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Preen, James. "Structure theorems for graphs." Thesis, University of Nottingham, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.357965.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Tuncer, Özarslan Nigar. "Globalization theorems in topology." Diss., Online access via UMI:, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

12

KUSAKARI, Keiichirou, Masahiko SAKAI, and Toshiki SAKABE. "Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting." IEICE, 2005. http://hdl.handle.net/2237/9580.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Bjelaković, Igor. "Limit theorems for quantum entropies." [S.l.] : [s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=970400454.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Hambrook, Kyle David. "Restriction theorems and Salem sets." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/54044.

Full text

Abstract:

In the first part of this thesis, I prove the sharpness of the exponent range in the L² Fourier restriction theorem due to Mockenhaupt and Mitsis (with endpoint estimate due to Bak and Seeger) for measures on ℝ. The proof is based on a random Cantor-type construction of Salem sets due to Laba and Pramanik. The key new idea is to embed in the Salem set a small deterministic Cantor set that disrupts the restriction estimate for the natural measure on the Salem set but does not disrupt the measure's Fourier decay. In the second part of this thesis, I prove a lower bound on the Fourier dimension of Ε(ℚ,ψ,θ) = {x ∊ ℝ : ‖qx - θ‖ ≤ ψ(q) for infinitely many q ∊ ℚ}, where ℚ is an infinite subset of ℤ, Ψ : ℤ → (0,∞), and θ ∊ ℝ. This generalizes theorems of Kaufman and Bluhm and yields new explicit examples of Salem sets. I also prove a multi-dimensional analog of this result. I give applications of these results to metrical Diophantine approximation and determine the Hausdorff dimension of Ε(ℚ,ψ,θ) in new cases.
Science, Faculty of
Mathematics, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

15

Costa, Joao Lopes. "On black hole uniqueness theorems." Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.514963.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Radcliffe, A. J. "Sauer theorems for set systems." Thesis, University of Cambridge, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306506.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Vaughan, Emil Richard. "Some applications of matching theorems." Thesis, Queen Mary, University of London, 2010. http://qmro.qmul.ac.uk/xmlui/handle/123456789/1286.

Full text

Abstract:

This thesis contains the results of two investigations. The rst concerns the 1- factorizability of regular graphs of high degree. Chetwynd and Hilton proved in 1989 that all regular graphs of order 2n and degree 2n where > 1 2 ( p 7 1) 0:82288 are 1-factorizable. We show that all regular graphs of order 2n and degree 2n where is greater than the second largest root of 4x6 28x5 71x4 + 54x3 + 88x2 62x + 3 ( 0:81112) are 1-factorizable. It is hoped that in the future our techniques will yield further improvements to this bound. In addition our study of barriers in graphs of high minimum degree may have independent applications. The second investigation concerns partial latin squares that satisfy Hall's Condition. The problem of completing a partial latin square can be viewed as a listcolouring problem in a natural way. Hall's Condition is a necessary condition for such a problem to have a solution. We show that for certain classes of partial latin square, Hall's Condition is both necessary and su cient, generalizing theorems of Hilton and Johnson, and Bobga and Johnson. It is well-known that the problem of deciding whether a partial latin square is completable is NP-complete. We show that the problem of deciding whether a partial latin square that is promised to satisfy Hall's Condition is completable is NP-hard.

APA, Harvard, Vancouver, ISO, and other styles

18

MACHADO, ALINE DE MELO. "THEOREMS FOR UNIQUELY ERGODIC SYSTEMS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=36388@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE EXCELENCIA ACADEMICA
Os resultados fundamentais da teoria ergódica – o teorema de Birkhoff e o teorema de Kingman – se referem a convergência em quase todo ponto de um processo ergódico aditivo e subaditivo, respectivamente. É bem conhecido que dado um sistema unicamente ergódico e um observável contínuo, as médias de Birkhoff correspondentes convergem em todo ponto e uniformemente. Desta forma, é natural também se perguntar o que acontece com o teorema de Kingman quando o sistema é unicamente ergódico. O primeiro objetivo desta dissertação é responder a essa pergunta utilizando o trabalho de A. Furman. Mais ainda, apresentamos algumas extensões e aplicações desse resultado para cociclos lineares, que foram obtidas por S. Jitomirskaya e R. Mavi. Nosso segundo objetivo é provar um novo resultado sobre taxas de convergências de médias de Birkhoff, para um certo tipo de processo unicamente ergódico: uma translação diofantina no toro com um observável Holder contínuo.
The fundamental results in ergodic theory – the Birkhoff theorem and the Kingman theorem – refer to the almost everywhere convergence of additive and respectively subadditive ergodic processes. It is well known that given a uniquely ergodic system and a continuous observable, the corresponding Birkhoff averages converge everywhere and uniformly. It is therefore natural to ask what happens with Kingman s theorem when the system is uniquely ergodic. The first objective of this dissertation is to answer this question following the work of A. Furman. Moreover, we present some extensions and applications of this result for linear cocycles, which were obtained by S. Jitomirskaya and R. Mavi. Our second objective is to prove a new result regarding the rate of convergence of the Birkhoff averages for a certain type of uniquely ergodic process: a Diophantine torus translation with Holder continuous observable.

APA, Harvard, Vancouver, ISO, and other styles

19

Miller, Elizabeth Caroline. "Structure theorems for ordered groupoids." Thesis, Heriot-Watt University, 2009. http://hdl.handle.net/10399/2217.

Full text

Abstract:

The Ehresmann-Schein-Nambooripad theorem, which states that the category of inverse semigroups is isomorphic to the category of inductive groupoids, suggests a route for the generalisation of ideas from inverse semigroup theory to the more general setting of ordered groupoids. We use ordered groupoid analogues of the maximum group image and the E-unitary property – namely the level groupoid and incompressibility – to address structural questions about ordered groupoids. We extend the definition of the Margolis-Meakin graph expansion to an expansion of an ordered groupoid, and show that an ordered groupoid and its expansion have the same level groupoid and that the incompressibility of one determines the incompressibility of the other. We give a new proof of a P-theorem for incompressible ordered groupoids based on the Cayley graph of an ordered groupoid, and also use Ehresmann’s Maximum Enlargement Theorem to prove a generalisation of the P-theorem for more general immersions of ordered groupoids. We then carry out an explicit comparison between the Gomes-Szendrei approach to idempotent pure maps of inverse semigroups and our construction derived from the Maximum Enlargement Theorem.

APA, Harvard, Vancouver, ISO, and other styles

20

Seppälä, L. (Louna). "Siegel’s lemma and Minkowski’s theorems." Master's thesis, University of Oulu, 2015. http://urn.fi/URN:NBN:fi:oulu-201512012187.

Full text

Abstract:

The subject of the work is geometry of numbers, which uses geometric arguments in n-dimensional euclidean space to prove arithmetic results. Siegel’s and Minkowski’s existential theorems are studied: When dealing with a group of linear equations where the number of unknowns exceeds the number of equations, Siegel’s lemma confirms the existence of a non-trivial solution whose size is bounded by a certain positive function depending on the coefficients of the linear forms and the number of unknowns. Minkowski’s theorems in turn concern convex bodies and lattices in n-dimensional euclidean space: when a convex body satisfies a specific condition with respect to the lattice, it is bound to intersect the lattice in a non-zero point. A selection of Diophantine inequalities is presented in order to illustrate the remarkable usefulness of this fact. Finally, Bombieri-Vaaler version of Siegel’s lemma is applied with the aim of improving (in rational case) a result of Ernvall-Hytönen, Leppälä and Matala-aho on Hermite-Padé type approximations (An explicit Baker type lower bound for linear forms, Lemma 4.1). The main sources, in addition to the above-mentioned article, are A geometric face of Diophantine analysis by Matala-aho (lecture notes), Lectures on Transcendental numbers by Mahler (Springer-Verlag, 1976) and Diophantine approximation by Evertse (lecture notes)
Työn aiheena on lukujen geometria, jossa todistetaan aritmeettisia tuloksia käyttäen apuna geometriaa n-ulotteisessa euklidisessa avaruudessa. Aluksi perehdytään Siegelin ja Minkowskin olemassaolotuloksiin: Kun lineaarisessa yhtälöryhmässä tuntemattomien määrä ylittää yhtälöiden määrän, Siegelin lemma varmistaa nollasta poikkeavan ratkaisun olemassaolon, jonka kokoa rajoittaa tietty yhtälöryhmän kertoimista ja tuntemattomien määrästä riippuva positiivinen funktio. Minkowskin lauseet vuorostaan liittyvät konvekseihin kappaleisiin n-ulotteisessa euklidisessa avaruudessa: kun konveksi kappale toteuttaa tietyn ehdon hilan suhteen, sen sisältä löytyy aina nollasta poikkeava hilapiste. Tämän tuloksen merkittävyyttä havainnollistaa valikoima Diofantoksen epäyhtälöitä. Lopuksi sovelletaan Bombierin ja Vaalerin versiota Siegelin lemmasta tavoitteena parantaa (rationaalitapauksessa) Ernvall-Hytösen, Leppälän ja Matala-ahon tulosta liittyen Hermite-Padé-tyypin approksimaatioihin (An explicit Baker type lower bound for linear forms, Lemma 4.1). Päälähteinä on edellä mainitun artikkelin lisäksi käytetty Matala-ahon luentomonistetta A geometric face of Diophantine analysis, Mahlerin kirjaa Lectures on Transcendental numbers (Springer-Verlag, 1976) sekä Evertsen luentomonistetta Diophantine approximation

APA, Harvard, Vancouver, ISO, and other styles

21

Gonchigdanzan, Khurelbaatar. "ALMOST SURE CENTRAL LIMIT THEOREMS." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin990028192.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Korchagina, Inna A. "Three theorems on simple groups /." The Ohio State University, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486398195328034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Zhang, Na. "Limit Theorems for Random Fields." University of Cincinnati / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1563527352284677.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Pogan, Alexandru Alin. "Dichotomy theorems for evolution equations." Diss., Columbia, Mo. : University of Missouri-Columbia, 2008. http://hdl.handle.net/10355/6090.

Full text

Abstract:

Thesis (Ph. D.)--University of Missouri-Columbia, 2008.
The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on June 22, 2009) Vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

25

Mousaaid, Youssef. "Convers Theorems of Borcherds Products." Thesis, Université d'Ottawa / University of Ottawa, 2018. http://hdl.handle.net/10393/38405.

Full text

Abstract:

In his paper, Borcherds introduced a theta lift which allowed him to lift classical modular forms with poles at cusps to automorphic forms on the orthogonal group O(2, l). The resulting automorphic forms, called Borcherds products, possess an infinite product expansion and have their singularities located along certain arithmetic divisors, the so-called Heegner divisors. Mainly based on the work of Bruinier, we study the question whether every automorphic form having its divisor along the Heegner divisors can be realized as a Borcherds product.

APA, Harvard, Vancouver, ISO, and other styles

26

Jiang, Xinxin. "Central limit theorems for exchangeable random variables when limits are mixtures of normals /." Thesis, Connect to Dissertations & Theses @ Tufts University, 2001.

Find full text

Abstract:

Thesis (Ph.D.)--Tufts University, 2001.
Adviser: Marjorie G. Hahn. Submitted to the Dept. of Mathematics. Includes bibliographical references (leaves44-46). Access restricted to members of the Tufts University community. Also available via the World Wide Web;

APA, Harvard, Vancouver, ISO, and other styles

27

Choi, Man Kin. "Martingale representation theorems and their applications." Thesis, University of Macau, 2006. http://umaclib3.umac.mo/record=b1636801.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Papoutsakis, Ioannis E. "Two structure theorems on tree spanners." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0003/MQ45520.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Hunt, Philip James. "Limit theorems for stochastic loss networks." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358647.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Villar, Antonio. "Operator theorems with applications to economics." Thesis, University of Oxford, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239279.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Skipper, Max. "Some approximation theorems in discrete probability." Thesis, University of Oxford, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526439.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Miller, Alice Ann. "Effective subspace theorems for function fields." Thesis, University of East Anglia, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.327886.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Spencer, Matthew. "Brauer relations, induction theorems and applications." Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/95231/.

Full text

Abstract:

Let G be a finite group and F a field, then to any finite G-set X we may associate a F [G]-permutation module whose F -basis is indexed by elements of X. We seek to describe when two non-isomorphic G-sets give rise isomorphic permutation modules. This amounts to describing the kernel KF(G) of a map between the Burnside Ring of G and the ring of representation ring of F [G]-representations of G. Elements of this kernel are known as Brauer Relations and have extensive applications in Number Theory, for example giving relationships between class numbers of the in-termediate Number fields of a Galois extension. In characteristic 0, the generators of KF(G) have been classified in [2]. We extend this classification to characteristic p > 0 for all finite groups G save for groups which admit a subquotient which is an extension of a non-elementary p-quasi-elementary group by a p-group. Our approach initially mimics that in characteristic 0, and so we give a much more general description of these steps in terms of Green functors.

APA, Harvard, Vancouver, ISO, and other styles

34

Zhao, Yufei. "Sparse regularity and relative Szemerédi theorems." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99060.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 171-179).
We extend various fundamental combinatorial theorems and techniques from the dense setting to the sparse setting. First, we consider Szemerédi regularity lemma, a fundamental tool in extremal combinatorics. The regularity method, in its original form, is effective only for dense graphs. It has been a long standing problem to extend the regularity method to sparse graphs. We solve this problem by proving a so-called "counting lemma," thereby allowing us to apply the regularity method to relatively dense subgraphs of sparse pseudorandom graphs. Next, by extending these ideas to hypergraphs, we obtain a simplification and extension of the key technical ingredient in the proof of the celebrated Green-Tao theorem, which states that there are arbitrarily long arithmetic progressions in the primes. The key step, known as a relative Szemerédi theorem, says that any positive proportion subset of a pseudorandom set of integers contains long arithmetic progressions. We give a simple proof of a strengthening of the relative Szemerédi theorem, showing that a much weaker pseudorandomness condition is sufficient. Finally, we give a short simple proof of a multidimensional Szemerédi theorem in the primes, which states that any positive proportion subset of Pd (where P denotes the primes) contains constellations of any given shape. This has been conjectured by Tao and recently proved by Cook, Magyar, and Titichetrakun and independently by Tao and Ziegler.
by Yufei Zhao.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

35

König, Robert Tohru. "de Finetti theorems for quantum states." Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.613323.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Case, Caleb. "Best Approximations, Lethargy Theorems and Smoothness." Scholarship @ Claremont, 2016. http://scholarship.claremont.edu/cmc_theses/1225.

Full text

Abstract:

In this paper we consider sequences of best approximation. We first examine the rho best approximation function and its applications, through an example in approximation theory and two new examples in calculating n-widths. We then further discuss approximation theory by examining a modern proof of Weierstrass's Theorem using Dirac sequences, and providing a new proof of Chebyshev's Equioscillation Theorem, inspired by the de La Vallee Poussin Theorem. Finally, we examine the limits of approximation theorem by looking at Bernstein Lethargy theorem, and a modern generalization to infinite-dimensional subspaces. We all note that smooth functions are bounded by Jackson's Inequalities, but see a newer proof that a single non-differentiable point can make functions again susceptible to lethargic rates of convergence.

APA, Harvard, Vancouver, ISO, and other styles

37

Biyikoglu, Türker, Josef Leydold, and Peter F. Stadler. "Nodal Domain Theorems and Bipartite Subgraphs." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2005. http://epub.wu.ac.at/626/1/document.pdf.

Full text

Abstract:

The Discrete Nodal Domain Theorem states that an eigenfunction of the k-th largest eigenvalue of a generalized graph Laplacian has at most k (weak) nodal domains. We show that the number of strong nodal domains cannot exceed the size of a maximal induced bipartite subgraph and that this bound is sharp for generalized graph Laplacians. Similarly, the number of weak nodal domains is bounded by the size of a maximal bipartite minor. (author's abstract)
Series: Preprint Series / Department of Applied Statistics and Data Processing

APA, Harvard, Vancouver, ISO, and other styles

38

Guerberoff, Lucio. "Modularity lifting theorems for unitary groups." Paris 7, 2011. http://www.theses.fr/2011PA077069.

Full text

Abstract:

La partie principale de cette thèse est dévouée à la démonstration de théorèmes de modularité pour des représentations galoisiennes 1-adiques de n'importe quelle dimension satisfaisant une condition de type unitaire et une condition de type Fontaine-Laffaille en 1. Ces résultats généralisent le travail de Clozel, Harris et Taylor, et l'article ultérieur de Taylor. La démonstration utilise la méthode de Taylor-Wiles, dans sa version améliorée par Diamond, Fujiwara, Kisin et Taylor, appliquée aux algèbres d'Hecke des groupes unitaires, et des résultats de Labesse sur le changement de base stable et la descente des groupes unitaires vers GLn. Notre résultat est un ingrédient de la récente démonstration de la conjecture de Sato-Tate, et il a été utilisé également pour démontrer des autres théorèmes de modularité. A la fin de la thèse, on inclut une approche algorithmique pour la modularité des courbes elliptiques sur les corps quadratiques imaginaires
The main part of this thesis is devoted to the proof of modularity lifting theorems for l-adic Galois representations of any dimension satisfying a unitary type condition and a Fontaine-Laffaille condition at 1. This extends the results of Clozel, Harris and Taylor, and the subsequent work by Taylor. The proof uses the Taylor-Wiles method, as improved by Diamond, Fujiwara, Kisin and Taylor, applied to Hecke algebras of unitary groups, and results of Labesse on stable base change and descent from unitary groups to GLn. Our result is an ingredient of the recent proof of the Sato-Tate conjecture, and bas been applied to prove other modularity lifting theorems as well. At the end of the thesis, we include an algorithmic approach to modularity of elliptic curves over imaginary quadratic fields

APA, Harvard, Vancouver, ISO, and other styles

39

Farris, Lindsey. "Normal p-Complement Theorems." Youngstown State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1525865906237554.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Fujioka, Tadashi. "Fibration theorems for collapsing Alexandrov spaces." Doctoral thesis, Kyoto University, 2021. http://hdl.handle.net/2433/263435.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Wang, Jiun-Chau. "Limit theorems in noncommutative probability theory." [Bloomington, Ind.] : Indiana University, 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3331258.

Full text

Abstract:

Thesis (Ph.D.)--Indiana University, Dept. of Mathematics, 2008.
Title from PDF t.p. (viewed on Jul 27, 2009). Source: Dissertation Abstracts International, Volume: 69-11, Section: B, page: 6852. Adviser: Hari Bercovici.

APA, Harvard, Vancouver, ISO, and other styles

42

姜淑梅. "Fixed point theorem, cycle point theorems and their applications." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/08929230492999461471.

Full text

Abstract:

碩士
國立新竹教育大學
人資處數學教育碩士班
94
Abstract In this paper, we establish a fixed theorem of a and apply this fixed theorem to get an existence theorem concerning generalized variational inequalities. We also establish some cycle point theorems for three set-valued mappings. (特殊符號無法顯現請參閱PDF檔)

APA, Harvard, Vancouver, ISO, and other styles

43

Chi-, Ming Chen. "Fixed Point Theorems,KKM Theorems and its Applications." 2001. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0021-2603200719120143.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Chen, Chi Ming, and 陳啟銘. "Fixed Point Theorems、KKM Theorems and its Applications." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/15228415208694812448.

Full text

Abstract:

博士
國立臺灣師範大學
數學研究所
90
Abstract The purpose of this paper is to study the fixed point theory and the KKM theory , we get some fixed point theorems and generalized KKM theorems. As applications, we use the above results to related topics, for examples, the matching theorems, the existence theorems of quasi-equilibrium, quasi-variational inequalities. This paper contains three chapters. In the first chapter, we discuss some fixed point theorems and coincidence theorems about inward contractive functions and inward nonexpansive functions. In second chapter, we introduce some conceptions of non-convexities, study their properties, and apply these properties to get some generalized KKM theorems, the matching theorems, and the existence theorems of quasi-equilibrium. In this chapter, we also introduce a new family of functions, Q(X,Y), we research its properties and get some fixed point theorems about this family. In the last chapter, we study the properties of the family of approachable functions in uniform spaces. By using these properties, we attain some fixed point theorems and coincidence theorems. The results of this paper actually extend many results of authors as in the references.

APA, Harvard, Vancouver, ISO, and other styles

45

Chen, Hsin I., and 陳欣怡. "Continuous Selection Theorem, System of Coincidence Theorems and Their Applications." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/62115589678176944717.

Full text

Abstract:

碩士
國立彰化師範大學
數學系
89
In this paper, we first use continuous selection theorems to establish some system of coincidence theorems, then we apply the system of coincidence theorem to the equilibrium problem with finite number families of players and finite number families of constraints on strategy sets. We establish the existence theorems of this problem.

APA, Harvard, Vancouver, ISO, and other styles

46

簡詩芸. "Coincidence Theorems, Generalized G-KKM Theorems and Their Applications." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/99317286720679565010.

Full text

Abstract:

碩士
國立新竹教育大學
數學教育學系碩士班
93
Let X be a nonempty G-convex space, let Y be a topological space, let F in G-KKM(X,Y) , and let Q is a set-valued mapping from Y into X be a Φ-mapping. In this paper, we establish some coincidence theorems of F and Q under some assumptions. We also establish some generalized G-KKM theorems and apply these generalized G-KKM theorems to establish the existence theorems concerning variational inequalities. Our results generalize many other authors’ results (for example, see, [7,13,20,23]).

APA, Harvard, Vancouver, ISO, and other styles

47

蔡芳瑩. "Coincidence Theorems and Matching Theorems on G-convex Spaces." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/01641176868524379190.

Full text

Abstract:

碩士
國立新竹教育大學
數理研究所(數學組)
92
In this paper, we shall use the properties of G-S-KKM mapping and -S-KKM mapping to get some coincidence theorems, fixed point theorems, and matching theorems. These results generalize many results of other authors (for example, see [1], [3], [6], [9], [12], [17], [22]).

APA, Harvard, Vancouver, ISO, and other styles

48

Hou, Shang-Dung, and 侯森棟. "Some new best proximity point theorems and convergent theorems." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/24344970037512244946.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

陳昆豊. "Coincidence Theorems, Generalized G-s-KKM Theorems and Their Applications." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/32715177916010305003.

Full text

Abstract:

碩士
國立新竹教育大學
人資處數學教育碩士班
94
Let X be a nonempty set, let Y be a nonempty G-convex space, let Z be a topological space, let F in G-s-KKM(X,Y,Z) , and let Q is a set-valued mapping from Z into Y be a Φ-mapping. In this paper, we establish some coincidence theorems of F and Q under some assumptions. We also establish some generalized G-s-KKM theorems and apply these generalized G-s-KKM theorems to establish the existence theorems concerning variational inequalities. Our results generalize many other authors’ results (for example, see, [6,12,18,21]).

APA, Harvard, Vancouver, ISO, and other styles

50

Chen, Ping-Jen, and 陳炳仁. "GENERALIZATIONS OF KY FAN'S MATCHING THEOREMS AND KKM-MAP THEOREMS." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/88378048319258987667.

Full text

Abstract:

碩士
國立師範大學
數學系
81
The purpose of this paper is to extend the Glicksberg fixed point theorem (1952) to the case of Kakutani factorizable multifunctions and we use this generalization of Glicksberg fixed point theorem to generalize Ky fan's matching theorems for closed(open) coverings of convex sets(1984) and Ky fan's KKM-map theorems(1961).

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!