Zaloguj się

Gotowe bibliografie tematyczne / Combinatorics / Rozprawy doktorskie

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Combinatorics.

Rozprawy doktorskie na temat „Combinatorics”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 25 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Combinatorics”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.

1

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Lopes, Martins Taísa. "Theory of combinatorial limits and extremal combinatorics." Thesis, University of Warwick, 2018. http://wrap.warwick.ac.uk/113462/.

Pełny tekst źródła

Streszczenie:

In the past years, techniques from different areas of mathematics have been successfully applied in extremal combinatorics problems. Examples include applications of number theory, geometry and group theory in Ramsey theory and analytical methods to different problems in extremal combinatorics. By providing an analytic point of view of many discrete problems, the theory of combinatorial limits led to substantial results in many areas of mathematics and computer science, in particular in extremal combinatorics. In this thesis, we explore the connection between combinatorial limits and extremal

Style APA, Harvard, Vancouver, ISO itp.

3

Yue, Guangyi. "Combinatorics of affine Springer fibers and combinatorial wall-crossing." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/126939.

Pełny tekst źródła

Streszczenie:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, May, 2020<br>Cataloged from the official PDF of thesis.<br>Includes bibliographical references (pages 149-152).<br>This thesis deals with several combinatorial problems in representation theory. The first part of the thesis studies the combinatorics of affine Springer fibers of type A. In particular, we give an explicit description of irreducible components of Fl[subscript tS] and calculate the relative positions between two components. We also study the lowest two-sided Kazhdan-Lusztig cell and establish a conne

Style APA, Harvard, Vancouver, ISO itp.

4

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Engström, Alexander. "Topological Combinatorics." Doctoral thesis, KTH, Matematik (Inst.), 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-10383.

Pełny tekst źródła

Streszczenie:

This thesis on Topological Combinatorics contains 7 papers. All of them but paper Bare published before.In paper A we prove that!i dim ˜Hi(Ind(G);Q) ! |Ind(G[D])| for any graph G andits independence complex Ind(G), under the condition that G\D is a forest. We then use acorrespondence between the ground states with i+1 fermions of a supersymmetric latticemodel on G and ˜Hi(Ind(G);Q) to deal with some questions from theoretical physics.In paper B we generalize the topological Tverberg theorem. Call a graph on the samevertex set as a (d + 1)(q − 1)-simplex a (d, q)-Tverberg graph if for any map f

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

7

PINTO, RONALD COUTINHO. "INTRODUCTION TO COMBINATORICS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2014. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=24231@1.

Pełny tekst źródła

Streszczenie:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>Este trabalho possui o intuito de desmistificar a dificuldade encontrada por professores e alunos no ensino e aprendizagem do tópico análise combinatória. A razão que motivou este trabalho foi o fato de que boa parte dos professores de matemática do ensino médio e últimas séries do ensino fundamental consideram a Análise Combinatória como algo complicado de ser ensinado; além da questão das dificuldades de entendimento por parte dos alunos que são induzidos à memorização de fórmulas e a aplicação das mesmas à resolução dos exercícios para c

Style APA, Harvard, Vancouver, ISO itp.

8

Brunk, Fiona. "Intersection problems in combinatorics." Thesis, St Andrews, 2009. http://hdl.handle.net/10023/765.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Redelmeier, Daniel. "Hyperpfaffians in Algebraic Combinatorics." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/1055.

Pełny tekst źródła

Streszczenie:

The pfaffian is a classical tool which can be regarded as a generalization of the determinant. The hyperpfaffian, which was introduced by Barvinok, generalizes the pfaffian to higher dimension. This was further developed by Luque, Thibon and Abdesselam. There are several non-equivalent definitions for the hyperpfaffian, which are discussed in the introduction of this thesis. Following this we examine the extension of the Matrix-Tree theorem to the Hyperpfaffian-Cactus theorem by Abdesselam, proving it without the use of the Grassman-Berezin Calculus and with the new terminology o

Style APA, Harvard, Vancouver, ISO itp.

10

