Relevant bibliographies by topics / Lemmas / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Lemmas.

Dissertations / Theses on the topic 'Lemmas'

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 'Lemmas.'

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

JACHELLI, KEILLA LOPES CASTILHO. "SPERNER S LEMMAS AND APPLICATIONS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2017. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=33127@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>PROGRAMA DE MESTRADO PROFISSIONAL EM MATEMÁTICA EM REDE NACIONAL<br>Esse trabalho visa demonstrar os lemas de Sperner e aplicá-los nasdemonstrações do teorema de Monsky em Q2 e do teorema do ponto fixo deBrouwer em R2. Além disso, relatamos como esses lemas foram abordados com alunos da educação básica tendo como ferramenta educacional jogos de tabuleiro.<br>This work aims to prove the Sperner s Lemmas and to apply them in proving the Monsky s Theorem in Q2 and the Brouwer fixe
APA, Harvard, Vancouver, ISO, and other styles
2

Pfeiffer, Markus Johannes. "Adventures in applying iteration lemmas." Thesis, University of St Andrews, 2013. http://hdl.handle.net/10023/3671.

Full text
Abstract:
The word problem of a finitely generated group is commonly defined to be a formal language over a finite generating set. The class of finite groups has been characterised as the class of finitely generated groups that have word problem decidable by a finite state automaton. We give a natural generalisation of the notion of word problem from finitely generated groups to finitely generated semigroups by considering relations of strings. We characterise the class of finite semigroups by the class of finitely generated semigroups whose word problem is decidable by finite state automata. We then ex
APA, Harvard, Vancouver, ISO, and other styles
3

Johansson, Moa. "Automated discovery of inductive lemmas." Thesis, University of Edinburgh, 2009. http://hdl.handle.net/1842/9807.

Full text
Abstract:
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging problems for automated theorem proving and have generally been assumed to require user intervention. This thesis is mainly concerned with the automated discovery of inductive lemmas. We have explored two approaches based on failure recovery and theory formation, with the aim of improving automation of firstand higher-order inductive proofs in the IsaPlanner system. We have implemented a lemma speculation critic which attempts to find a missing lemma using information from a failed proof-attempt. Howev
APA, Harvard, Vancouver, ISO, and other styles
4

Lovász, László Miklós. "Regularity and removal lemmas and their applications." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/112899.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2017.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 123-127).<br>In this thesis, we analyze the regularity method pioneered by Szemerédi, and also discuss one of its prevalent applications, the removal lemma. First, we prove a new lower bound on the number of parts required in a version of Szemerédi's regularity lemma, determining the order of the tower height in that version up to a constant factor. This addresses a question of Gowers. Next, we turn to algorithms. We give
APA, Harvard, Vancouver, ISO, and other styles
5

Michael, Ifeanyi Friday. "On a unified categorical setting for homological diagram lemmas." Thesis, Stellenbosch : Stellenbosch University, 2011. http://hdl.handle.net/10019.1/18085.

Full text
Abstract:
Thesis (MSc)--Stellenbosch University, 2011.<br>ENGLISH ABSTRACT: Some of the diagram lemmas of Homological Algebra, classically known for abelian categories, are not characteristic of the abelian context; this naturally leads to investigations of those non-abelian categories in which these diagram lemmas may hold. In this Thesis we attempt to bring together two different directions of such investigations; in particular, we unify the five lemma from the context of homological categories due to F. Borceux and D. Bourn, and the five lemma from the context of modular semi-exact categories i
APA, Harvard, Vancouver, ISO, and other styles
6

Nunes, Alexmay Soares. "As permutaÃÃes caÃticas, o problema de Lucas e a teoria dos permanentes." Universidade Federal do CearÃ, 2015. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15598.

Full text
Abstract:
In this work we cover some counting techniques used to solve some classic problems in Combinatorics. We also show a link between the so called ârencontre problemâ, the âmÃnage problemâ and the permanent of a square matrix.<br>Neste trabalho abordamos algumas tÃcnicas de contagem utilizadas para solucionar alguns problemas clÃssicos da AnÃlise CombinatÃria. Mostramos tambÃm uma relaÃÃo entre o problema das cartas mal endereÃadas, o problema de Lucas e os permanentes de uma matriz quadrada.
APA, Harvard, Vancouver, ISO, and other styles
7

