Log in

Relevant bibliographies by topics / Enumeraton / Dissertations / Theses

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

Dissertations / Theses on the topic 'Enumeraton'

Author: Grafiati

Published: 25 May 2024

Last updated: 31 July 2025

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

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

Blackburn, Simon R. "Group enumeration." Thesis, University of Oxford, 1992. http://ora.ox.ac.uk/objects/uuid:caac5ed0-44e3-4bec-a97e-59e11ea268af.

Full text

Abstract:

The thesis centres around two problems in the enumeration of p-groups. Define f<sub>φ</sub>(p<sup>m</sup>) to be the number of (isomorphism classes of) groups of order p<sup>m</sup> in an isoclinism class φ. We give bounds for this function as φ is fixed and m varies and as m is fixed and φ varies. In the course of obtaining these bounds, we prove the following result. We say a group is reduced if it has no non-trivial abelian direct factors. Then the rank of the centre Z(P) and the rank of the derived factor group P|P' of a reduced p-group P are bounded in terms of the orders of P|Z(P)P' and

APA, Harvard, Vancouver, ISO, and other styles

2

Mishna, Marni. "Cayley graph enumeration." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ51422.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Shoilekova, Bilyana Todorova. "Graphical enumeration methods." Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526538.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hannah, Stuart A. "Interval order enumeration." Thesis, University of Strathclyde, 2015. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=26137.

Full text

Abstract:

This thesis continues the study of interval orders and related structures, containing results on both the labeled and unlabeled variants. Following a result of Eriksen and Sjöstrand (2014) we identify a link between structures following the Fishburn distribution and Mahonian structures. This is used to detail a technique for the construction of Fishburn structures (structures in bijection with unlabeled interval orders) from appropriate Mahonian structures. This technique is introduced on a bivincular pattern of Bousquet-Mélou et al. (2010) and then used to introduce a previously unconsidere

APA, Harvard, Vancouver, ISO, and other styles

5

Edeson, Margaret, and n/a. "Investigations in coset enumeration." University of Canberra. Information Sciences & Engineering, 1989. http://erl.canberra.edu.au./public/adt-AUC20050712.083514.

Full text

Abstract:

The process of coset enumeration has become a significant factor in group theoretical investigations since the advent of modern computing power, but in some respects the process is still not well understood. This thesis investigates some features of coset enumeration, working mainly with the group F(2,7). Chapter 1 describes the characteristics of coset enumeration and algorithms used for it. A worked example of the method is provided. Chapter 2 discusses some features which would be desirable in computer programs for use in investigating the coset enumeration process itself, and reviews the

APA, Harvard, Vancouver, ISO, and other styles

6

Ocansey, Evans Doe. "Enumeration problems on lattices." Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/80393.

Full text

Abstract:

Thesis (MSc)--Stellenbosch University, 2013.<br>ENGLISH ABSTRACT: The main objective of our study is enumerating spanning trees (G) and perfect matchings PM(G) on graphs G and lattices L. We demonstrate two methods of enumerating spanning trees of any connected graph, namely the matrix-tree theorem and as a special value of the Tutte polynomial T(G; x; y). We present a general method for counting spanning trees on lattices in d 2 dimensions. In particular we apply this method on the following regular lattices with d = 2: rectangular, triangular, honeycomb, kagomé, diced, 9 3 lattic

APA, Harvard, Vancouver, ISO, and other styles

7

Meier, Arne [Verfasser]. "Parametrised enumeration / Arne Meier." Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2020. http://d-nb.info/1206685859/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ramos, Garrido Lander. "Graph enumeration and random graphs." Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/405943.

Full text

Abstract:

In this thesis we use analytic combinatorics to deal with two related problems: graph enumeration and random graphs from constrained classes of graphs. We are interested in drawing a general picture of some graph families by determining, first, how many elements are there of a given possible size (graph enumeration), and secondly, what is the typical behaviour of an element of fixed size chosen uniformly at random, when the size tends to infinity (random graphs). The problems concern graphs subject to global conditions, such as being planar and/or with restrictions on the degrees of the verti

APA, Harvard, Vancouver, ISO, and other styles

9

Postnikov, Alexander. "Enumeration in algebra and geometry." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42693.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Egebrand, August. "Feynman Diagrams and Map Enumeration." Thesis, Uppsala universitet, Teoretisk fysik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-298474.

