Conecte-se

Bibliografias temáticas / Geometrie combinatorie / Teses / dissertações

Siga este link para ver outros tipos de publicações sobre o tema: Geometrie combinatorie.

Teses / dissertações sobre o tema "Geometrie combinatorie"

Autor: Grafiati

Publicado: 4 de junho de 2021

Última modificação: 28 de julho de 2025

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Geometrie combinatorie".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.

1

Lange, Carsten. "Combinatorial curvatures, group actions, and colourings: aspects of topological combinatorics." [S.l.] : [s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=973473487.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Milicevic, Luka. "Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/273375.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Yoon, Young-jin. "Characterizations of Some Combinatorial Geometries." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc277894/.

Texto completo da fonte

Resumo:

We give several characterizations of partition lattices and projective geometries. Most of these characterizations use characteristic polynomials. A geometry is non—splitting if it cannot be expressed as the union of two of its proper flats. A geometry G is upper homogeneous if for all k, k = 1, 2, ... , r(G), and for every pair x, y of flats of rank k, the contraction G/x is isomorphic to the contraction G/y. Given a signed graph, we define a corresponding signed—graphic geometry. We give a characterization of supersolvable signed graphs. Finally, we give the following characterization of non

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Salaün, Isabelle. "Deux problèmes de géométrie combinatoire : unimodalité de deux suites en théorie des matroïdes ; polyèdres : polyèdre régulier à vingt-quatre sommets de l'espace euclidien à quatre dimensions." Paris 6, 1988. http://www.theses.fr/1988PA066524.

Texto completo da fonte

Resumo:

On considère la suite des nombres de fermes de rang fixe (nombres de Whitney) et la suite des nombres d'indépendants de cardinal fixe d'un matroide. On obtient des résultats partiels concernant l'unimodalité conjecturée de ces suites (1972). On traite de matroides orientés. On étudie les polyèdres réguliers dans les espaces euclidiens a trois et quatre dimensions. On montre, en particulier, que le polyèdre régulier à vingt-quatre sommets de l'espace à quatre dimensions n'a qu'une classe d'orientations.

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Philippe, Eva. "Geometric realizations using regular subdivisions : construction of many polytopes, sweep polytopes, s-permutahedra." Electronic Thesis or Diss., Sorbonne université, 2024. http://www.theses.fr/2024SORUS079.

Texto completo da fonte

Resumo:

Cette thèse concerne trois problèmes de réalisations géométriques de structures combinatoires par des polytopes et des subdivisions polyédrales. Un polytope est l'enveloppe convexe d'un ensemble fini de points dans un espace euclidien R^d. Il est muni d'une structure combinatoire donnée par ses faces. Une subdivision est une collection de polytopes dont les faces s'intersectent correctement et dont l'union est convexe. Elle est régulière si elle peut être obtenue en prenant les faces inférieures d'un relèvement de ses sommets dans une dimension de plus.Nous présentons d'abord une nouvelle cons

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Borenstein, Evan. "Additive stucture, rich lines, and exponential set-expansion." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29664.

Texto completo da fonte

Resumo:

Thesis (Ph.D)--Mathematics, Georgia Institute of Technology, 2009.<br>Committee Chair: Croot, Ernie; Committee Member: Costello, Kevin; Committee Member: Lyall, Neil; Committee Member: Tetali, Prasad; Committee Member: Yu, XingXing. Part of the SMARTech Electronic Thesis and Dissertation Collection.

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Hipp, James W. (James William) 1956. "The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors." Thesis, University of North Texas, 1989. https://digital.library.unt.edu/ark:/67531/metadc330849/.

Texto completo da fonte

Resumo:

We show that the maximum size of a geometry of rank n excluding the (q + 2)-point line, the 3-wheel W_3, and the 3-whirl W^3 as minor is (n - 1)q + 1, and geometries of maximum size are parallel connections of (q + 1)-point lines. We show that the maximum size of a geometry of rank n excluding the 5-point line, the 4-wheel W_4, and the 4-whirl W^4 as minors is 6n - 5, for n ≥ 3. Examples of geometries having rank n and size 6n - 5 include parallel connections of the geometries V_19 and PG(2,3).

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Bus, Norbert. "The use of geometric structures in graphics and optimization." Thesis, Paris Est, 2015. http://www.theses.fr/2015PESC1117/document.

Texto completo da fonte

Resumo:

Les données du monde réel ont manifestement une composante géométrique importante et suggère les patterns géométriques signifiants. Les méthodes qui utilisent la nature géométrique des données sont activement développés dans plusieurs domaines scientifiques, comme, par exemple, la géométrie algorithmique, la géométrie discrète, la synthèse d'images, la vision par ordinateur. Dans le travail présent, nous utilisons les structures géométriques afin de modéliser des algorithmes efficaces pour deux domaines, celui de synthèse d'images et de l'optimisation combinatoire. Dans la première partie il s

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Jambu, Michel. "Arrangements d'hyperplans : topologie, geometrie et combinatoire." Nantes, 1989. http://www.theses.fr/1989NANT2040.

Texto completo da fonte

Resumo:

La plupart des proprietes topologiques du complement d'une famille finie d'hyperplans de c#n sont codees dans le treillis des intersections de ces hyperplans: la cohomologie de ce complement est decrite a l'aide des circuits brises: les treillis associes aux arrangements de type fibre sont hyperresolubles et l'algebre d'holonomie de lie du complement admet une factorisation comme espace vectoriel, definie par une chaine maximale modulaire ce qui permet de donner une demonstration tres simple de la propriete lcs

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Ahlman, Ove. "Combinatorial geometries in model theory." Thesis, Uppsala University, Department of Mathematics, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-112523.

Texto completo da fonte

Resumo:

<p>Model theory and combinatorial pregeometries are closely related throughthe so called algebraic closure operator on strongly minimal sets. Thestudy of projective and ane pregeometries are especially interestingsince they have a close relation to vectorspaces. In this thesis we willsee how the relationship occur and how model theory can concludea very strong classi cation theorem which divides pregeometries withcertain properties into projective, ane and degenerate (trivial) cases.</p><br><p>Modellteori är ett ämne som är starkt relaterat till studien av kombinatoriska pregeometrier, detta g

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Paolini, Giovanni. "Topology and combinatorics of affine reflection arrangements." Doctoral thesis, Scuola Normale Superiore, 2019. http://hdl.handle.net/11384/85743.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Kanade, Gaurav Nandkumar. "Combinatorial optimization problems in geometric settings." Diss., University of Iowa, 2011. https://ir.uiowa.edu/etd/1152.

Texto completo da fonte

Resumo:

We consider several combinatorial optimization problems in a geometric set- ting. The first problem we consider is the problem of clustering to minimize the sum of radii. Given a positive integer k and a set of points with interpoint distances that satisfy the definition of being a "metric", we define a ball centered at some input point and having some radius as the set of all input points that are at a distance smaller than the radius of the ball from its center. We want to cover all input points using at most k balls so that the sum of the radii of the balls chosen is minimized. We show that

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Yu, Jianming. "Kombinatorische Geometrie der Stokesregionen." Bonn : [s.n.], 1990. http://catalog.hathitrust.org/api/volumes/oclc/23006551.html.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Li, Shiyue. "Tropical Derivation of Cohomology Ring of Heavy/Light Hassett Spaces." Scholarship @ Claremont, 2017. http://scholarship.claremont.edu/hmc_theses/104.

Texto completo da fonte

Resumo:

The cohomology of moduli spaces of curves has been extensively studied in classical algebraic geometry. The emergent field of tropical geometry gives new views and combinatorial tools for treating these classical problems. In particular, we study the cohomology of heavy/light Hassett spaces, moduli spaces of heavy/light weighted stable curves, denoted as $\calm_{g, w}$ for a particular genus $g$ and a weight vector $w \in (0, 1]^n$ using tropical geometry. We survey and build on the work of \citet{Cavalieri2014}, which proved that tropical compactification is a \textit{wonderful} compactificat

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Dissett, Luis Armando. "Combinatorial and computational aspects of finite geometries." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ49844.pdf.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Richardson, Ross Monet. "Combinatorial and geometric problems on point processes." Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2007. http://wwwlib.umi.com/cr/ucsd/fullcit?p3274518.

Texto completo da fonte

Resumo:

Thesis (Ph. D.)--University of California, San Diego, 2007.<br>Title from first page of PDF file (viewed October 4, 2007). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 103-110).

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Gruslys, Vytautas. "Tilings and other combinatorial results." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/271311.