Edmundo, Mario Jorge. "O-minimal expansions of groups." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.312447.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Aimino, Romain. "Vitesse de mélange et théorèmes limites pour les systèmes dynamiques aléatoires et non-autonomes." Thesis, Toulon, 2014. http://www.theses.fr/2014TOUL0005/document.

Full text
Abstract:
Dans cette thèse, nous nous intéressons aux propriétés statistiques des systèmes dynamiques aléatoires et non-autonomes. Dans le premier chapitre, consacré aux systèmes aléatoires, nous établissons un cadre fonctionnel abstrait, couvrant une large classe de systèmes dilatants en dimension 1 et supérieure, permettant de démontrer de nombreux théorèmes limites annealed. Nous donnons aussi une condition nécessaire et suffisante pour que la version quenched du théorème de la limite centrale soit valide en dimension 1. Dans le chapitre deux, après avoir introduit la notion de système non-autonome,
APA, Harvard, Vancouver, ISO, and other styles
9

Cobra, Thiago Taglialatela [UNESP]. "Sobre coincidências e pontos fixos de aplicações." Universidade Estadual Paulista (UNESP), 2010. http://hdl.handle.net/11449/94372.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:27:10Z (GMT). No. of bitstreams: 0 Previous issue date: 2010-12-09Bitstream added on 2014-06-13T20:47:43Z : No. of bitstreams: 1 cobra_tt_me_rcla.pdf: 485593 bytes, checksum: 107d36859b5a9c932411b3a54094c4ac (MD5)<br>O principal objetivo deste trabalho é apresentar conceitos básicos sobre coincidências e pontos fixos de aplicações contínuas usando como ferramentas os Lemas Combinatórios de Sperner e grau de aplicações. Apresentamos também um cálculo do número de Lefschetz de f; g : T2 ¡! T3, onde Th denota uma superfície de genus h, através da fórmul
APA, Harvard, Vancouver, ISO, and other styles
10

Cobra, Thiago Taglialatela. "Sobre coincidências e pontos fixos de aplicações /." Rio Claro : [s.n.], 2010. http://hdl.handle.net/11449/94372.

Full text
Abstract:
Orientador: Alice Kimie Miwa Libardi<br>Banca: Edson de Oliveira<br>Banca: Thiago de Melo<br>Resumo: O principal objetivo deste trabalho é apresentar conceitos básicos sobre coincidências e pontos fixos de aplicações contínuas usando como ferramentas os Lemas Combinatórios de Sperner e grau de aplicações. Apresentamos também um cálculo do número de Lefschetz de f; g : T2 ¡! T3, onde Th denota uma superfície de genus h, através da fórmula dada por Gonçalves e Oliveira em [3]<br>Abstract: The main goal of this work is present basic concepts on coincidences and fixed points of continuous maps wit
APA, Harvard, Vancouver, ISO, and other styles
11

Schacht, Mathias. "Regular partitions of hypergraphs and property testing." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2010. http://dx.doi.org/10.18452/13975.

Full text
Abstract:
Die Regularitätsmethode für Graphen wurde vor über 30 Jahren von Szemerédi, für den Beweis seines Dichteresultates über Teilmengen der natürlichen Zahlen, welche keine arithmetischen Progressionen enthalten, entwickelt. Grob gesprochen besagt das Regularitätslemma, dass die Knotenmenge eines beliebigen Graphen in konstant viele Klassen so zerlegt werden kann, dass fast alle induzierten bipartiten Graphen quasi-zufällig sind, d.h. sie verhalten sich wie zufällige bipartite Graphen mit derselben Dichte. Das Regularitätslemma hatte viele weitere Anwendungen, vor allem in der extremalen Gr
APA, Harvard, Vancouver, ISO, and other styles
12