Sanders, Tom. "Topics in arithmetic combinatorics." Thesis, University of Cambridge, 2007. https://www.repository.cam.ac.uk/handle/1810/236994.

Pełny tekst źródła

Streszczenie:

This thesis is chiefly concerned with a classical conjecture of Littlewood's regarding the L¹-norm of the Fourier transform, and the closely related idem-potent theorem. The vast majority of the results regarding these problems are, in some sense, qualitative or at the very least infinitary and it has become increasingly apparent that a quantitative state of affairs is desirable. Broadly speaking, the first part of the thesis develops three new tools for tackling the problems above: We prove a new structural theorem for the spectrum of functions in A(G); we extend the notion of local Fourier a

Style APA, Harvard, Vancouver, ISO itp.

11

Green, B. "Topics in arithmetic combinatorics." Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.599660.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Mrazović, Rudi. "Topics in additive combinatorics." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:50d30d34-5b44-40f2-bb1a-98c2d81e6fe3.

Pełny tekst źródła

Streszczenie:

This thesis deals with four problems in additive combinatorics. After giving a brief introduction to the field and overview of the results in Chapter 1, in Chapter 2 we consider the problem of finding the clique number of the Cayley graph on &Fopf;<sub>2</sub><sup>n</sup> generated by a random subset. We prove a number of results, most notably that for n in a set of density 1, the clique number is concentrated on a single value. In Chapter 3 we prove that a randomly chosen subset of a finite group is a randomness extractor with high probability. More precisely, we prove that for every fixed &d

Style APA, Harvard, Vancouver, ISO itp.

13

Konvalinka, Matjaž. "Combinatorics of determinantal identities." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/43790.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2008.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Includes bibliographical references (p. 125-129).<br>In this thesis, we apply combinatorial means for proving and generalizing classical determinantal identities. In Chapter 1, we present some historical background and discuss the algebraic framework we employ throughout the thesis. In Chapter 2, we construct a fundamental bijection between certain monomials th

Style APA, Harvard, Vancouver, ISO itp.

14

Zhang, Yan Ph D. Massachusetts Institute of Technology. "The combinatorics of adinkras." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/84404.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Department of Mathematics, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 67-69).<br>Adinkras are graphical tools created to study representations of supersymmetry algebras. Besides having inherent interest for physicists, the study of adinkras has already shown nontrivial connections with coding theory and Clifford algebras. Furthermore, adinkras offer many easy-to-state and accessible mathematical problems of algebraic, combinatorial, and computational nature. In this work, we make a self-co

Style APA, Harvard, Vancouver, ISO itp.

15

Mainetti, Matteo 1970. "Studies in projective combinatorics." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47426.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Lam, Thomas F. (Thomas Fun Yau). "Combinatorics of ribbon tableaux." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/31166.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.<br>Includes bibliographical references (p. 83-86).<br>This thesis begins with the study of a class of symmetric functions ... Which are generating functions for ribbon tableaux (hereon called ribbon functions), first defined by Lascoux, Leclerc and Thibon. Following work of Fomin and Greene, I introduce a set of operators called ribbon Schur operators on the space of partitions. I develop the theory of ribbon functions using these operators in an elementary manner. In particular, I deduce their symmetry and rec

Style APA, Harvard, Vancouver, ISO itp.

17

Fiz, Pontiveros Gonzalo. "Topics in additive combinatorics." Thesis, University of Cambridge, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608001.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Volec, Jan. "Analytic methods in combinatorics." Thesis, University of Warwick, 2014. http://wrap.warwick.ac.uk/71063/.

Pełny tekst źródła

Streszczenie:

In the thesis, we apply the methods from the recently emerged theory of limits of discrete structures to problems in extremal combinatorics. The main tool we use is the framework of ag algebras developed by Razborov. We determine the minimum threshold d that guarantees a 3-uniform hypergraph to contain four vertices which span at least three edges, if every linear-size subhypergraph of the hypergraph has density more than d. We prove that the threshold value d is equal to 1=4. The extremal configuration corresponds to the set of cyclically oriented triangles in a random orientation of a comple

