Log in

Relevant bibliographies by topics / Lemmas

Contents

Dissertations / Theses

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Dissertations / Theses on the topic "Lemmas"

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

More sources

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!