Texto completo da fonte

Resumo:

In this dissertation we treat three tiling problems and three problems in combinatorial geometry, extremal graph theory and sparse Ramsey theory. We first consider tilings of $\mathbb{Z}^n$. In this setting a tile $T$ is just a finite subset of $\mathbb{Z}^n$. We say that $T$ tiles $\mathbb{Z}^n$ if the latter set admits a partition into isometric copies of $T$. Chalcraft observed that there exist $T$ that do not tile $\mathbb{Z}^n$ but tile $\mathbb{Z}^{d}$ for some $d > n$. He conjectured that such $d$ exists for any given tile. We prove this conjecture in Chapter 2. In Chapter 3 we prove a

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

Disarlo, Valentina. "Combinatorial methods in Teichmüller theory." Doctoral thesis, Scuola Normale Superiore, 2013. http://hdl.handle.net/11384/85687.

Texto completo da fonte

Resumo:

In this thesis we deal with combinatorial and geometric properties of arc complexes and triangulation graphs, and we will provide some applications to the study of the mapping class group and to the Teichmüller theory of a bordered surface. The thesis is divided into two parts. In the former we deal with the problem of combinatorial rigidity of arc complexes. In the latter we study some large-scale properties of the arc complex and the 1-skeleton of its dual, the so-called ideal triangulation graph.

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Jartoux, Bruno. "On combinatorial approximation algorithms in geometry." Thesis, Paris Est, 2018. http://www.theses.fr/2018PESC1078/document.