Style APA, Harvard, Vancouver, ISO itp.

19

Manners, Frederick. "Topics in additive combinatorics." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:96cd6439-ab33-41b5-be55-0aa5e8aad105.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Carroll, Christina C. "Enumerative combinatorics of posets." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22659.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Mathematics, Georgia Institute of Technology, 2008.<br>Committee Chair: Tetali, Prasad; Committee Member: Duke, Richard; Committee Member: Heitsch, Christine; Committee Member: Randall, Dana; Committee Member: Trotter, William T.

Style APA, Harvard, Vancouver, ISO itp.

21

Johnson, Darin. "Topics in probabilistic combinatorics /." Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1879010731&sid=18&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Southern Illinois University Carbondale, 2009.<br>"Department of Mathematics." Keywords: Kneser graphs, Probabilistic method, Random graphs, Rook numbers, Probabilistic combinatorics. Includes bibliographical references (p. 57-60). Also available online.

Style APA, Harvard, Vancouver, ISO itp.

22

Johnson, Darin Bryant. "Topics In Probabilistic Combinatorics." OpenSIUC, 2009. https://opensiuc.lib.siu.edu/dissertations/63.

Pełny tekst źródła

Streszczenie:

This paper is a compilation of results in combinatorics utilizing the probabilistic method. Below is a brief description of the results highlighted in each chapter. Chapter 1 provides basic definitions, lemmas, and theorems from graph theory, asymptotic analysis, and probability which will be used throughout the paper. Chapter 2 introduces the independent domination number. It is then shown that in the random graph model G(n,p) with probability tending to one, the independent domination number is one of two values. Also, the the number of independent dominating sets of given cardinality is ana

Style APA, Harvard, Vancouver, ISO itp.

23

Kim, Paul. "Rationalization of Combinatorial Design in Architecture for Microhousing." University of Cincinnati / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1491316065691636.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Carlier, Louis. "Objective combinatorics through decomposition spaces." Doctoral thesis, Universitat Autònoma de Barcelona, 2019. http://hdl.handle.net/10803/667374.

Pełny tekst źródła

Streszczenie:

Aquesta tesi proveeix construccions generals en el context d'espais de descomposici, generalitzant els resultats clàssics de la combinatòria al context homotòpic. Això requereix desenvolupar eines generals en la teoria d'espais de descomposició i noves perspectives, que siguin d'interès general, independentment de les aplicacions a la combinatòria. Al primer capítol, resumim la teoria de l'homotopia i la combinatòria de la 2-categoria de grupoides. Continuem amb una revisió de les nocions necessàries de la teoria de categories d'ordre infinit. A continuació, resumim la teoria dels espais de d

Style APA, Harvard, Vancouver, ISO itp.

25

Larsson, David. "Combinatorics on Brauer-type semigroups." Thesis, Uppsala University, Department of Mathematics, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-121366.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Hilton, Jacob Haim. "Combinatorics of countable ordinal topologies." Thesis, University of Leeds, 2016. http://etheses.whiterose.ac.uk/13608/.

Pełny tekst źródła

Streszczenie:

We study combinatorial properties of ordinals under the order topology, focusing on the subspaces, partition properties and autohomeomorphism groups of countable ordinals. Our main results concern topological partition relations. Let n be a positive integer, let κ be a cardinal, and write [X] n for the set of subsets of X of size n. Given an ordinal β and ordinals αi for all i ∈ κ, write β →top (αi) n i∈κ to mean that for every function c : [β] n → κ (a colouring) there is some subspace X ⊆ β and some i ∈ κ such that X is homeomorphic to αi and [X] n ⊆ c −1 ({i}). We examine the cases n = 1 an

Style APA, Harvard, Vancouver, ISO itp.

27

Fiorini, Samuel. "Polyhedral combinatorics of order polytopes." Doctoral thesis, Universite Libre de Bruxelles, 2001. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211629.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Garner, David P. R. "Combinatorics and gauge-string duality." Thesis, Queen Mary, University of London, 2015. http://qmro.qmul.ac.uk/xmlui/handle/123456789/8939.

