Dissertationen zum Thema „Enumeraton“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Enumeraton" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Blackburn, Simon R. „Group enumeration“. Thesis, University of Oxford, 1992. http://ora.ox.ac.uk/objects/uuid:caac5ed0-44e3-4bec-a97e-59e11ea268af.
Der volle Inhalt der Quellep2andfrasl;27m3+O(m2). (1) We show that the number of groups of nilpotency class at most 3 and order pm satisfies (1). We prove a similar result concerning the number of graded Lie rings of order pm generated by their first grading.
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.
Der volle Inhalt der QuelleShoilekova, Bilyana Todorova. „Graphical enumeration methods“. Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526538.
Der volle Inhalt der QuelleHannah, 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.
Der volle Inhalt der QuelleEdeson, Margaret, und n/a. „Investigations in coset enumeration“. University of Canberra. Information Sciences & Engineering, 1989. http://erl.canberra.edu.au./public/adt-AUC20050712.083514.
Der volle Inhalt der QuelleOcansey, Evans Doe. „Enumeration problems on lattices“. Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/80393.
Der volle Inhalt der QuelleENGLISH 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 lattice and its dual lattice to derive a explicit formulas for the number of spanning trees of these lattices of finite sizes. Regarding the problem of enumerating of perfect matchings, we prove Cayley’s theorem which relates the Pfaffian of a skew symmetric matrix to its determinant. Using this and defining the Pfaffian orientation on a planar graph, we derive explicit formula for the number of perfect matchings on the following planar lattices; rectangular, honeycomb and triangular. For each of these lattices, we also determine the bulk limit or thermodynamic limit, which is a natural measure of the rate of growth of the number of spanning trees (L) and the number of perfect matchings PM(L). An algorithm is implemented in the computer algebra system SAGE to count the number of spanning trees as well as the number of perfect matchings of the lattices studied.
AFRIKAANSE OPSOMMING: Die hoofdoel van ons studie is die aftelling van spanbome (G) en volkome afparings PM(G) in grafieke G en roosters L. Ons beskou twee metodes om spanbome in ’n samehangende grafiek af te tel, naamlik deur middel van die matriks-boom-stelling, en as ’n spesiale waarde van die Tutte polinoom T(G; x; y). Ons behandel ’n algemene metode om spanbome in roosters in d 2 dimensies af te tel. In die besonder pas ons hierdie metode toe op die volgende reguliere roosters met d = 2: reghoekig, driehoekig, heuningkoek, kagomé, blokkies, 9 3 rooster en sy duale rooster. Ons bepaal eksplisiete formules vir die aantal spanbome in hierdie roosters van eindige grootte. Wat die aftelling van volkome afparings aanbetref, gee ons ’n bewys van Cayley se stelling wat die Pfaffiaan van ’n skeefsimmetriese matriks met sy determinant verbind. Met behulp van hierdie stelling en Pfaffiaanse oriënterings van planare grafieke bepaal ons eksplisiete formules vir die aantal volkome afparings in die volgende planare roosters: reghoekig, driehoekig, heuningkoek. Vir elk van hierdie roosters word ook die “grootmaat limiet” (of termodinamiese limiet) bepaal, wat ’n natuurlike maat vir die groeitempo van die aantaal spanbome (L) en die aantal volkome afparings PM(L) voorstel. ’n Algoritme is in die rekenaaralgebra-stelsel SAGE geimplementeer om die aantal spanboome asook die aantal volkome afparings in die toepaslike roosters af te tel.
Meier, Arne [Verfasser]. „Parametrised enumeration / Arne Meier“. Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2020. http://d-nb.info/1206685859/34.
Der volle Inhalt der QuelleRamos, Garrido Lander. „Graph enumeration and random graphs“. Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/405943.
Der volle Inhalt der QuelleEn aquesta tesi utilitzem l'analítica combinatòria per treballar amb dos problemes relacionats: enumeració de grafs i grafs aleatoris de classes de grafs amb restriccions. En particular ens interessa esbossar un dibuix general de determinades famílies de grafs determinant, en primer lloc, quants grafs hi ha de cada mida possible (enumeració de grafs), i, en segon lloc, quin és el comportament típic d'un element de mida fixa triat a l'atzar uniformement, quan aquesta mida tendeix a infinit (grafs aleatoris). Els problemes en què treballem tracten amb grafs que satisfan condicions globals, com ara ésser planars, o bé tenir restriccions en el grau dels vèrtexs. En el Capítol 2 analitzem grafs planar aleatoris amb grau mínim dos i tres. Mitjançant tècniques de combinatòria analítica i els conceptes de nucli i kernel d'un graf, obtenim estimacions asimptòtiques precises i analitzem paràmetres rellevants de grafs aleatoris, com ara el nombre d'arestes o la mida del nucli, on obtenim lleis límit gaussianes. També treballem amb un paràmetre que suposa un repte més important: el paràmetre extremal que es correspon amb la mida de l'arbre més gran que penja del nucli. En aquest cas obtenim una estimació logarítmica per al seu valor esperat, juntament amb un resultat sobre la seva concentració. En el Capítol 3 estudiem el nombre de subgrafs isomorfs a un graf fix en classes de grafs subcrítiques. Quan el graf fix és biconnex, obtenim lleis límit gaussianes amb esperança i variància lineals. L'eina principal és l'anàlisi de sistemes infinits d'equacions donada per Drmota, Gittenberger i Morgenbesser, que utilitza la teoria d'operadors compactes. El càlcul de les constants exactes de la primera estimació dels moments en general es troba fora del nostre abast. Per a la classe de grafs sèrie-paral·lels podem calcular les constants en alguns casos particulars interessants. En el Capítol 4 enumerem grafs (arbitraris) el grau de cada vèrtex dels quals pertany a un subconjunt fix dels nombres naturals. En aquest cas les funcions generatrius associades són divergents i la nostra anàlisi utilitza l'anomenat model de configuració. El nostre resultat consisteix a obtenir estimacions asimptòtiques precises per al nombre de grafs amb un nombre de vèrtexs i arestes donat, amb la restricció dels graus. Aquest resultat generalitza àmpliament casos particulars existents, com ara grafs d-regulars, o grafs amb grau mínim com a mínim d.
Postnikov, Alexander. „Enumeration in algebra and geometry“. Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42693.
Der volle Inhalt der QuelleEgebrand, August. „Feynman Diagrams and Map Enumeration“. Thesis, Uppsala universitet, Teoretisk fysik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-298474.
Der volle Inhalt der QuelleStrozecki, Yann. „Enumeration complexity and matroid decomposition“. Paris 7, 2010. http://www.theses.fr/2010PA077178.
Der volle Inhalt der QuelleThis thesis is made of two parts, on the one hand the study of enumeration algorithms and their complexity and in the other hand the model checking of Monadic second order properties over decomposable matroids. The enumeration is studied first from a structural point of view: natural complexity classes are defined and their relation studied. We also try to explain the effect of ordering in enumeration and of some set operations over the solutions. Then, we present several algorithms to enumerate the monomials of polynomials given either as black boxes or circuits. They can be used to solve more classical combinatoric problems such as the enumeration of spanning hypertrees of a 3-uniform hypergraph. In the second part, we present an alternative tree decomposition of representable matroids of bounded branch-width. It enables to locally express the dependency property and thus to give a linear time algorithm to check MSO properties over these structures. We also obtain a linear delay enumeration algorithm of the objects definable in MSO, such as the circuits of a matroid. This decomposition can easily extended to other classes and even by further abstraction to hypergaphs
Lladser, Manuel Eugenio. „Asymptotic enumeration via singularity analysis“. Connect to this title online, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1060976912.
Der volle Inhalt der QuelleTitle 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
Badillo, Sanchez Liliana. „Genericity in the enumeration degrees“. Thesis, University of Leeds, 2013. http://etheses.whiterose.ac.uk/5296/.
Der volle Inhalt der QuelleMarkwig, Hannah. „The enumeration of plane tropical curves“. [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980700736.
Der volle Inhalt der QuelleDistler, Andreas. „Classification and enumeration of finite semigroups“. Thesis, St Andrews, 2010. http://hdl.handle.net/10023/945.
Der volle Inhalt der QuelleWong, Thomas. „Enumeration problems in directed walk models“. Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/54483.
Der volle Inhalt der QuelleScience, Faculty of
Mathematics, Department of
Graduate
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.
Der volle Inhalt der QuelleHorton, 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.
Der volle Inhalt der QuelleWong, Thomas. „Enumeration problems in Baumslag-Solitar groups“. Thesis, University of British Columbia, 2010. http://hdl.handle.net/2429/29028.
Der volle Inhalt der QuelleEdwards, K. „Topics in computational complexity and enumeration“. Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.376892.
Der volle Inhalt der QuelleHarris, Charles Milton. „Enumeration reducibility and polynomial time bounds“. Thesis, University of Leeds, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.426857.
Der volle Inhalt der QuelleAn, Junkyu. „Combinatorial enumeration of weighted Catalan numbers“. Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/64609.
Der volle Inhalt der QuelleCataloged from PDF version of thesis.
Includes bibliographical references (p. 69-70).
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 weighted Motkin paths, and Wilf conjecture is partially proved. In Chapter 3, Konvalinka conjecture is proved. It is a conjecture on the largest power of two dividing weighted Catalan number, when the weight function is a polynomial. As a corollary, we provide another proof of Postnikov and Sagan of weighted Catalan numbers, and we also generalize Konvalinka conjecture for a general weight function.
by Junkyu An.
Ph.D.
Ramachandran, J. „Enumeration and advice in structural complexity /“. The Ohio State University, 1995. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487862399450835.
Der volle Inhalt der QuelleVigny, Alexandre. „Query enumeration and nowhere dense graphs“. Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC211.
Der volle Inhalt der QuelleThe topic of my thesis lies between complexity, algorithmic and logic. In particular, we are interested in the complexity of evaluating query.More precisely, given G a finite graph. A query q defines a subset of k-tuples of vertices of G that we note q(G). We call k the arity of q and we then try to efficiently perform the following tasks:1) decide whether the set q G) is empty.2) decide whether a given k-tuplet belongs to the set of solutions q(G).3) calculate the number of solutions.4) enumerate the elements of q(G).Regarding the 4th task, an algorithm that will enumerate the solutions can be decomposed into two steps. The first is called preprocessing and is used to prepare the enumeration. Ideally this step only requires a time linear in the size of the graph. The second step is the enumeration properly speaking. The time needed to get a new solution is called the delay. Ideally we want the delay to not depend on the size of the graph but only on the size of the query. We then talk about constant delay enumeration after linear preprocessing.At the beginning of this thesis, a large part of the interrogations about classes of graphs for which a constant delay enumeration is possible seemed to be located around the classes of nowhere dense graphs
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.
Der volle Inhalt der QuelleRichardson, 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.
Der volle Inhalt der QuelleSeager, Charles. „Symmetric Presentations and Double Coset Enumeration“. CSUSB ScholarWorks, 2018. https://scholarworks.lib.csusb.edu/etd/783.
Der volle Inhalt der QuelleBaudin, 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.
Der volle Inhalt der QuelleGraphs are mathematical objects used to model interactions or connections between entities of various types. A graph can represent, for example, a social network that connects users to each other, a transport network like the metro where stations are connected to each other, or a brain with the billions of interacting neurons it contains. In recent years, the dynamic nature of these structures has been highlighted, as well as the importance of taking into account the temporal evolution of these networks to understand their functioning. While many concepts and algorithms have been developed on graphs to describe static network structures, much remains to be done to formalize and develop relevant algorithms to describe the dynamics of real networks. This thesis aims to better understand how massive graphs are structured in the real world, and to develop tools to extend our understanding to structures that evolve over time. It has been shown that these graphs have particular properties, which distinguish them from theoretical or randomly drawn graphs. Exploiting these properties then enables the design of algorithms to solve certain difficult problems much more quickly on these instances than in the general case. My PhD thesis focuses on cliques, which are groups of elements that are all connected to each other. We study the enumeration of cliques in static and temporal graphs and the detection of communities they enable. The communities of a graph are sets of vertices such that, within a community, the vertices interact strongly with each other, and little with the rest of the graph. Their study helps to understand the structural and functional properties of networks. We are evaluating our algorithms on massive real-world graphs, opening up new perspectives for understanding interactions within these networks. We first work on graphs, without taking into account the temporal component of interactions. We begin by using the clique percolation method of community detection, highlighting its limitations in memory, which prevent it from being applied to graphs that are too massive. By introducing an approximate problem-solving algorithm, we overcome this limitation. Next, we improve the enumeration of maximal cliques in the case of bipartite graphs. These correspond to interactions between groups of vertices of different types, e.g. links between people and viewed content, participation in events, etc. Next, we consider interactions that take place over time, using the link stream formalism. We seek to extend the algorithms presented in the first part, to exploit their advantages in the study of temporal interactions. We provide a new algorithm for enumerating maximal cliques in link streams, which is much more efficient than the state-of-the-art on massive datasets. Finally, we focus on communities in link streams by clique percolation, developing an extension of the method used on graphs. The results show a significant improvement over the state of the art, and we analyze the communities obtained to provide relevant information on the organization of temporal interactions in link streams. My PhD work has provided new insights into the study of massive real-world networks. This shows the importance of exploring the potential of graphs in a real-world context, and could contribute to the emergence of innovative solutions for the complex challenges of our modern society
Cook, David II. „LEFSCHETZ PROPERTIES AND ENUMERATIONS“. UKnowledge, 2012. http://uknowledge.uky.edu/math_etds/3.
Der volle Inhalt der QuellePardo, David Wilson de Abreu. „Direitos fundamentais não enumerados“. Florianópolis, SC, 2005. http://repositorio.ufsc.br/handle/123456789/102251.
Der volle Inhalt der QuelleMade available in DSpace on 2013-07-16T00:26:39Z (GMT). No. of bitstreams: 1 223094.pdf: 1524627 bytes, checksum: 418e3fbacdb65fd1f862aedc0012c187 (MD5)
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 rever a idéia de constituição material, para o fim de apresentar uma noção plausível de direitos fundamentais em sentido material e, em conseqüência, de direitos fundamentais não enumerados. No segundo capítulo, demonstra-se que o reconhecimento de novos direitos fundamentais é uma questão de interpretação e aplicação da constituição. Nesse sentido, direitos fundamentais não enumerados constituem uma questão interpretativa. O capítulo terceiro é reservado para o exame da justificação dos direitos fundamentais na teoria do discurso, defendendo a natureza moral do empreendimento. No quarto capítulo, a teoria dos princípios é apresentada como uma teoria competente para resolver o problema da interpretação e aplicação racional dos direitos fundamentais, bem como a questão dos direitos não enumerados. Ainda nesse capítulo, defende-se a tese de que o reconhecimento de novos direitos fundamentais tem como procedimento mais geral a justificação de princípios que têm que ser levados em conta na aplicação coerente do sistema constitucional dos direitos a casos especialmente controversos. O capítulo final busca os critérios de reconhecimento de novos direitos fundamentais de acordo com a Constituição brasileira de 1988, afirmando que eles podem ser tomados como direitos implícitos ou direitos decorrentes do regime e dos princípios constitucionais.
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.
Der volle Inhalt der QuelleKeles, Gultekin. „Water Distribution Network Design By Partial Enumeration“. Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606816/index.pdf.
Der volle Inhalt der Quellepartial enumeration method can assist designers to select the optimum system combination.
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.
Der volle Inhalt der QuelleSoskova, 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.
Der volle Inhalt der QuelleHays, 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.
Der volle Inhalt der QuellePeterson, Scott. „Analyzing the component processes of visual enumeration“. Thesis, Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/28945.
Der volle Inhalt der QuelleVenkataraman, Geetha. „Enumeration of the types of finite groups“. Thesis, University of Oxford, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334908.
Der volle Inhalt der QuelleCopestake, 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.
Der volle Inhalt der QuelleKim, 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.
Der volle Inhalt der QuelleHersh, Patricia (Patricia Lynn) 1973. „Decomposition and enumeration in partially ordered sets“. Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/85303.
Der volle Inhalt der QuelleYang, Bo-Yin. „Two enumeration problems about the Aztec diamonds“. Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13937.
Der volle Inhalt der QuelleBrown, Tova, und Tova Brown. „Asymptotics and Dynamics of Map Enumeration Problems“. Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/621078.
Der volle Inhalt der QuelleJACQUARD, BENJAMIN. „Cartes et arbres : enumeration, generation et dessins“. Palaiseau, Ecole polytechnique, 1997. http://www.theses.fr/1997EPXX0011.
Der volle Inhalt der QuelleChoi-Lee, Seul Hee. „Enumeration des tableaux de Young semi-standard“. Paris 11, 1992. http://www.theses.fr/1992PA112369.
Der volle Inhalt der QuelleWhite, Gregory. „Enumeration-based algorithms in linear coding theory“. Phd thesis, Faculty of Science, 2006. http://hdl.handle.net/2123/8084.
Der volle Inhalt der QuelleGreen, Shawn Jeffrey. „Extensions of the Power Group Enumeration Theorem“. BYU ScholarsArchive, 2019. https://scholarsarchive.byu.edu/etd/7526.
Der volle Inhalt der QuelleSocci, Samanta. „Enumeration of polyominoes defined by combinatorial constraints“. Sorbonne Paris Cité, 2015. http://www.theses.fr/2015USPCC194.
Der volle Inhalt der QuelleAfter an introductory part, where some basic definitions are provided and some motivations for the investigation are presented, the thesis is divided into two chapters. The first chapter concerns particular classes of polyominoes. After a presentation of the background and the introduction of notations, we introduce a unified approach to obtain generating functions for different statistics on directed convex polyominoes. The problem of counting k-convex polyominoes according to their semi-perimeter is a difficult problem: it is solved for k=1,2. In the last part of the first chapter we introduce two particular classes of k-convex polyominoes, namely k-parallelogram and directed k-convex polyominoes, and we solve completely the corresponding enumeration problem. The second chapter deals with permutominoes (polyominoes defined by pairs of permutations). It begins with a background and some classical enumerative results for particular permutominoes. We introduce a naturel generalization of permutominoes to any dimension and we obtain new enumerative results and other already known are recovered by a unified approach. Concerning the two dimensional case, we solve the open problem of the characterization of the pairs of permutations defining the column-convex permutominoes and we find a bijective proof for the number of directed column-convex permutominoes, that we know to be counted by factoriel numbers
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/.
Der volle Inhalt der QuelleRaji, Mehrdad Ahmadzadeh. „High power residue codes over Galois rings and related lattices“. Thesis, University of Exeter, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.248091.
Der volle Inhalt der QuelleDistler, Andreas [Verfasser]. „Classification and Enumeration of Finite Semigroups / Andreas Distler“. Aachen : Shaker, 2010. http://d-nb.info/1081886196/34.
Der volle Inhalt der Quelle