Spelling suggestions: "subject:"permutation""
81 |
Permutações caóticas e aplicações / Chaotic permutation and applicationsSantos Júnior, Edson Praxedes dos 07 March 2014 (has links)
Submitted by Erika Demachki (erikademachki@gmail.com) on 2014-11-11T17:41:45Z
No. of bitstreams: 2
Dissertação - Edson Praxedes dos Santos Junior - 2014.pdf: 13478577 bytes, checksum: b27d0c248d9fab2b9ccbb4c02b7d2b63 (MD5)
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Erika Demachki (erikademachki@gmail.com) on 2014-11-11T17:46:05Z (GMT) No. of bitstreams: 2
Dissertação - Edson Praxedes dos Santos Junior - 2014.pdf: 13478577 bytes, checksum: b27d0c248d9fab2b9ccbb4c02b7d2b63 (MD5)
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2014-11-11T17:46:05Z (GMT). No. of bitstreams: 2
Dissertação - Edson Praxedes dos Santos Junior - 2014.pdf: 13478577 bytes, checksum: b27d0c248d9fab2b9ccbb4c02b7d2b63 (MD5)
license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Previous issue date: 2014-03-07 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / This study aimed to systematize a formula that gives the number of chaotic permutations of n objects by means of the principle of inclusion and exclusion. To do so, are developed and validated, throughout the text, basic and advanced tools of combinatorics. There is also a section devoted to problems which can be solved by the formula outa obtained and in which approaches the formula for obtaining the number of chaotic permutations by means of recurrence. / O presente trabalho teve como objetivo principal, sistematizar uma fórmula que fornece o número de permutações caóticas de n objetos por meio do princípio da inclusão e exclusão. Para isso, são desenvolvidas e validadas, ao longo do texto, ferramentas básicas e avançadas da análise combinatória. Há também uma seção destinada a problemas, que podem ser solucionados por meio da fórmula obtida e outra na qual aborda a fórmula da obtenção do número de permutações caóticas por meio de recorrência.
|
82 |
Combinatorial arguments for linear logic full completenessSteele, Hugh Paul January 2013 (has links)
We investigate categorical models of the unit-free multiplicative and multiplicative-additive fragments of linear logic by representing derivations as particular structures known as dinatural transformations. Suitable categories are considered to satisfy a property known as full completeness if all such entities are the interpretation of a correct derivation. It is demonstrated that certain Hyland-Schalk double glueings [HS03] are capable of transforming large numbers of degenerate models into more accurate ones. Compact closed categories with finite biproducts possess enough structure that their morphisms can be described as forms of linear arrays. We introduce the notion of an extended tensor (or ‘extensor’) over arbitrary semirings, and show that they uniquely describe arrows between objects generated freely from the tensor unit in such categories. It is made evident that the concept may be extended yet further to provide meaningful decompositions of more general arrows. We demonstrate how the calculus of extensors makes it possible to examine the combinatorics of certain double glueing constructions. From this we show that the Hyland-Tan version [Tan97], when applied to compact closed categories satisfying a far weaker version of full completeness, produces genuine fully complete models of unit-free multiplicative linear logic. Research towards the development of a full completeness result for the multiplicative-additive fragment is detailed. The proofs work for categories of finite arrays over certain semirings under both the Hyland-Tan and Schalk [Sch04] constructions. We offer a possible route to finishing this proof. An interpretation of these results with respect to linear logic proof theory is provided, and possible further research paths and generalisations are discussed.
|
83 |
Distance-preserving mappings and trellis codes with permutation sequencesSwart, Theo G. 27 June 2008 (has links)
Our research is focused on mapping binary sequences to permutation sequences. It is established that an upper bound on the sum of the Hamming distance for all mappings exists, and this sum is used as a criterion to ascertain how good previously known mappings are. We further make use of permutation trellis codes to investigate the performance of certain permutation mappings in a power-line communications system, where background noise, narrow band noise and wide band noise are present. A new multilevel construction is presented next that maps binary sequences to permutation sequences, creating new mappings for which the sum of Hamming distances are greater than previous known mappings. It also proved that for certain lengths of sequences, the new construction can attain our new upper bound on the sum of Hamming distances. We further extend the multilevel construction by showing how it can be applied to other mappings, such as permutations with repeating symbols and mappings with nonbinary inputs. We also show that a subset of the new construction yields permutation sequences that are able to correct insertion and deletion errors as well. Finally, we show that long binary sequences, formed by concatenating the columns of binary permutation matrices, are subsets of the Levenshtein insertion/deletion correcting codes. / Prof. H. C. Ferreira
|
84 |
Pattern Avoidance in Ordered Set PartitionsGodbole, Anant, Goyt, Adam, Herdan, Jennifer, Pudwell, Lara 01 January 2014 (has links)
In this paper we consider the enumeration of ordered set partitions avoiding a permutation pattern of length 2 or 3. We provide an exact enumeration for avoiding the permutation 12. We also give exact enumeration for ordered partitions with 3 blocks and ordered partitions with n-1 blocks avoiding a permutation of length 3. We use enumeration schemes to recursively enumerate 123-avoiding ordered partitions with any block sizes. Finally, we give some asymptotic results for the growth rates of the number of ordered set partitions avoiding a single pattern; including a Stanley-Wilf type result that exhibits existence of such growth rates.
|
85 |
Congruence and Noncongruence Subgroups of Γ(2) via Graphs on SurfacesWhitaker, erica j. 15 December 2011 (has links)
No description available.
|
86 |
Representation of Monoids and Lattice Structures in the Combinatorics of Weyl Groups / Représentations de monoïdes et structures de treillis en combinatoire des groupes de Weyl.Gay, Joël 25 June 2018 (has links)
La combinatoire algébrique est le champ de recherche qui utilise des méthodes combinatoires et des algorithmes pour étudier les problèmes algébriques, et applique ensuite des outils algébriques à ces problèmes combinatoires. L’un des thèmes centraux de la combinatoire algébrique est l’étude des permutations car elles peuvent être interprétées de bien des manières (en tant que bijections, matrices de permutations, mais aussi mots sur des entiers, ordre totaux sur des entiers, sommets du permutaèdre…). Cette riche diversité de perspectives conduit alors aux généralisations suivantes du groupe symétrique. Sur le plan géométrique, le groupe symétrique engendré par les transpositions élémentaires est l’exemple canonique des groupes de réflexions finis, également appelés groupes de Coxeter. Sur le plan monoïdal, ces même transpositions élémentaires deviennent les opérateurs du tri par bulles et engendrent le monoïde de 0-Hecke, dont l’algèbre est la spécialisation à q=0 de la q-déformation du groupe symétrique introduite par Iwahori. Cette thèse se consacre à deux autres généralisations des permutations. Dans la première partie de cette thèse, nous nous concentrons sur les matrices de permutations partielles, en d’autres termes les placements de tours ne s’attaquant pas deux à deux sur un échiquier carré. Ces placements de tours engendrent le monoïde de placements de tours, une généralisation du groupe symétrique. Dans cette thèse nous introduisons et étudions le 0-monoïde de placements de tours comme une généralisation du monoïde de 0-Hecke. Son algèbre est la dégénérescence à q=0 de la q-déformation du monoïde de placements de tours introduite par Solomon. On étudie par la suite les propriétés monoïdales fondamentales du 0-monoïde de placements de tours (ordres de Green, propriété de treillis du R-ordre, J-trivialité) ce qui nous permet de décrire sa théorie des représentations (modules simples et projectifs, projectivité sur le monoïde de 0-Hecke, restriction et induction le long d’une fonction d’inclusion).Les monoïdes de placements de tours sont en fait l’instance en type A de la famille des monoïdes de Renner, définis comme les complétés des groupes de Weyl (c’est-à-dire les groupes de Coxeter cristallographiques) pour la topologie de Zariski. Dès lors, dans la seconde partie de la thèse nous étendons nos résultats du type A afin de définir les monoïdes de 0-Renner en type B et D et d’en donner une présentation. Ceci nous conduit également à une présentation des monoïdes de Renner en type B et D, corrigeant ainsi une présentation erronée se trouvant dans la littérature depuis une dizaine d’années. Par la suite, nous étudions comme en type A les propriétés monoïdales de ces nouveaux monoïdes de 0-Renner de type B et D : ils restent J-triviaux, mais leur R-ordre n’est plus un treillis. Cela ne nous empêche pas d’étudier leur théorie des représentations, ainsi que la restriction des modules projectifs sur le monoïde de 0-Hecke qui leur est associé. Enfin, la dernière partie de la thèse traite de différentes généralisations des permutations. Dans une récente séries d’articles, Châtel, Pilaud et Pons revisitent la combinatoire algébrique des permutations (ordre faible, algèbre de Hopf de Malvenuto-Reutenauer) en terme de combinatoire sur les ordres partiels sur les entiers. Cette perspective englobe également la combinatoire des quotients de l’ordre faible tels les arbres binaires, les séquences binaires, et de façon plus générale les récents permutarbres de Pilaud et Pons. Nous généralisons alors l’ordre faibles aux éléments des groupes de Weyl. Ceci nous conduit à décrire un ordre sur les sommets des permutaèdres, associaèdres généralisés et cubes dans le même cadre unifié. Ces résultats se basent sur de subtiles propriétés des sommes de racines dans les groupes de Weyl qui s’avèrent ne pas fonctionner pour les groupes de Coxeter qui ne sont pas cristallographiques / Algebraic combinatorics is the research field that uses combinatorial methods and algorithms to study algebraic computation, and applies algebraic tools to combinatorial problems. One of the central topics of algebraic combinatorics is the study of permutations, interpreted in many different ways (as bijections, permutation matrices, words over integers, total orders on integers, vertices of the permutahedron…). This rich diversity of perspectives leads to the following generalizations of the symmetric group. On the geometric side, the symmetric group generated by simple transpositions is the canonical example of finite reflection groups, also called Coxeter groups. On the monoidal side, the simple transpositions become bubble sort operators that generate the 0-Hecke monoid, whose algebra is the specialization at q=0 of Iwahori’s q-deformation of the symmetric group. This thesis deals with two further generalizations of permutations. In the first part of this thesis, we first focus on partial permutations matrices, that is placements of pairwise non attacking rooks on a n by n chessboard, simply called rooks. Rooks generate the rook monoid, a generalization of the symmetric group. In this thesis we introduce and study the 0-Rook monoid, a generalization of the 0-Hecke monoid. Its algebra is a proper degeneracy at q = 0 of the q-deformed rook monoid of Solomon. We study fundamental monoidal properties of the 0-rook monoid (Green orders, lattice property of the R-order, J-triviality) which allow us to describe its representation theory (simple and projective modules, projectivity on the 0-Hecke monoid, restriction and induction along an inclusion map).Rook monoids are actually type A instances of the family of Renner monoids, which are completions of the Weyl groups (crystallographic Coxeter groups) for Zariski’s topology. In the second part of this thesis we extend our type A results to define and give a presentation of 0-Renner monoids in type B and D. This also leads to a presentation of the Renner monoids of type B and D, correcting a misleading presentation that appeared earlier in the litterature. As in type A we study the monoidal properties of the 0-Renner monoids of type B and D : they are still J-trivial but their R-order are not lattices anymore. We study nonetheless their representation theory and the restriction of projective modules over the corresponding 0-Hecke monoids. The third part of this thesis deals with different generalizations of permutations. In a recent series of papers, Châtel, Pilaud and Pons revisit the algebraic combinatorics of permutations (weak order, Malvenuto-Reutenauer Hopf algebra) in terms of the combinatorics of integer posets. This perspective encompasses as well the combinatorics of quotients of the weak order such as binary trees, binary sequences, and more generally the recent permutrees of Pilaud and Pons. We generalize the weak order on the elements of the Weyl groups. This enables us to describe the order on vertices of the permutahedra, generalized associahedra and cubes in the same unified context. These results are based on subtle properties of sums of roots in Weyl groups, and actually fail for non-crystallographic Coxeter groups.
|
87 |
Quelques algorithmes entre le monde des graphes et les nuages de points.Bonichon, Nicolas 03 April 2013 (has links) (PDF)
Quelques algorithmes entre le monde des graphes et les nuages de points.
|
88 |
Análise Combinatória: teoria e aplicações para o ensino básicoPassos, Gilvan da Silva, 92992831239 28 March 2018 (has links)
Submitted by Gilvan Passos (gilvan.dspassos@gmail.com) on 2018-11-02T17:23:45Z
No. of bitstreams: 3
GilvanTCC.pdf: 392056 bytes, checksum: c92e4c9757ada7893dc6f62a78267aa6 (MD5)
IMG_20181102_131441.jpg: 1218636 bytes, checksum: 36aa8c31ec2aca115870ea2c2a9e278c (MD5)
IMG_20181102_131427.jpg: 1672384 bytes, checksum: ef52fc665bf97e6c37ae0b3c0202ac2c (MD5) / Approved for entry into archive by PPGM Matemática (ppgmufam@gmail.com) on 2018-11-08T18:51:06Z (GMT) No. of bitstreams: 3
GilvanTCC.pdf: 392056 bytes, checksum: c92e4c9757ada7893dc6f62a78267aa6 (MD5)
IMG_20181102_131441.jpg: 1218636 bytes, checksum: 36aa8c31ec2aca115870ea2c2a9e278c (MD5)
IMG_20181102_131427.jpg: 1672384 bytes, checksum: ef52fc665bf97e6c37ae0b3c0202ac2c (MD5) / Rejected by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br), reason: A Dissertação inserida está sem Ficha Catalográfica.
Instruções no link http://biblioteca.ufam.edu.br/servicos/elaboracao-de-ficha-catalografica
Dúvidas? ddbc@ufam.edu.br on 2018-11-09T13:58:53Z (GMT) / Submitted by Gilvan Passos (gilvan.dspassos@gmail.com) on 2018-11-09T20:14:38Z
No. of bitstreams: 4
GilvanTCC.pdf: 392056 bytes, checksum: c92e4c9757ada7893dc6f62a78267aa6 (MD5)
IMG_20181102_131441.jpg: 1218636 bytes, checksum: 36aa8c31ec2aca115870ea2c2a9e278c (MD5)
IMG_20181102_131427.jpg: 1672384 bytes, checksum: ef52fc665bf97e6c37ae0b3c0202ac2c (MD5)
fichacatalografica.pdf: 5598 bytes, checksum: 78c21bd3648cbde20ad062f8314ad74d (MD5) / Approved for entry into archive by PPGM Matemática (ppgmufam@gmail.com) on 2018-11-13T14:28:28Z (GMT) No. of bitstreams: 4
GilvanTCC.pdf: 392056 bytes, checksum: c92e4c9757ada7893dc6f62a78267aa6 (MD5)
IMG_20181102_131441.jpg: 1218636 bytes, checksum: 36aa8c31ec2aca115870ea2c2a9e278c (MD5)
IMG_20181102_131427.jpg: 1672384 bytes, checksum: ef52fc665bf97e6c37ae0b3c0202ac2c (MD5)
fichacatalografica.pdf: 5598 bytes, checksum: 78c21bd3648cbde20ad062f8314ad74d (MD5) / Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2018-11-13T18:08:41Z (GMT) No. of bitstreams: 4
GilvanTCC.pdf: 392056 bytes, checksum: c92e4c9757ada7893dc6f62a78267aa6 (MD5)
IMG_20181102_131441.jpg: 1218636 bytes, checksum: 36aa8c31ec2aca115870ea2c2a9e278c (MD5)
IMG_20181102_131427.jpg: 1672384 bytes, checksum: ef52fc665bf97e6c37ae0b3c0202ac2c (MD5)
fichacatalografica.pdf: 5598 bytes, checksum: 78c21bd3648cbde20ad062f8314ad74d (MD5) / Made available in DSpace on 2018-11-13T18:08:41Z (GMT). No. of bitstreams: 4
GilvanTCC.pdf: 392056 bytes, checksum: c92e4c9757ada7893dc6f62a78267aa6 (MD5)
IMG_20181102_131441.jpg: 1218636 bytes, checksum: 36aa8c31ec2aca115870ea2c2a9e278c (MD5)
IMG_20181102_131427.jpg: 1672384 bytes, checksum: ef52fc665bf97e6c37ae0b3c0202ac2c (MD5)
fichacatalografica.pdf: 5598 bytes, checksum: 78c21bd3648cbde20ad062f8314ad74d (MD5)
Previous issue date: 2018-03-28 / This work aims to study combinatorial analysis, which is an important branch of mathematics which is not usually subtly treated and through many years was teached as the mechanical memorization, leaving aside the learning process, self-learning and logical construction. It is important to emphasize the application of combinatorial analysis in set theory and probabilities theory that are often present in problem solving. It is necessary to present to our students the potential and beauty of the logical construction of ideas of combinatorial analysis, not excluding formulas applications, that can be used when the concepts and structure is well assimilated. We present counting methods beyond those used in basic education such as repetition chaotic permutations combinations, inclusion and exclusion principles, Kaplansky and Dirichlet lemmas, but we also highlight basic methods such as simple arrangements, simple combinations, and simple permutations. Beyond that, we present a generalization of the factorial numbers through the Gamma function besides olympics problems resolutions. / Este trabalho tem por objetivo estudar Análise Combinatória, que é um importante ramo da matemática que normalmente não é tratado com sutileza e transmitida ao longo dos anos através de memorização mecânica deixando o processo aprendizagem, auto-aprendizagem e construção lógica de lado. É importante enfatizar a aplicação da Análise Combinatória nas teorias dos conjuntos e teoria das probabilidades que muitas vezes se fazem presentes nas resoluções de problemas. Se faz necessário apresentar para nossos alunos o potencial e a beleza da construção lógica de ideias que a Análise Combinatória proporciona não excluindo as aplicações de fórmulas mas que elas possam ser usadas quando os conceitos e a estrutura forem bem assimiladas. Apresentamos métodos de contagem além dos usados no ensino básico como permutações caóticas combinações com repetição, princípio da inclusão e exclusão, lemas de Kaplansky e de Dirichlet mas também destacamos os métodos básicos como arranjos simples, combinações simples e permutações simples. Além disso, para apresentamos uma generalização dos números fatoriais definida pela função Gama e resoluções de problemas de olimpíadas.
|
89 |
Études combinatoires des nombres de Jacobi-Stirling et d'EntringerGelineau, Yoann 24 September 2010 (has links) (PDF)
Cette thèse se divise en 2 grandes parties indépendantes ; la première traitant des nombres de Jacobi-Stirling, la seconde abordant les nombres d'Entringer. La première partie introduit les nombres de Jacobi-Stirling de seconde et de première espèce comme coefficients algébriques dans des relations polynomiales. Nous donnons des interprétations combinatoires de ces nombres, en termes de partitions d'ensembles et de quasi-permutations pour les nombres de seconde espèce, et en termes de permutations pour les nombres de première espèce. Nous étudions également les fonctions génératrices diagonales de ces familles de nombres, ainsi qu'une de leur généralisation sur le modèle des r-nombres de Stirling. La seconde partie introduit les nombres d'Entringer à l'aide de leur interprétation en termes de permutations alternantes. Nous étudions les différentes formules de récurrence vérifiées par ces nombres et généralisons ces résultats à l'aide d'un q-analogue utilisant la statistique d'inversion. Nous verrons également que ces résultats peuvent être étendus à des permutations de forme donnée quelconque. Enfin, nous définissons la notion de famille d'Entringer, et établissons des bijections entre certaines de ces familles. En particulier, nous établissons une bijection reliant les permutations alternantes de premier terme fixé, aux arbres binaires croissants dont l'extrémité du chemin minimal est fixée.
|
90 |
Étude de l'ordre des gènes clusters de gènes et algorithmique des réarrangements /Figeac, Martin Delahaye, Jean-Paul Varré, Jean-Stéphane January 2007 (has links)
Reproduction de : Thèse de doctorat : Informatique : Lille 1 : 2004. / N° d'ordre (Lille 1) : 3565. Titre provenant de la page de titre du document numérisé. Bibliogr. p. 173-177. Index.
|
Page generated in 0.0722 seconds