Pełny tekst źródła

Streszczenie:

This thesis exhibits a range of applications of combinatoric methods to string theory. The concepts and techniques used in the counting of ribbon graphs, the theory of finite groups, and the construction of cell complexes can give powerful methods and interesting insights into the nature of gauge-string duality, the limits of CFT factorisation, and the topology of worldsheet moduli space. The first part presents a candidate space-time theory of the Belyi string with a holographic extension to three-dimensional Euclidean gravity. This is a model of gauge-string duality in which the correlators

Style APA, Harvard, Vancouver, ISO itp.

29

Tenner, Bridget Eileen. "The combinatorics of reduced decompositions." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34617.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.<br>Includes bibliographical references (p. 85-88) and index.<br>This thesis examines several aspects of reduced decompositions in finite Coxeter groups. Effort is primarily concentrated on the symmetric group, although some discussions are subsequently expanded to finite Coxeter groups of types B and D. In the symmetric group, the combined frameworks of permutation patterns and reduced decompositions are used to prove a new characterization of vexillary permutations. This characterization and the methods used y

Style APA, Harvard, Vancouver, ISO itp.

30

Sam, Steven V. "Free resolutions, combinatorics, and geometry." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/73178.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2012.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student submitted PDF version of thesis.<br>Includes bibliographical references (p. 71-72).<br>Boij-Söderberg theory is the study of two cones: the first is the cone of graded Betti tables over a polynomial ring, and the second is the cone of cohomology tables of coherent sheaves over projective space. Each cone has a triangulation induced from a

Style APA, Harvard, Vancouver, ISO itp.

31

Ziegler, Günter M. (Günter Matthias). "Algebraic combinatorics of hyperplane arrangements." Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14854.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Jeffers, Jason Adam. "Combinatorics and seifert knot invariants." Thesis, University of Cambridge, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620418.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Baber, R. "Some results in extremal combinatorics." Thesis, University College London (University of London), 2011. http://discovery.ucl.ac.uk/1306175/.

Pełny tekst źródła

Streszczenie:

In Chapter 1 we determine the minimal density of triangles in a tripartite graph with prescribed edge densities. This extends work of Bondy, Shen, Thomassé and Thomassen characterizing those edge densities guaranteeing the existence of a triangle in a tripartite graph. We also determine those edge densities guaranteeing a copy of a triangle or C5 in a tripartite graph. In Chapter 2 we describe Razborov's flag algebra method and apply this to Erdös' jumping hypergraph problem to find the first non-trivial regions of jumps. We also use Razborov's method to prove five new sharp Turan densities, b

Style APA, Harvard, Vancouver, ISO itp.

34

Bloom, Thomas F. "Quantitative results in arithmetic combinatorics." Thesis, University of Bristol, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.678687.

Pełny tekst źródła

Streszczenie:

In this thesis we study the generalisation of Roth's theorem on three term arithmetic progressions to arbitrary discrete abelian groups and translation invariant linear equations. We prove a new structural result concerning sets of large Fourier coefficients and use this to prove new quantitative bounds on the size of finite sets which contain only trivial solutions to a given translation invariant linear equation. In particular, we obtain a quantitative improvement for Roth's theorem on three term arithmetic progressions and its analogue over lFq[t], the ring of polynomials in t with coeffici

Style APA, Harvard, Vancouver, ISO itp.

35

Jenssen, Matthew. "Continuous optimisation in extremal combinatorics." Thesis, London School of Economics and Political Science (University of London), 2017. http://etheses.lse.ac.uk/3572/.

Pełny tekst źródła

Streszczenie:

In this thesis we explore instances in which tools from continuous optimisation can be used to solve problems in extremal graph and hypergraph theory. We begin by introducing a generalised notion of hypergraph Lagrangian and use tools from the theory of nonlinear optimisation to explore some of its properties. As an application we find the Tur´an density of a small family of hypergraphs. We determine the exact k-colour Ramsey number of an odd cycle on n vertices when n is large. This resolves a conjecture of Bondy and Erd˝os for large n. The first step of our proof is to use the regularity met