Full text

Abstract:

The goal of this thesis is to count how many graphs exist given a number of verticesor some other restrictions. The graphs are counted by perturbing Gaussian integralsand using the Wick lemma to interpret the perturbations in terms of graphs. Fatgraphs, a specific type of graph, are central in this thesis. A method based onorthogonal polynomials to count fat graphs is presented. The thesis finishes with theformulation and some results related to the three-color problem.

APA, Harvard, Vancouver, ISO, and other styles

11

Strozecki, Yann. "Enumeration complexity and matroid decomposition." Paris 7, 2010. http://www.theses.fr/2010PA077178.

Full text

Abstract:

Ce travail comporte deux parties principales, d'une part l'étude des algorithmes d'énumération et leur complexité et d'autres part la vérification pour des hypergraphes et des matroïdes décomposés de propriétés exprimés en logique monadique du second ordre. L'énumération est d'abord étudié d'un point de vue structurel : on donne les définitions des classes de complexité les plus naturelles et leur relations sont étudiées. On tente d'expliquer le rôle de l'ordre dans cette problématique ainsi que l'effet d'opérations ensemblistes sur les solutions. Puis on donne une série de résultats sur l'énu

APA, Harvard, Vancouver, ISO, and other styles

12

Lladser, Manuel Eugenio. "Asymptotic enumeration via singularity analysis." Connect to this title online, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1060976912.

Full text

Abstract:

Thesis (Ph. D.)--Ohio State University, 2003.<br>Title from first page of PDF file. Document formatted into pages; contains x, 227 p.; also includes graphics Includes bibliographical references (p. 224-227). Available online via OhioLINK's ETD Center

APA, Harvard, Vancouver, ISO, and other styles

13

Badillo, Sanchez Liliana. "Genericity in the enumeration degrees." Thesis, University of Leeds, 2013. http://etheses.whiterose.ac.uk/5296/.

Full text

Abstract:

In this thesis we study the notion of enumeration 1-genericity, various basic properties of it and its relationship with 1-genericity. We also study the problem of avoiding uniformity in the �02 enumeration degrees. In Chapter 2 we give a brief background survey of the notion of genericity in the context of the Turing degrees as well as in the enumeration degrees. Chapter 3 presents a brief overview of the relationship between noncupping and genericity in the enumeration degrees. We give a result that will be useful in proving the existence of prime ideals of �02 enumeration degrees in Chapter

APA, Harvard, Vancouver, ISO, and other styles

14

Markwig, Hannah. "The enumeration of plane tropical curves." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980700736.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Distler, Andreas. "Classification and enumeration of finite semigroups." Thesis, St Andrews, 2010. http://hdl.handle.net/10023/945.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Wong, Thomas. "Enumeration problems in directed walk models." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/54483.

Full text

Abstract:

Self-avoiding walks appear ubiquitously in the study of linear polymers as it naturally captures their volume exclusion property. However, self-avoiding walks are very difficult to analyse with few rigourous results available. In 2008, Alvarez et al. determined numerical results for the forces induced by a self-avoiding walk in an interactive slit. These results resembled the exact results for a directed model in the same setting by Brak et al., suggesting the physical consistency of directed walks as polymer models. In the directed walk model, three phases were identified in the infinite slit

APA, Harvard, Vancouver, ISO, and other styles

17

Williams, Elizabeth C. "A study of Polya's enumeration theorem." Auburn, Ala., 2005. http://repo.lib.auburn.edu/2005%20Summer/master's/WILLIAMS_ELIZABETH_6.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Horton, Leslie Biggs Morrison. "Enumeration of independent sets in graphs /." Full text available from ProQuest UM Digital Dissertations, 2007. http://0-proquest.umi.com.umiss.lib.olemiss.edu/pqdweb?index=2&did=1414120471&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1219778252&clientId=22256.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Wong, Thomas. "Enumeration problems in Baumslag-Solitar groups." Thesis, University of British Columbia, 2010. http://hdl.handle.net/2429/29028.

Full text

Abstract:

Geometric group theory refers to the study of finitely generated groups and their properties by exploring the algebraic and topological structure. This thesis will look at various enumeration problems that arises in Baumslag-Solitar groups. Initially, this thesis aims to reproduce and validate some of the work that has been done on the questions of growth, cogrowth and geodesic elements via an enumeration approach. This approach will then be used to explore specific examples of Baumslag-Solitar groups where these questions have not been fully answered. The first part of this thesis will look