Texto completo da fonte

Resumo:

L'analyse des techniques d'approximation est centrale en géométrie algorithmique, pour des raisons pratiques comme théoriques. Dans cette thèse nous traitons de l'échantillonnage des structures géométriques et des algorithmes d'approximation géométriques en optimisation combinatoire. La première partie est consacrée à la combinatoire des hypergraphes. Nous débutons par les problèmes de packing, dont des extensions d'un lemme de Haussler, particulièrement le lemme dit de Shallow packing, pour lequel nous donnons aussi un minorant optimal, conjecturé mais pas établi dans les travaux antérieurs.

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

Lomonosov, Andrew. "Graph and combinatorial algorithms for geometric constraint solving." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0001060.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

Polettini, Matteo <1982&gt. "Geometric and Combinatorial Aspects of NonEquilibrium Statistical Mechanics." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amsdottorato.unibo.it/4305/1/polettini_matteo_tesi.pdf.

Texto completo da fonte

Resumo:

Non-Equilibrium Statistical Mechanics is a broad subject. Grossly speaking, it deals with systems which have not yet relaxed to an equilibrium state, or else with systems which are in a steady non-equilibrium state, or with more general situations. They are characterized by external forcing and internal fluxes, resulting in a net production of entropy which quantifies dissipation and the extent by which, by the Second Law of Thermodynamics, time-reversal invariance is broken. In this thesis we discuss some of the mathematical structures involved with generic discrete-state-space non-equilibriu

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

Polettini, Matteo <1982&gt. "Geometric and Combinatorial Aspects of NonEquilibrium Statistical Mechanics." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amsdottorato.unibo.it/4305/.

Texto completo da fonte

Resumo:

Non-Equilibrium Statistical Mechanics is a broad subject. Grossly speaking, it deals with systems which have not yet relaxed to an equilibrium state, or else with systems which are in a steady non-equilibrium state, or with more general situations. They are characterized by external forcing and internal fluxes, resulting in a net production of entropy which quantifies dissipation and the extent by which, by the Second Law of Thermodynamics, time-reversal invariance is broken. In this thesis we discuss some of the mathematical structures involved with generic discrete-state-space non-equilibriu

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Berglund, Alexander. "Minimal models in algebra, combinatorics and topology /." Stockholm : Department of Mathematics, Stockholm University, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-7676.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Fennessey, Eric James. "Some applications of geometric techniques in combinatorial group theory." Thesis, University of Glasgow, 1989. http://theses.gla.ac.uk/6159/.

Texto completo da fonte

Resumo:

Combinatorial group theory abounds with geometrical techniques. In this thesis we apply some of them to three distinct areas. In Chapter 1 we present all of the techniques and background material neccessary to read chapters 2,3,4. We begin by defining complexes with involutary edges and define coverings of these. We then discuss equivalences between complexes and use these in §§1.3 and 1.4 to give a way (the level method) of simplifying complexes and an application of this method (Theorem 1.3). We then discuss star-complexes of complexes. Next we present background material on diagrams and pic

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Couto, Marcelo Castilho. "Um algoritmo exato para um problema de Galeria de Arte." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275782.

Texto completo da fonte

Resumo:

Orientadores: Cid Carvalho de Souza, Pedro Jussieu de Rezende<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-17T02:29:56Z (GMT). No. of bitstreams: 1 Couto_MarceloCastilho_M.pdf: 3682547 bytes, checksum: 899151df78f8e6950ce90ea8215ded91 (MD5) Previous issue date: 2010<br>Resumo: Nesta dissertação, faz-se um amplo estudo multidisciplinar sobre duas variantes de um problema geométrico NP-DIFÍCIL, o Problema da Galeria de Arte, que é analisado tanto pela ótica geométrica quanto combinatória. O objetivo consiste em mi

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

Cid, Ruiz Yairon. "Blow-up algebras in Algebra, Geometry and Combinatorics." Doctoral thesis, Universitat de Barcelona, 2019. http://hdl.handle.net/10803/667768.

Texto completo da fonte

Resumo:

The primary topic of this thesis lies at the crossroads of Commutative Algebra and its interactions with Algebraic Geometry and Combinatorics. It is mainly focused around the following themes: 1) Defining equations of blow-up algebras; 2) Study of rational maps via blow-up algebras; and 3) Asymptotic properties of the powers of edge ideals of graphs. We are primarily interested in questions that arise in geometrical or combinatorial contexts and try to understand how their possible answers manifest in various algebraic structures or invariants. There is a particular algebraic object, the Rees

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Grove, Colin Michael. "A combinatorial approach to the Cabling Conjecture." Diss., University of Iowa, 2016. https://ir.uiowa.edu/etd/3091.

Texto completo da fonte

Resumo:

Dehn surgery and the notion of reducible manifolds are both important tools in the study of 3-manifolds. The Cabling Conjecture of Francisco González-Acuña and Hamish Short describes the purported circumstances under which Dehn surgery can produce a reducible manifold. This thesis extends the work of James Allen Hoffman, who proved the Cabling Conjecture for knots of bridge number up to four. Hoffman built upon the combinatorial machinery used by Cameron Gordon and John Luecke in their solution to the knot complement problem. The combinatorial approach starts with the graphs of intersection of

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Schemde, Arndt von. "Index and stability in bimatrix games : a geometric-combinatorial approach /." Berlin [u.a.] : Springer, 2005. http://www.loc.gov/catdir/toc/fy0614/2005929878.html.

Texto completo da fonte

Resumo:

School of Economics and Political Science, Diss.--London, 2005.<br>Literaturverz. S. [143] - 145. The work originates from the author's PhD thesis at the London School of Economics and Political Science. (Preface).

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

Latham, Richard Samuel. "Combinatorial algorithms for the analysis and satisfaction of geometric constraints." Thesis, Brunel University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.336642.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Trovati, Marcello. "Some combinatorial properties of geometric packings induced by piecewise isometries." Thesis, University of Exeter, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.438346.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Bavuma, Yanga. "Some combinatorial aspects in algebraic topology and geometric group theory." Master's thesis, University of Cape Town, 2018. http://hdl.handle.net/11427/29763.

Texto completo da fonte

Resumo:

The present Msc thesis deals with classical topics of topology and it has been written, referring to [C. Kosniowski, Introduction to Algebraic Topology, Cambridge University Press, 1980, Cambridge], which is a well known textbook of algebraic topology. It has been selected a list of main exercises from this reference, whose solutions were not directly available, or subject to differerent methods. In fact combinatorial methods have been preferred and the result is a self-contained dissertation on the theory of the fundamental group and of the coverings. Finally, there are some recent problems i

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Hart, Derrick. "Explorations of geometric combinatorics in vector spaces over finite fields." Diss., Columbia, Mo. : University of Missouri-Columbia, 2008. http://hdl.handle.net/10355/5585.

Texto completo da fonte

Resumo:

Thesis (Ph. D.)--University of Missouri-Columbia, 2008.<br>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 8, 2009) Vita. Includes bibliographical references.

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

Caldato, Patricia. "O uso da geometria do táxi no ensino de análise combinatória /." São José do Rio Preto, 2013. http://hdl.handle.net/11449/127545.

Texto completo da fonte

Resumo:

Orientador: Michelle Ferreira Zanchetta Morgado<br>Banca: Évelin Meneguesso Barbaresco<br>Banca: Renato José de Moura<br>Resumo: Este trabalho apresenta uma sequência de atividades voltadas ao ensino de Análise Combinatória utilizando a Geometria do Táxi, que é uma geometria capaz de modelar as trajetórias, dos cidadãos e dos veículos que se deslocam entre quarteirões, ao longo dos eixos de ruas e avenidas. Estas atividades foram aplicadas a um grupo de alunos do Ensino Médio, tendo como recurso didático um jogo e usando como metodologia a Resolução de Problemas. A intenção foi proporcionar au

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