Grunert, Sandro. "Itô’s Lemma." Universitätsbibliothek Chemnitz, 2009. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200900979.

Full text
Abstract:
Itô’s Lemma Ausarbeitung im Rahmen des Seminars "Finanzmathematik", SS 2009 Die Arbeiten des japanischen Mathematikers Kiyosi Itô aus den 1940er Jahren bilden heute die Grundlage der Theorie stochastischer Integration und stochastischer Differentialgleichungen. Die Ausarbeitung beschäftigt sich mit Itô's Kalkül, in dem zunächst das Itô-Integral bezüglich diverser Integratoren bereitgestellt wird, um sich anschließend mit Itô's Lemma bzw. der Itô-Formel als grundlegendes Hilfsmittel stochastischer Integration zu widmen. Am Ende wird ein kurzer Ausblick auf das Black-Scholes-Modell für zeits
APA, Harvard, Vancouver, ISO, and other styles
13

Fredriksson, Henrik. "Wiener's lemma." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-27270.

Full text
Abstract:
In this thesis we study Wiener’s lemma. The classical version of the lemma, whose realm is a Banach algebra, asserts that the pointwise inverse of a nonzero function with absolutely convergent Fourier expansion, also possesses an absolutely convergent Fourier expansion. The main purpose of this thesis is to investigate the validity inalgebras endowed with a quasi-norm or a p-norm.As a warmup, we prove the classical version of Wiener’s lemma using elemen-tary analysis. Furthermore, we establish results in Banach algebras concerning spectral theory, maximal ideals and multiplicative linear funct
APA, Harvard, Vancouver, ISO, and other styles
14

Person, Yury. "Quasi-random hypergraphs and extremal problems for hypergraphs." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2010. http://dx.doi.org/10.18452/16238.