APA, Harvard, Vancouver, ISO, and other styles

20

Edwards, K. "Topics in computational complexity and enumeration." Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.376892.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Harris, Charles Milton. "Enumeration reducibility and polynomial time bounds." Thesis, University of Leeds, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.426857.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

An, Junkyu. "Combinatorial enumeration of weighted Catalan numbers." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/64609.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2010.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 69-70).<br>This thesis is devoted to the divisibility property of weighted Catalan and Motzkin numbers and its applications. In Chapter 1, the definitions and properties of weighted Catalan and Motzkin numbers are introduced. Chapter 2 studies Wilf conjecture on the complementary Bell number, the alternating sum of the Stirling number of the second kind. Congruence properties of the complementary Bell numbers are found by weight

APA, Harvard, Vancouver, ISO, and other styles

23

Ramachandran, J. "Enumeration and advice in structural complexity /." The Ohio State University, 1995. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487862399450835.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Vigny, Alexandre. "Query enumeration and nowhere dense graphs." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC211.

Full text

Abstract:

Les travaux présentés dans ma thèse se situent à l’interface entre complexité, algorithmique et logique. Plus particulièrement, on s’intéresse à la complexité d'évaluation de requêtes.Plus précisément, étant donné G un graphe fini. Une requête q définit un sous ensemble de k-uplets de sommets de G que l'on note q(G). On appelle k l'arité de q et on se essaye alors d'effectuer efficacement les taches suivantes :1) décider si l'ensemble q(G) est vide ou non.2) décider si un k-uplet donné appartient à l'ensemble des solutions q(G).3) calculer le nombre de solutions.4) énumérer les éléments de q(G

APA, Harvard, Vancouver, ISO, and other styles

25

Little, David P. "Q-enumeration of classical combinatorial structures /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2000. http://wwwlib.umi.com/cr/ucsd/fullcit?p9989758.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Richardson, Steven L. "Enumeration of the generalized Catalan numbers." Morgantown, W. Va. : [West Virginia University Libraries], 2005. https://etd.wvu.edu/etd/controller.jsp?moduleName=documentdata&jsp%5FetdId=3906.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Seager, Charles. "Symmetric Presentations and Double Coset Enumeration." CSUSB ScholarWorks, 2018. https://scholarworks.lib.csusb.edu/etd/783.

Full text

Abstract:

In this project, we demonstrate our discovery of original symmetric presentations and constructions of important groups, including nonabelian simple groups, and groups that have these as factor groups. The target nonabelian simple groups include alternating, linear, and sporadic groups. We give isomorphism types for each finite homomorphic image that has been found. We present original symmetric presentations of $M_{12}$, $M_{21}:(2 \times 2)$, $L_{3}(4):2^2$, $2:^{\cdot}L_{3}(4):2$, $S(4,3)$, and $S_{7}$ as homomorphism images of the progenitors $2^{*20}$ $:$ $A_{5}$, $2^{*10}$ $:$ $PGL(2,9)$

APA, Harvard, Vancouver, ISO, and other styles

28

Baudin, Alexis. "Cliques statiques et temporelles : algorithmes d'énumération et de détection de communautés." Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS609.

Full text

Abstract:

Les graphes sont des objets mathématiques qui permettent de modéliser des interactions ou connexions entre entités de types variés. Un graphe peut représenter par exemple un réseau social qui connecte les utilisateurs entre eux, un réseau de transport comme le métro où les stations sont connectées entre elles, ou encore un cerveau avec les milliards de neurones en interaction qu'il contient. Depuis quelques années, la forte dynamicité de ces structures a été mise en évidence, ainsi que l'importance de prendre en compte l'évolution temporelle de ces réseaux pour en comprendre le fonctionnement.

APA, Harvard, Vancouver, ISO, and other styles

29

Cook, David II. "LEFSCHETZ PROPERTIES AND ENUMERATIONS." UKnowledge, 2012. http://uknowledge.uky.edu/math_etds/3.

Full text

Abstract:

An artinian standard graded algebra has the weak Lefschetz property if the multiplication by a general linear form induces maps of maximal rank between consecutive degree components. It has the strong Lefschetz property if the multiplication by powers of a general linear form also induce maps of maximal rank between the appropriate degree components. These properties are mainly studied for the constraints they place, when present, on the Hilbert series of the algebra. While the majority of research on the Lefschetz properties has focused on characteristic zero, we primarily consider the presen

APA, Harvard, Vancouver, ISO, and other styles

30

Pardo, David Wilson de Abreu. "Direitos fundamentais não enumerados." Florianópolis, SC, 2005. http://repositorio.ufsc.br/handle/123456789/102251.

Full text

Abstract:

Tese (doutorado) - Universidade Federal de Santa Catarina, Centro de Ciências Jurídicas. Programa de Pós-Graduação em Direito.<br>Made available in DSpace on 2013-07-16T00:26:39Z (GMT). No. of bitstreams: 1 223094.pdf: 1524627 bytes, checksum: 418e3fbacdb65fd1f862aedc0012c187 (MD5)<br>A presente tese tem por objetivo elaborar um estudo sobre o reconhecimento de novos direitos fundamentais, mais além daqueles expressamente enumerados no catálogo formal de uma constituição. A tese é dividida em cinco capítulos, contendo ainda as obrigatórias introdução e conclusão. O capítulo inicial trata de re

APA, Harvard, Vancouver, ISO, and other styles

31

Boyle, Michael R. "Partial-enumeration for planar network interdiction problems." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1998. http://handle.dtic.mil/100.2/ADA343529.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Keles, Gultekin. "Water Distribution Network Design By Partial Enumeration." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606816/index.pdf.

Full text

Abstract:

Water distribution networks are being designed by traditional methods based on rules-of-thumb and personal experience of the designer. However, since there is no unique solution to any network design, namely there are various combinations of pipes, pumps, tanks all of which satisfy the same pressure and velocity restrictions, it is most probable that the design performed by traditional techniques is not the optimum one. This study deals how an optimization technique can be a useful tool for a designer during the design to find a solution. The method used within the study is the partial enumer

APA, Harvard, Vancouver, ISO, and other styles

33

Petersson, Anna. "Enumeration of spanning trees in simplicial complexes." Licentiate thesis, Uppsala universitet, Matematiska institutionen, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-138976.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Soskova, Mariya Ivanova. "The Local Structure of the Enumeration Degrees." Thesis, University of Leeds, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.491633.

Full text

Abstract:

This thesis discusses properties of the local structure of the enumeration degrees. We begin with some historical background of the subject. vye give motivation for investigating the properties of the local structure ofthe enumeration degrees and discuss the basic concepts and methods used throughout the thesis. Chapter 2 presents evidence that the study of the structure of enumeration degrees can provide a richer understanding of the structure of the Thring degrees. We prove that -- -' - . there exists a II~ enumeration degree which is the bottom of a cone within which the II~ enumeration deg

APA, Harvard, Vancouver, ISO, and other styles

35

Hays, Henry Charles Wilson. "Novel Systems for Bacterial Preservation and Enumeration." Thesis, University of Leeds, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.491750.

Full text

Abstract:

Much like books in a library, microbiological strains must be able to be stored over prolonged periods of time, while maintaining their condition and accessibility for the purposes ofresearch and reference. Many methods currently employed for the storing of microorganisms require highly specialized storage systems; substantial technical equipment; know-how and temperature controlled environments. Whilst these methods are effective, it is accepted that they can be expensive and technically demanding. Traditionally, methods ofevaluating novel storage techniques require the use of classical bacte

APA, Harvard, Vancouver, ISO, and other styles

36

Peterson, Scott. "Analyzing the component processes of visual enumeration." Thesis, Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/28945.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Venkataraman, Geetha. "Enumeration of the types of finite groups." Thesis, University of Oxford, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334908.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Copestake, C. S. "The enumeration degrees of #SIGMA#2Ì² sets." Thesis, University of Leeds, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.377069.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Kim, Hyung Joo. "Electrochemical detection and enumeration of pathogenic bacteria." Thesis, King's College London (University of London), 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.244045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Hersh, Patricia (Patricia Lynn) 1973. "Decomposition and enumeration in partially ordered sets." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/85303.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Yang, Bo-Yin. "Two enumeration problems about the Aztec diamonds." Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13937.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Brown, Tova, and Tova Brown. "Asymptotics and Dynamics of Map Enumeration Problems." Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/621078.

Full text

Abstract:

We solve certain three-term recurrence relations for generating functions of map enumeration problems. These are combinatorial maps, an embedding of a graph into a surface in a particular way. The generating functions enumerate the maps according to an appropriate notion of a distance or height in the map. These problems were studied and the recurrence relations derived in [BDFG03] and [BM06].By viewing the three-term recurrence as giving a two-dimensional discrete dynamical system, these combinatorial problems are set in the context of discrete dynamical systems and integrable systems theory.

APA, Harvard, Vancouver, ISO, and other styles

43

JACQUARD, BENJAMIN. "Cartes et arbres : enumeration, generation et dessins." Palaiseau, Ecole polytechnique, 1997. http://www.theses.fr/1997EPXX0011.

Full text

Abstract:

Ce document est la conclusion de travaux dans le domaine de la combinatoire et l'algorithmique des graphes planaires. L'objet principal de l'etude est la carte planaire qui est le plongement d'un graphe planaire dans la sphere. On distingue dans nos travaux deux axes principaux de recherche: la combinatoire bijective (4 chapitres) et la representation automatique de graphes (1 chapitre). Dans les chapitres 1 et 2, on etudie une famille d'arbres dont les sommets sont etiquetes par des entiers en suivant des regles reliant l'etiquette d'un nud a celles de ses fils. On les appelle arbres de descr

APA, Harvard, Vancouver, ISO, and other styles

44

Choi-Lee, Seul Hee. "Enumeration des tableaux de Young semi-standard." Paris 11, 1992. http://www.theses.fr/1992PA112369.

Full text

Abstract:

Nous considerons des tableaux de young semi-standard, c'est-a-dire strictement croissants en lignes et non decroissants en colonnes. En utilisant l'interpretation des determinants par des configurations de chemins de dyck ne se coupant pas, desainte-catherine et viennot (des-vie) ont donne une formule exacte pour le nombre de tableaux de young semi-standard de hauteur bornee ayant toutes leurs colonnes de hauteur paire. Nous generalisons le resultat de desainte-catherine et viennot, en tenant compte du nombre de colonnes de hauteur impaire. Nous donnons alors, par une preuve bijective, le nomb

APA, Harvard, Vancouver, ISO, and other styles

45

White, Gregory. "Enumeration-based algorithms in linear coding theory." Phd thesis, Faculty of Science, 2006. http://hdl.handle.net/2123/8084.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Green, Shawn Jeffrey. "Extensions of the Power Group Enumeration Theorem." BYU ScholarsArchive, 2019. https://scholarsarchive.byu.edu/etd/7526.

Full text

Abstract:

The goal of this paper is to develop extensions of Polya enumeration methods which count orbits of functions. De Bruijn, Harary, and Palmer all worked on this problem and created generalizations which involve permuting the codomain and domain of functions simultaneously. We cover their results and specifically extend them to the case where the group of permutations need not be a direct product of groups. In this situation, we develop a way of breaking the orbits into subclasses based on a characteristic of the functions involved. Additionally, we develop a formula for the number of orbits mad

APA, Harvard, Vancouver, ISO, and other styles

47

Socci, Samanta. "Enumeration of polyominoes defined by combinatorial constraints." Sorbonne Paris Cité, 2015. http://www.theses.fr/2015USPCC194.

Full text

Abstract:

Après une partie introductive, où les définitions de base sont fournies et des motivations pour le travail sont présentées, la thèse se divise en deux chapitres. Le premier chapitre traite de certaines classes de polyominos, les polyominoes convexes dirigés et les polyominoes k-convexes. Dans la première partie du chapitre nous présentons une approche unifiée pour obtenir les séries génératrices des polyominoes convexes dirigés selon différentes statistiques. Dans la deuxième partie du chapitre nous traitons le problème de l'énumeration des polyominos k-convexes selon leur demi-périmètre. Ce p

APA, Harvard, Vancouver, ISO, and other styles

48

Ramachandran, Sridhar. "A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem." Thesis, This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-10102009-020147/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Distler, Andreas [Verfasser]. "Classification and Enumeration of Finite Semigroups / Andreas Distler." Aachen : Shaker, 2010. http://d-nb.info/1081886196/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

WANG, Jiexun. "Enumeration Algorithms for Colored and Rooted Outerplanar Graphs." 京都大学 (Kyoto University), 2010. http://hdl.handle.net/2433/108365.

Full text

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!