Lund, Benjamin. "Some Results in Discrete Geometry." University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1342463167.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

Yiu, Siu-ming. "Tight bound edge guard results on art gallery problems /." Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B18037276.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Chang, Teng-Wen. "Geometric typed feature structures : toward design space exploration /." Title page, contents and abstract only, 1999. http://web4.library.adelaide.edu.au/theses/09PH/09phc4569.pdf.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

von, Schemde Arndt. "A geometric-combinatorial approach to index and stability in bimatrix games." Thesis, London School of Economics and Political Science (University of London), 2004. http://etheses.lse.ac.uk/127/.

Texto completo da fonte

Resumo:

This thesis provides a new geometric-combinatorial construction to characterise the Nash equilibria of a non-degenerate bimatrix game and their indices. Considering a non-degenerate m x n bimatrix game, the construction yields an (m — 1)-simplex X^ that is simplicially divided into (m — l)-simplices, reflecting the best reply structure of player II. Each (m — 1)-simplex in the triangulation is divided into best reply regions of player I. This yields a division of XA into regions with labels 1,..., m. In this representation, the Nash equilibria are represented by completely labelled points, and

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

Nieman, Jeremy. "Symmetries, colorings, and polyanumeration /." Online version of thesis, 2007. http://hdl.handle.net/1850/5966.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

Brandt, Aléx Fernando 1990. "Algoritmos exatos para problemas de dilatação mínima em grafos geométricos." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275536.

Texto completo da fonte

Resumo:

Orientadores: Cid Carvalho de Souza, Pedro Jussieu de Rezende<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-26T19:27:17Z (GMT). No. of bitstreams: 1 Brandt_AlexFernando_M.pdf: 1939918 bytes, checksum: c6d9d34f314830d07dc1e49ad43ab514 (MD5) Previous issue date: 2014<br>Resumo: Seja P um conjunto de pontos no plano. O grafo geométrico de P, G(P) = (P, E), é o grafo ponderado completo cujos vértices correspondem aos pontos de P e no qual o custo de uma aresta {i, j} é dado pela distância Euclidiana entre os pontos i

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Lionni, Luca. "Colored discrete spaces : Higher dimensional combinatorial maps and quantum gravity." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLS270/document.

Texto completo da fonte

Resumo:

On considère, en deux dimensions, une version euclidienne discrète de l’action d’Einstein-Hilbert, qui décrit la gravité en l’absence de matière. À l’intégration sur les géométries se substitue une sommation sur des surfaces triangulées aléatoires. Dans la limite physique de faible gravité, seules les triangulations planaires survivent. Leur limite en distribution, la carte brownienne, est une surface fractale continue dont l’importance dans le contexte de la gravité quantique en deux dimensions a été récemment précisée. Cet espace est interprété comme un espace-temps quantique, obtenu comme l

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Mastropaulo, Neto Vicente 1969. "Combinatória e probabilidade com aplicações no ensino de geometria." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306097.

Texto completo da fonte

Resumo:

Orientador: Antônio Carlos do Patrocinio<br>Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica<br>Made available in DSpace on 2018-08-25T09:32:43Z (GMT). No. of bitstreams: 1 MastropauloNeto_Vicente_M.pdf: 1971257 bytes, checksum: 1c78e3e9085d370b2a40221cbcfe39a5 (MD5) Previous issue date: 2014<br>Resumo: Este trabalho aborda o tema Combinatória e Probabilidade com aplicações no ensino de Geometria e tem como objetivo principal servir de apoio aos professores de Matemática da escola básica, fornecendo sugestões

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Bergbauer, Christoph [Verfasser]. "Combinatorial and geometric aspects of Feynman graphs and Feynman integrals / Christoph Bergbauer." Berlin : Freie Universität Berlin, 2009. http://d-nb.info/1023665786/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Pariente, Cesar Alberto Bravo. "Um método probabilístico em combinatória." Universidade de São Paulo, 1996. http://www.teses.usp.br/teses/disponiveis/45/45132/tde-07052010-163719/.

Texto completo da fonte

Resumo:

O presente trabalho é um esforço de apresentar, organizado em forma de survey, um conjunto de resultados que ilustram a aplicação de um certo método probabilístico. Embora não apresentemos resultados novos na área, acreditamos que a apresentação sistemática destes resultados pode servir para a compreensão de uma ferramenta útil para quem usa dos métodos probabilísticos na sua pesquisa em combinatória. Os resultados de que falaremos tem aparecido na última década na literatura especializada e foram usados na investigação de problemas que resitiram a outras aproximações mais clássicas. Em vez

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Mustafa, Nabil. "Approximations of Points: Combinatorics and Algorithms." Habilitation à diriger des recherches, Université Paris-Est, 2013. http://tel.archives-ouvertes.fr/tel-01062825.

Texto completo da fonte

Resumo:

At the core of successful manipulation and computation over large geometric data is the notion of approximation, both structural and computational. The focus of this thesis will be on the combinatorial and algorithmic aspects of approximations of point-set data P in d-dimensional Euclidean space. It starts with a study of geometric data depth where the goal is to compute a point which is the 'combinatorial center' of P. Over the past 50 years several such measures of combinatorial centers have been proposed, and we will re-examine several of them: Tukey depth, Simplicial depth, Oja depth and R

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Amirkhanyan, Gagik M. "Problems in combinatorial number theory." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51865.

Texto completo da fonte

Resumo:

The dissertation consists of two parts. The first part is devoted to results in Discrepancy Theory. We consider geometric discrepancy in higher dimensions (d > 2) and obtain estimates in Exponential Orlicz Spaces. We establish a series of dichotomy-type results for the discrepancy function which state that if the L¹ norm of the discrepancy function is too small (smaller than the conjectural bound), then the discrepancy function has to be very large in some other function space.The second part of the thesis is devoted to results in Additive Combinatorics. For a set with small doubling an order-

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Caldato, Patrícia [UNESP]. "O uso da Geometria do Táxi no ensino de Análise Combinatória." Universidade Estadual Paulista (UNESP), 2013. http://hdl.handle.net/11449/127545.

Texto completo da fonte

Resumo:

Made available in DSpace on 2015-09-17T15:24:08Z (GMT). No. of bitstreams: 0 Previous issue date: 2013-08-13. Added 1 bitstream(s) on 2015-09-17T15:48:23Z : No. of bitstreams: 1 000846659.pdf: 263878 bytes, checksum: 594979ca4ad458c27d2f2ff121025ca7 (MD5)<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)<br>Este trabalho apresenta uma sequência de atividades voltadas ao ensino de Análise Combinatória utilizando a Geometria do Táxi, que é uma geometria capaz de modelar as trajetórias, dos cidadãos e dos veículos que se deslocam entre quarteirões, ao longo dos eixos de rua

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

姚兆明 and Siu-ming Yiu. "Tight bound edge guard results on art gallery problems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31236418.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Tozoni, Davi Colli 1988. "Solving the art gallery problem = a practical and robust method for optimal point guard positioning = Resolução do problema da galeria de arte: um método prático e robusto para o posicionamento ótimo de guardas-ponto." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275523.

Texto completo da fonte

Resumo:

Orientadores: Cid Carvalho de Souza, Pedro Jussieu de Rezende<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-25T16:57:43Z (GMT). No. of bitstreams: 1 Tozoni_DaviColli_M.pdf: 4212278 bytes, checksum: afb91e202a72e28729ff14334901884f (MD5) Previous issue date: 2014<br>Resumo: Nesta dissertação, apresentamos nossa pesquisa sobre o Problema da Galeria de Arte (AGP), um dos problemas mais estudados em Geometria Computacional. O AGP, que é um problema NP-difícil, consiste em encontrar o número mínimo de guardas suficien

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Crepaldi, Bruno Espinosa 1991. "Um algoritmo eficiente para o problema do posicionamento natural de antenas." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275534.

Texto completo da fonte

Resumo:

Orientadores: Cid Carvalho de Souza, Pedro Jussieu de Rezende<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-26T19:18:58Z (GMT). No. of bitstreams: 1 Crepaldi_BrunoEspinosa_M.pdf: 13275684 bytes, checksum: aa236e6a56dd7ed5507276017c51b8fb (MD5) Previous issue date: 2014<br>Resumo: Considerado uma variação do problema da galeria de arte, o problema do posicionamento de antenas trata do posicionamento do menor número de antenas requerido para determinar se uma pessoa está dentro ou fora da galeria. Uma antena propag

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Miltzow, Tillmann [Verfasser]. "Geometric and Combinatorial Problems of Matching and Partitioning in Theoretical Computer Science / Tillmann Miltzow." Berlin : Freie Universität Berlin, 2015. http://d-nb.info/1074870913/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!