Style APA, Harvard, Vancouver, ISO itp.

36

David, Stefan. "Extremal combinatorics and universal algorithms." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/278254.

Pełny tekst źródła

Streszczenie:

In this dissertation we solve several combinatorial problems in different areas of mathematics: automata theory, combinatorics of partially ordered sets and extremal combinatorics. Firstly, we focus on some new automata that do not seem to have occurred much in the literature, that of solvability of mazes. For our model, a maze is a countable strongly connected digraph together with a proper colouring of its edges (without two edges leaving a vertex getting the same colour) and two special vertices: the origin and the destination. A pointer or robot starts in the origin of a maze and moves nat

Style APA, Harvard, Vancouver, ISO itp.

37

Woodcock, David J. "Schur algebras, combinatorics, and cohomology." Thesis, University of Warwick, 1991. http://wrap.warwick.ac.uk/108093/.

Pełny tekst źródła

Streszczenie:

Let G = GLn(k), the group of all invertible n x n matrices over an infinite field k. In this thesis we explore the cohomological relationship between a Schur algebra S(G) for G and the subalgebra S(B) corresponding to a Borel subgroup B of G. Our main motivation is the question of whether there is an analogue of the Kempf Vanishing Theorem in this setting. We place our study in a more general framework, defining subalgebras S(Ω,Г) of S(G) associated with certain intersections of parabolic subgroups of G, and investigate the connection between S(Ω,Г) and the subalgebra S(S(Ω,Ø). We define modul

Style APA, Harvard, Vancouver, ISO itp.

38

Nemati, Navid. "Syzygies : algebra, combinatorics and geometry." Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUS284.

Pełny tekst źródła

Streszczenie:

La régularité de Castelnuovo-Mumford est l'un des principaux invariants numériques permettant de mesurer la complexité de la structure des modules gradués de type fini sur des anneaux polynomiaux. Il mesure le degré maximal des générateurs des modules de syzygies. Dans cette thèse, nous étudions la régularité de Castelnuovo-Mumford avec différents points de vue et, dans certaines parties, nous nous concentrons principalement sur les syzygies linéaires. Dans le chapitre 2, nous étudions la régularité des homologies de Koszul et des cycles de Koszul de quotients unidimensionnels. Dans le chapitr

Style APA, Harvard, Vancouver, ISO itp.

39

Ahmed, Maya. "Algebraic combinatorics of magic squares /." For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2004. http://uclibs.org/PID/11984.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Saigo, Hayato. "From Combinatorics to Noncommutative Probability." 京都大学 (Kyoto University), 2011. http://hdl.handle.net/2433/142351.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Han, Bin. "Gamma positivity in enumerative combinatorics." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1115/document.

Pełny tekst źródła

Streszczenie:

La positivité gamma d’une suite combinatoire unifie à la fois l’unimodalité et la symétrie de cette suite. Trouver des nouvelles familles d’objets dont les polynômes énumératives ont une positivité gamma est un défi et un sujet important en combinatoire et géométrie. Il a attiré beaucoup d’attention ces derniers temps en raison de la conjecture de Gal, qui affirme que le gamma-vecteur a des coefficients positifs pour n’importe quel polytope simple. Souvent, le h-polynôme pour les polytopes simpliciaux de signification combinatoire peut être donné en tant que fonction génératrice sur un ensembl

Style APA, Harvard, Vancouver, ISO itp.

42

Brignall, Robert. "Simplicity in relational structures and its application to permutation classes." Thesis, St Andrews, 2007. http://hdl.handle.net/10023/431.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Spiegel, Christoph. "Additive structures and randomness in combinatorics." Doctoral thesis, Universitat Politècnica de Catalunya, 2020. http://hdl.handle.net/10803/669327.

Pełny tekst źródła

Streszczenie:

Arithmetic Combinatorics, Combinatorial Number Theory, Structural Additive Theory and Additive Number Theory are just some of the terms used to describe the vast field that sits at the intersection of Number Theory and Combinatorics and which will be the focus of this thesis. Its contents are divided into two main parts, each containing several thematically related results. The first part deals with the question under what circumstances solutions to arbitrary linear systems of equations usually occur in combinatorial structures..The properties we will be interested in studying in this part

Style APA, Harvard, Vancouver, ISO itp.

44

Eriksen, Niklas. "Combinatorics of genome rearrangements and phylogeny." Licentiate thesis, KTH, Mathematics, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-1499.

Pełny tekst źródła

Streszczenie:

<p>This thesis deals with combinatorial problems taken frombioinformatics. In particular, we study the problem ofinferring distances between bacterial species by looking attheir respective gene orders. We regard one of the gene ordersas a permutation of the other. Given a set of valid operations,we seek the most parsimonious way to sort this permutation. Wealso look at the more complex problem of combining a set ofspecies into a phylogenetic tree, which shows the relationshipsbetween all species.The computer program Derange II by Blanchette andSanko® uses a greedy algorithm to estimate theevol

Style APA, Harvard, Vancouver, ISO itp.

45

Modan, Laurentiu. "TO TEACH COMBINATORICS, USING SELECTED PROBLEMS." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-80681.

Pełny tekst źródła

Streszczenie:

In 1972, professor Grigore Moisil, the most famous Romanian academician for Mathematics, said about Combinatorics, that it is “an opportunity of a renewed gladness”, because “each problem in the domain asks for its solving, an expenditure without any economy of the human intelligence”. More, the research methods, used in Combinatorics, are different from a problem to the other! This is the explanation for the existence of my actual paper, in which I propose to teach Combinatorics, using selected problems. MS classification: 05A05, 97D50.

Style APA, Harvard, Vancouver, ISO itp.

46

Sjöstrand, Jonas. "Enumerative combinatorics related to partition shapes." Doctoral thesis, KTH, Matematik (Inst.), 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4298.

Pełny tekst źródła

Streszczenie:

This thesis deals with enumerative combinatorics applied to three different objects related to partition shapes, namely tableaux, restricted words, and Bruhat intervals. The main scientific contributions are the following. Paper I: Let the sign of a standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. A conjecture by Richard Stanley says that the sum of the signs of all SYTs with n squares is 2^[n/2]. We prove a generalisation of this conjecture using the Robinson-Schensted correspondence and a new concept called chess tableaux

Style APA, Harvard, Vancouver, ISO itp.

47

Samieinia, Shiva. "Digital Geometry, Combinatorics, and Discrete Optimization." Doctoral thesis, Stockholms universitet, Matematiska institutionen, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-47399.

Pełny tekst źródła

Streszczenie:

This thesis consists of two parts: digital geometry and discrete optimization. In the first part we study the structure of digital straight line segments. We also study digital curves from a combinatorial point of view. In Paper I we study the straightness in the 8-connected plane and in the Khalimsky plane by considering vertical distances and unions of two segments. We show that we can investigate the straightness of Khalimsky arcs by using our knowledge from the 8-connected plane. In Paper II we determine the number of Khalimsky-continuous functions with 2, 3 and 4 points in their codomain.

Style APA, Harvard, Vancouver, ISO itp.

48

Saevarsson, Freyr. "Combinatorics in Pattern-Based Graphical Passwords." Thesis, KTH, Matematik (Inst.), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-102004.

Pełny tekst źródła

Streszczenie:

Because of increased computing power it is necessary for modern passwords to be very long and complex, this makes them hard to remember. Research show that it might be easier for people to remember visual passwords instead of textual ones. The goal of this project was to find a safe graphical password scheme which does not require any modification on the server side. A proposed solution is called the Abagram which is a system that transforms patterns on a grid into textual passwords. The main idea behind the scheme is to assign each cell in the grid a letter or a symbol. The users select some

Style APA, Harvard, Vancouver, ISO itp.

49

Tateno, Atsushi. "Problems in finite and infinite combinatorics." Thesis, University of Oxford, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504612.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Bandlow, Jason. "Combinatorics of Macdonald polynomials and extensions." 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?p3259066.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!