Full text
Abstract:
In dieser Arbeit wird zuerst das Theorem von Chung, Graham und Wilson über quasi-zufällige Graphen zur sogenannten schwachen Quasi-Zufälligkeit für k-uniforme Hypergraphen verallgemeinert und somit eine Reihe äquivalenter Eigenschaften bestimmt. Basierend auf diesen Resultaten werden nichtbipartite Graphen gefunden, welche die Quasi-Zufälligkeit für Graphen ``forcieren''''. Zuvor waren nur bipartite Graphen mit dieser Eigenschaft bekannt. Desweiteren ist ein konzeptionell einfacher Algorithmus zum Verifizieren nicht erfüllbarer zufälliger k-SAT Formeln angegeben. Dann richtet sich der Fok
APA, Harvard, Vancouver, ISO, and other styles
15

Shlapunov, A., and Nikolai Tarkhanov. "Formal Poincaré lemma." Universität Potsdam, 2007. http://opus.kobv.de/ubp/volltexte/2009/3023/.

Full text
Abstract:
We show how the multiple application of the formal Cauchy-Kovalevskaya theorem leads to the main result of the formal theory of overdetermined systems of partial differential equations. Namely, any sufficiently regular system Au = f with smooth coefficients on an open set U ⊂ Rn admits a solution in smooth sections of a bundle of formal power series, provided that f satisfies a compatibility condition in U.
APA, Harvard, Vancouver, ISO, and other styles
16

Zorin, Evgeniy. "Lemmes de zéros et relations fonctionnelles." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2009. http://tel.archives-ouvertes.fr/tel-00558073.

Full text
Abstract:
La thèse est consacrée aux estimations de multiplicité. Ce type de résultats est utilisé en théorie de la transcendance. A partir des travaux de A. B. Shidlovskii, W.D.Brownawell et D.W.Masser il sont régulièrement utilisés dans les preuves de transcendance et surtout d'indépendance algébrique. Par exemple, la démonstration du lemme de multiplicité est un élément très important de la preuve par Yu. Nesterenko du résultat sur l'indépendance algébrique des valeurs des fonctions de Ramanujan. Un autre résultat de ce type est une preuve par K.Nishioka d'une conjecture de K.Mahler. Ce lemme de mult
APA, Harvard, Vancouver, ISO, and other styles
17

Zorin, Evgeniy. "Lemmes de zéros et relations fonctionnelles." Paris 6, 2010. http://www.theses.fr/2010PA066350.

Full text
Abstract:
La thèse est consacrée aux estimations de multiplicité. Ce type de résultats est utilisé en théorie de la transcendance. A partir des travaux de A. B. Shidlovskii, W. D. Brownawell et D. W. Masser il sont régulièrement utilisés dans les preuves de transcendance et surtout d'indépendance algébrique. Par exemple, la démonstration du lemme de multiplicité est un élément très important de la preuve par Yu. Nesterenko du résultat sur l'indépendance algébrique des valeurs des fonctions de Ramanujan. Un autre résultat de ce type est une preuve par K. Nishioka d'une conjecture de K. Mahler. Ce lemme d
APA, Harvard, Vancouver, ISO, and other styles
18

Hyde, Andrea. "Intersective polynomials and Hensel's Lemma." Thesis, University of British Columbia, 2014. http://hdl.handle.net/2429/46574.

Full text
Abstract:
An intersective polynomial is a polynomial with integer coefficients that has no rational roots, but has a root modulo every integer greater than 1. These polynomials have been difficult to find using traditional methods. In this thesis, we employ elementary methods, namely Hensel’s Lemma and the Chinese remainder theorem, to allow us to create three new infinite families of intersective polynomials. In order to create a candidate intersective polynomial, we employ methods from Galois theory. We multiply together carefully chosen polynomials that define subfields of a splitting field to creat
APA, Harvard, Vancouver, ISO, and other styles
19

Hedman, Jonas. "2-Categories and Yoneda lemma." Thesis, Uppsala universitet, Algebra och geometri, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-312810.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Strasser, Helmut. "On a Lemma of Schachermayr." SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 1997. http://epub.wu.ac.at/1794/1/document.pdf.

Full text
Abstract:
In this paper we prove a topological lemma on real valued random variables which implies the basic ingredients for the proof of the Fundamental Theorem of Asset Pricing in the two period case. In particular, previous results of Stricker and of Schachermayer are special cases of our result. Our proof is considerably shorter and more transparent than previous proofs of related special cases.<br>Series: Working Papers SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
APA, Harvard, Vancouver, ISO, and other styles
21

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:
APA, Harvard, Vancouver, ISO, and other styles
22

Jörder, Clemens [Verfasser], and Stefan [Akademischer Betreuer] Kebekus. "On the Poincaré Lemma for reflexive differential forms = Über das Poincaré-Lemma für reflexive Differentialformen." Freiburg : Universität, 2014. http://d-nb.info/1123479313/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Azhari, Abdelhak. "Methodes analytiques pour les lemmes de zeros." Paris 6, 1988. http://www.theses.fr/1988PA066033.

Full text
Abstract:
L'etude analytique et effective des hypersurfaces algebriques, fondee sur les recents theoremes d'existence sur les fibres vectoriels holomorphes, aboutit a une extension aux situations multi-homogenes des minorations des plus petits degres de ces hypersurfaces (lemmes de multiplicites. Elle permet d'autre part, d'analyser et clarifier la principale conjecture de chudnovsky
APA, Harvard, Vancouver, ISO, and other styles
24

Azhari, Abdelhak. "Méthodes analytiques pour les lemmes de zéros." Grenoble 2 : ANRT, 1988. http://catalogue.bnf.fr/ark:/12148/cb37611442v.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Cavalcanti, Gil R. "New aspects if the ddc-lemma." Thesis, University of Oxford, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.409710.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

DINIZ, Diego Araújo. "Tópicos de Dinâmica Hiperbólica." Universidade Federal do Maranhão, 2017. http://tedebc.ufma.br:8080/jspui/handle/tede/1663.

Full text
Abstract:
Submitted by Daniella Santos (daniella.santos@ufma.br) on 2017-06-22T12:57:55Z No. of bitstreams: 1 Diego Araújo.pdf: 749439 bytes, checksum: e6b630a6b28df216e5e6fc70dbeead61 (MD5)<br>Made available in DSpace on 2017-06-22T12:57:55Z (GMT). No. of bitstreams: 1 Diego Araújo.pdf: 749439 bytes, checksum: e6b630a6b28df216e5e6fc70dbeead61 (MD5) Previous issue date: 2017-05-02<br>The main goal of this work is to discuss some topics about hyperbolic dynamical systems. We collect results and definitions that are dispersed, or even in works of generalized context. Thus, we propose a tour that begins
APA, Harvard, Vancouver, ISO, and other styles
27

Vena, Cros Lluís. "The Removal Lemma: algebraic versions and applications." Doctoral thesis, Universitat Politècnica de Catalunya, 2012. http://hdl.handle.net/10803/132098.

Full text
Abstract:
This thesis presents some contributions in additive combinatorics and arithmetic Ramsey theory. More specifically, it deals with the interaction between combinatorics, number theory and additive combinatorics. This area saw a great improvement with the Szemerédi Regularity Lemma and some of the results that followed. The Regularity Lemma and its consequences have become a widely used tool in graph theory, combinatorics and number theory. Furthermore, its language and point of view has deeply changed the face of additive number theory, a fact universally acknowledged by the Abel award given to
APA, Harvard, Vancouver, ISO, and other styles
28

Hellström, Lars. "The Diamond Lemma for Power Series Algebras." Doctoral thesis, Umeå University, Mathematics and Mathematical Statistics, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-92.

Full text
Abstract:
<p>The main result in this thesis is the generalisation of Bergman's diamond lemma for ring theory to power series rings. This generalisation makes it possible to treat problems in which there arise infinite descending chains. Several results in the literature are shown to be special cases of this diamond lemma and examples are given of interesting problems which could not previously be treated. One of these examples provides a general construction of a normed skew field in which a custom commutation relation holds.</p><p>There is also a general result on the structure of totally ordered semig
APA, Harvard, Vancouver, ISO, and other styles
29

Ge, Wenfeng. "Gröbner Bases Theory and The Diamond Lemma." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2951.

Full text
Abstract:
Commutative Gröbner bases theory is well known and widely used. In this thesis, we will discuss thoroughly its generalization to noncommutative polynomial ring <em>k</em><<em>X</em>> which is also an associative free algebra. We introduce some results on monomial orders due to John Lawrence and the author. We show that a noncommutative monomial order is a well order while a one-sided noncommutative monomial order may not be. Then we discuss the generalization of polynomial reductions, S-polynomials and the characterizations of noncommutative Gröbner bases. Some results due to Mora
APA, Harvard, Vancouver, ISO, and other styles
30

Brits, Jeanetta Hendrina. "Outomatiese Setswana lemma-identifisering / Jeanetta Hendrina Brits." Thesis, North-West University, 2006. http://hdl.handle.net/10394/1160.

Full text
Abstract:
Within the context of natural language processing, a lemmatiser is one of the most important core technology modules that has to be developed for a particular language. A lemmatiser reduces words in a corpus to the corresponding lemmas of the words in the lexicon. A lemma is defined as the meaningful base form from which other more complex forms (i.e. variants) are derived. Before a lemmatiser can be developed for a specific language, the concept "lemma" as it applies to that specific language should first be defined clearly. This study concludes that, in Setswana, only stems (and not roots) c
APA, Harvard, Vancouver, ISO, and other styles
31

Turgeon, Maxime. "A relative fundamental lemma for U (4)." Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=121414.

Full text
Abstract:
In (HLR86), Harder et al. presented a proof of the Tate conjecture, an important conjecture in the field of arithmetic geometry, for the non-CM part of the cohomology of Hilbert modular surfaces. In this thesis, we present a general strategy for a study of the Tate conjecture for some unitary Shimura varieties. As in the work cited above, we do this by studying the notion of distinction. Distinction on a unitary group is related to distinction on a general linear group through a comparison of relative trace formulas. In the latter setting, work of Jacquet and his collaborators has led to simpl
APA, Harvard, Vancouver, ISO, and other styles
32

Haeupler, Bernhard. "Deterministic algorithms for the Lovász Local Lemma." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/60165.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.<br>Includes bibliographical references (p. 34-36).<br>The Lovász Local Lemma [6] (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that depend on it. It is often used in combination with the probabilistic method for non-constructive existence proofs. A prominent application is to k-CNF formulas, where LLL implies that, if eve
APA, Harvard, Vancouver, ISO, and other styles
33

Rosas, Rudy. "A lemma on limits of analytic sets." Pontificia Universidad Católica del Perú, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/95130.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Cogliati, Joshua Joseph. "Visualizing the pumping lemma for regular languages." Thesis, Montana State University, 2004. http://etd.lib.montana.edu/etd/2004/cogliati/CogliatiJ0805.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Peterson, Elisha. "Combinatorial Proofs of Generalizations of Sperner's Lemma." Scholarship @ Claremont, 2000. https://scholarship.claremont.edu/hmc_theses/124.

Full text
Abstract:
In this thesis, we provide constructive proofs of serveral generalizations of Sperner's Lemma, a combinatorial result which is equivalent to the Brouwer Fixed Point Theorem. This lemma makes a statement about the number of a certain type of simplices in the triangulation of a simplex with a special labeling. We prove generalizations for polytopes with simplicial facets, for arbitrary 3-polytopes, and for polygons. We introduce a labeled graph which we call a nerve graph to prove these results. We also suggest a possible non-constructive proof for a polytopal generalization.
APA, Harvard, Vancouver, ISO, and other styles
36

Sondjaja, Mutiara. "Sperner's Lemma Implies Kakutani's Fixed Point Theorem." Scholarship @ Claremont, 2008. https://scholarship.claremont.edu/hmc_theses/214.

Full text
Abstract:
Kakutani’s fixed point theorem has many applications in economics and game theory. One of its most well known applications is in John Nash’s paper [8], where the theorem is used to prove the existence of an equilibrium strategy in n-person games. Sperner’s lemma, on the other hand, is a combinatorial result concerning the labelling of the vertices of simplices and their triangulations. It is known that Sperner’s lemma is equivalent to a result called Brouwer’s fixed point theorem, of which Kakutani’s theorem is a generalization. A natural question that arises is whether we can prove Kakutani’s
APA, Harvard, Vancouver, ISO, and other styles
37

Bond, Brittany M. "Networks or lemons?" Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/118007.

Full text
Abstract:
Thesis: S.M. in Management Research, Massachusetts Institute of Technology, Sloan School of Management, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 22-24).<br>Past research has argued that hiring personnel use employment as a signal of worker quality. If firms tend to keep high ability workers, then those who are not employed will tend to be "lemons," labor market leftovers who are of uncertain quality. To the extent that employers rely on employment as a signal, then well-qualified, but out-of-work job seekers will be stigmatized simply by bein
APA, Harvard, Vancouver, ISO, and other styles
38

Stagni, Henrique. "Teste de propriedades em torneios." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21072015-112930/.

Full text
Abstract:
Teste de propriedades em grafos consiste no estudo de algoritmos aleatórios sublineares que determinam se um grafo $G$ de entrada com $n$ vértices satisfaz uma dada propriedade ou se é necessário adicionar ou remover mais do que $\\epsilon{n \\choose 2}$ arestas para fazer $G$ satisfazê-la, para algum parâmetro $\\epsilon$ de erro fixo. Uma propriedade de grafos $P$ é dita testável se, para todo $\\epsilon > 0$, existe um tal algoritmo para $P$ cujo tempo de execução é independente de $n$. Um dos resultados de maior importância nesta área, provado por Alon e Shapira, afirma que toda propriedad
APA, Harvard, Vancouver, ISO, and other styles
39

Terenzi, Gloria. "Lemma di Schwarz e la sua interpretazione geometrica." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13543/.

Full text
Abstract:
Il tema centrale di questa tesi, suddivisa in tre capitoli, è il Lemma di Schwarz e la sua applicazione nella geometria iperbolica. Il lemma di Schwarz, che prende il nome da Hermann Amandus Shchwarz, descrive una proprietà delle funzioni olomorfe. Nel primo capitolo enuncio il Lemma di Schwarz e la sua versione infinitesimale. Descrivo le mappe conformi del dominio per poi applicare il lemma di Pick che è una forma particolare del lemma di Schwarz.Nel secondo capitolo introduco brevemente la geometria euclidea con i cinque postulati di Euclide, per poi passare a descrivere la geometria iperbo
APA, Harvard, Vancouver, ISO, and other styles
40

Hägglund, Jonas. "Szémeredi's regularity lemma and its applications in combinatorics." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-51333.

Full text
Abstract:
Szemerédi’s regularity lemma is a deep result in graph theory with applications in many different areas of mathematics. The lemma says that any graph can be approximated by the union of a bounded num- ber of random-like bipartite graphs and this can be used to extract the underlying structure of the graph. Recently it has been shown that there exists polynomial time algorithms that can make this ap- proximation. This survey gives a proof of the regularity lemma, shows some applications and discusses some algorithmic aspects.
APA, Harvard, Vancouver, ISO, and other styles
41

Van, Vleck Erik S. "Random and numerical aspects of the shadowing lemma." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/29357.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Song, Fei. "Practical and theoretical applications of the Regularity Lemma." Digital WPI, 2013. https://digitalcommons.wpi.edu/etd-dissertations/144.

Full text
Abstract:
The Regularity Lemma of Szemeredi is a fundamental tool in extremal graph theory with a wide range of applications in theoretical computer science. Partly as a recognition of his work on the Regularity Lemma, Endre Szemeredi has won the Abel Prize in 2012 for his outstanding achievement. In this thesis we present both practical and theoretical applications of the Regularity Lemma. The practical applications are concerning the important problem of data clustering, the theoretical applications are concerning the monochromatic vertex partition problem. In spite of its numerous applications to est
APA, Harvard, Vancouver, ISO, and other styles
43

Gomes, Bernardo Paschoarelli Veiga. "Sobre o closing lemma de classe C^r." Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-02022007-133405/.

Full text
Abstract:
Neste trabalho reunimos alguns resultados afirmativos relacionados ao closing lemma de classe C^r em variedades bidimensionais compactas.<br>In this work we present some partial results corcerning closing lemma for smooth flows on compact bidimensional manifolds.
APA, Harvard, Vancouver, ISO, and other styles
44

Betto, Maria Fernanda Petri. "Dynamic markets for lemons." reponame:Repositório Institucional do FGV, 2017. http://hdl.handle.net/10438/18328.

Full text
Abstract:
Submitted by Maria Fernanda Petri Betto (betto.maria@gmail.com) on 2017-06-12T12:51:35Z No. of bitstreams: 1 v2 (2).pdf: 374191 bytes, checksum: e2354b420b3a4a3b8d297fd77a276555 (MD5)<br>Rejected by Suzinei Teles Garcia Garcia (suzinei.garcia@fgv.br), reason: Maria Fernanda, Por favor, seguir as normas, letras, capa, contra-capa, folha de assinaturas, em caixa alta o agradecimento, abstract e resumo, descer mais seu nome. Por gentileza, verifique um modelo de dissertação/tese dos colegas (Ex.:Mateus Dias, Ilaria, etc.) Letras - somente Arial / Times New Roman Att. Suzi 3799-7876
APA, Harvard, Vancouver, ISO, and other styles
45

Villemot, Pierre. "Lemmes de zéros et distribution des valeurs des fonctions méromorphes." Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAM059/document.

Full text
Abstract:
Cette thèse porte sur des propriétés arithmétiques des fonctions méromorphes et transcendantes d'une variable. Dans le chapitre 3, nous définissons des mesures de transcendance pour les fonctions holomorphes et méromorphes sur un domaine régulier de C puis nous majorons ces mesures en fonction de la distribution des petites valeurs de la fonction étudiée.Grâce aux théories de Nevanlinna et d'Ahlfors, nous étudions dans le chapitre 4 la distribution des petites valeurs de certaines classes de fonctions méromorphes sur D ou C afin d'obtenir pour celles-ci des majorations explicites de leurs mesu
APA, Harvard, Vancouver, ISO, and other styles
46

Bacca, Salvatore. "Il lemma di Schwarz e la distanza di Kobayashi." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13823/.

Full text
Abstract:
Questa tesi è un approccio elementare alla teoria geometrica delle funzioni, campo che ebbe inizio con i lavori di Poincarè sulla geometria del disco. Affronteremo dapprima il Lemma di Schwarz ed alcune sue generalizzazioni che metteranno in correlazione il risultato analitico di tale asserto con il suo aspetto geometrico-differenziale. Introdurremo poi una distanza invariante su varietà complesse, la distanza di Kobayashi, e tramite questa dimostreremo i teoremi di Picard riguardanti il range dell'immagine di funzioni olomorfe sul piano complesso o su un dominio avente una singolarità isolata
APA, Harvard, Vancouver, ISO, and other styles
47

Lloyd, Simon Trevor. "Cr closing lemma results for flows on the torus." Thesis, University of Warwick, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.443968.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Jannel, Romaric. "La philosophie de Yamauchi Tokuryū (1890-1982) : genèse et desseins d’une pensée d’inspiration bouddhique au XXe siècle." Thesis, Université Paris sciences et lettres, 2020. http://www.theses.fr/2020UPSLP038.

Full text
Abstract:
Cette thèse constitue la première étude jamais réalisée sur la philosophie de Yamauchi Tokuryū (1890-1982). La démarche de ce philosophe japonais est remarquable en ce qu’il chercha à proposer un dépassement englobant de ce qu’il nomme, d’une part, la « logique du logos » – qui figurait déjà chez Aristote et se structure autour des principes d’identité, de contradiction et du tiers exclu – et, d’autre part, la « logique du lemme » – méthode d’appréhension intuitionnelle des étants qui, née en Inde, serait d’inspiration essentiellement bouddhique. Notre propos est construit autour de l’analyse
APA, Harvard, Vancouver, ISO, and other styles
49

Pires, Benito Frazão. "Estabilidade assintótica e estrutural de campos vetoriais." Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-02022007-093739/.

Full text
Abstract:
O objetivo deste trabalho é provar um Closing Lema Parcial para variedades bidimensionais compactas, orientáveis ou não--orientáveis. Para enunciá--lo, considere um campo vetorial \\linebreak $X\\in\\mathfrak^r(M)$, $r\\ge 2$, de classe $C^r$ em uma variedade bidimensional compacta $M$, e seja $\\Sigma$ um segmento transversal a $X$ passando por um ponto recorrente não--trivial $p$ de $X$. Seja $P:\\Sigma\\to\\Sigma$ a correspondente transformação de primeiro retorno. O primeiro resultado deste trabalho consiste em mostrar que se $P$ tem a propriedade de que para todo $n\\ge N$ e $x\\in{m dom}
APA, Harvard, Vancouver, ISO, and other styles
50

Tonon, Gustavo. "Avaliação de lagoas de lemnas para o polimento de esgoto doméstico." reponame:Repositório Institucional da UFSC, 2016. https://repositorio.ufsc.br/xmlui/handle/123456789/171996.

Full text
Abstract:
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia Ambiental, Florianópolis, 2016.<br>Made available in DSpace on 2016-12-27T03:10:22Z (GMT). No. of bitstreams: 1 342309.pdf: 3166093 bytes, checksum: 6edb8a6d809a38896e02a1909b518896 (MD5) Previous issue date: 2016<br>As lagoas de lemnas têm sido utilizadas com sucesso para o polimento de efluentes nos últimos anos, destacando a grande capacidade de remoção de nutrientes, e a produção de biomassa passível de valorização. O presente estudo objetivou avaliar esta tecnolog
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!

To the bibliography