subject:(Permutations)

Florida State University

1. Zerla, Fredric J. Theorems on multiple transitivity.

Degree: 1960, Florida State University

URL: http://purl.flvc.org/fsu/fd/FSU_historic_AKP2819 ;

►

"The object of this paper is to present a number of theorems concerned with multiple transitivity in groups of permutations, culminating in a theorem of… (more)

Subjects/Keywords: Permutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zerla, F. J. (1960). Theorems on multiple transitivity. (Masters Thesis). Florida State University. Retrieved from http://purl.flvc.org/fsu/fd/FSU_historic_AKP2819 ;

Chicago Manual of Style (16^th Edition):

Zerla, Fredric J. “Theorems on multiple transitivity.” 1960. Masters Thesis, Florida State University. Accessed January 17, 2021. http://purl.flvc.org/fsu/fd/FSU_historic_AKP2819 ;.

MLA Handbook (7^th Edition):

Zerla, Fredric J. “Theorems on multiple transitivity.” 1960. Web. 17 Jan 2021.

Vancouver:

Zerla FJ. Theorems on multiple transitivity. [Internet] [Masters thesis]. Florida State University; 1960. [cited 2021 Jan 17]. Available from: http://purl.flvc.org/fsu/fd/FSU_historic_AKP2819 ;.

Council of Science Editors:

Zerla FJ. Theorems on multiple transitivity. [Masters Thesis]. Florida State University; 1960. Available from: http://purl.flvc.org/fsu/fd/FSU_historic_AKP2819 ;

2. Griffin, Patricia Anne. On the orderly listing of permutations.

Degree: 1969, NC Docks

URL: http://libres.uncg.edu/ir/uncg/f/griffin_patricia_1969.pdf

► D.H. Lehmer states that by an orderly listing of permutations is meant a generation for which it is possible to obtain the k th permutation… (more)

Subjects/Keywords: Permutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Griffin, P. A. (1969). On the orderly listing of permutations. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncg/f/griffin_patricia_1969.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Griffin, Patricia Anne. “On the orderly listing of permutations.” 1969. Thesis, NC Docks. Accessed January 17, 2021. http://libres.uncg.edu/ir/uncg/f/griffin_patricia_1969.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Griffin, Patricia Anne. “On the orderly listing of permutations.” 1969. Web. 17 Jan 2021.

Vancouver:

Griffin PA. On the orderly listing of permutations. [Internet] [Thesis]. NC Docks; 1969. [cited 2021 Jan 17]. Available from: http://libres.uncg.edu/ir/uncg/f/griffin_patricia_1969.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Griffin PA. On the orderly listing of permutations. [Thesis]. NC Docks; 1969. Available from: http://libres.uncg.edu/ir/uncg/f/griffin_patricia_1969.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Université du Québec à Montréal

3. Lavigne, Sébastien. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.

Degree: 2017, Université du Québec à Montréal

URL: http://www.archipel.uqam.ca/9934/1/M15033.pdf

► Depuis quelques années, il y a un intérêt à vouloir trouver et construire des bijections entre l'ensemble des permutations indécomposables et les sous-groupes d'indice fini… (more)

Subjects/Keywords: Bijections; Permutations; Groupes libres; Hypercartes

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lavigne, S. (2017). Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. (Thesis). Université du Québec à Montréal. Retrieved from http://www.archipel.uqam.ca/9934/1/M15033.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lavigne, Sébastien. “Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.” 2017. Thesis, Université du Québec à Montréal. Accessed January 17, 2021. http://www.archipel.uqam.ca/9934/1/M15033.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lavigne, Sébastien. “Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.” 2017. Web. 17 Jan 2021.

Vancouver:

Lavigne S. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. [Internet] [Thesis]. Université du Québec à Montréal; 2017. [cited 2021 Jan 17]. Available from: http://www.archipel.uqam.ca/9934/1/M15033.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lavigne S. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. [Thesis]. Université du Québec à Montréal; 2017. Available from: http://www.archipel.uqam.ca/9934/1/M15033.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Université du Québec à Montréal

4. Lavigne, Sébastien. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.

Degree: 2017, Université du Québec à Montréal

URL: http://archipel.uqam.ca/9934/1/M15033.pdf

► Depuis quelques années, il y a un intérêt à vouloir trouver et construire des bijections entre l'ensemble des permutations indécomposables et les sous-groupes d'indice fini… (more)

Subjects/Keywords: Bijections; Permutations; Groupes libres; Hypercartes

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lavigne, S. (2017). Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. (Thesis). Université du Québec à Montréal. Retrieved from http://archipel.uqam.ca/9934/1/M15033.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lavigne, Sébastien. “Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.” 2017. Thesis, Université du Québec à Montréal. Accessed January 17, 2021. http://archipel.uqam.ca/9934/1/M15033.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lavigne, Sébastien. “Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2.” 2017. Web. 17 Jan 2021.

Vancouver:

Lavigne S. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. [Internet] [Thesis]. Université du Québec à Montréal; 2017. [cited 2021 Jan 17]. Available from: http://archipel.uqam.ca/9934/1/M15033.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lavigne S. Permutations indécomposables et sous-groupes d'indice fini du groupe libre F2. [Thesis]. Université du Québec à Montréal; 2017. Available from: http://archipel.uqam.ca/9934/1/M15033.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

5. Zhang, Fei. Sorting signed permutations by transpositions and reversals.

Degree: Dept. of Computer Science, 2008, University of Victoria

URL: http://hdl.handle.net/1828/524

► Large scale comparative genetic mapping offers exciting prospects for understanding genomic evolution and has recently become of interest in computational molecular biology. The genome rearrangement… (more)

Subjects/Keywords: Permutations; Genomes

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhang, F. (2008). Sorting signed permutations by transpositions and reversals. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/524

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zhang, Fei. “Sorting signed permutations by transpositions and reversals.” 2008. Thesis, University of Victoria. Accessed January 17, 2021. http://hdl.handle.net/1828/524.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zhang, Fei. “Sorting signed permutations by transpositions and reversals.” 2008. Web. 17 Jan 2021.

Vancouver:

Zhang F. Sorting signed permutations by transpositions and reversals. [Internet] [Thesis]. University of Victoria; 2008. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1828/524.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang F. Sorting signed permutations by transpositions and reversals. [Thesis]. University of Victoria; 2008. Available from: http://hdl.handle.net/1828/524

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas State University – San Marcos

6. Wilson, Samuel N. Power domination on permutation graphs.

Degree: MS, Mathematics, 2013, Texas State University – San Marcos

URL: https://digital.library.txstate.edu/handle/10877/12824

► For the purposes of monitoring power networks, power companies use devices known as phase measurement units (PMUs); these monitor the waveform of the various nodes… (more)

Subjects/Keywords: Domination; Graph theory; Permutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wilson, S. N. (2013). Power domination on permutation graphs. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/12824

Chicago Manual of Style (16^th Edition):

Wilson, Samuel N. “Power domination on permutation graphs.” 2013. Masters Thesis, Texas State University – San Marcos. Accessed January 17, 2021. https://digital.library.txstate.edu/handle/10877/12824.

MLA Handbook (7^th Edition):

Wilson, Samuel N. “Power domination on permutation graphs.” 2013. Web. 17 Jan 2021.

Vancouver:

Wilson SN. Power domination on permutation graphs. [Internet] [Masters thesis]. Texas State University – San Marcos; 2013. [cited 2021 Jan 17]. Available from: https://digital.library.txstate.edu/handle/10877/12824.

Council of Science Editors:

Wilson SN. Power domination on permutation graphs. [Masters Thesis]. Texas State University – San Marcos; 2013. Available from: https://digital.library.txstate.edu/handle/10877/12824

Texas State University – San Marcos

7. Wash, Kirsti A. On the bounds of the domination number of permutation graphs.

Degree: MS, Mathematics, 2009, Texas State University – San Marcos

URL: https://digital.library.txstate.edu/handle/10877/12740

No abstract prepared. Advisors/Committee Members: Gu, Weizhen (advisor).

Subjects/Keywords: Domination; Permutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wash, K. A. (2009). On the bounds of the domination number of permutation graphs. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/12740

Chicago Manual of Style (16^th Edition):

Wash, Kirsti A. “On the bounds of the domination number of permutation graphs.” 2009. Masters Thesis, Texas State University – San Marcos. Accessed January 17, 2021. https://digital.library.txstate.edu/handle/10877/12740.

MLA Handbook (7^th Edition):

Wash, Kirsti A. “On the bounds of the domination number of permutation graphs.” 2009. Web. 17 Jan 2021.

Vancouver:

Wash KA. On the bounds of the domination number of permutation graphs. [Internet] [Masters thesis]. Texas State University – San Marcos; 2009. [cited 2021 Jan 17]. Available from: https://digital.library.txstate.edu/handle/10877/12740.

Council of Science Editors:

Wash KA. On the bounds of the domination number of permutation graphs. [Masters Thesis]. Texas State University – San Marcos; 2009. Available from: https://digital.library.txstate.edu/handle/10877/12740

University of Southern California

8. Pantazis, Dimitrios. Statistical signal processing of magnetoencephalography data.

Degree: PhD, Electrical Engineering, 2006, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/28405/rec/6056

► Imaging approaches in MEG typically generate dynamic current density maps (CDMs) on the cortical surface, where the activation in each location is represented by a… (more)

▼ Imaging approaches in MEG typically generate dynamic current density maps (CDMs) on the cortical surface, where the activation in each location is represented by a current dipole. The highly convoluted nature of the human cortex requires the use of many thousands of dipoles for an accurate representation of the cortical surface, and the resulting CDMs are difficult to interpret. As with fMRI images, objective assessment of CDMs requires a principled approach to identifying regions of activation, which involves testing thousands of hypotheses (one per surface element) for statistically significant experimental effects. This raises the possibility of a large number of false positives simply as a result of multiple hypothesis testing. To overcome this problem, we develop statistical procedures that control the familywise error rate, i.e. the chance of one or more false positives under the null hypothesis of no activation. We use random field and permutation methods that consider the spatial dependence of the data, and make inferences based on the global maximum distribution of the image statistics. To satisfy random field assumptions, we must first smooth the CDMs. Since permutation methods are easily generalizable to multidimensional data, we expand them to control the familywise error rate over spatial-temporal-spectral maps. We compare and evaluate the methods on simulated and experimental data, and use them to detect hemispheric language dominance in epileptic patients and morphological differences in brain structures.; Since experimental designs often involve multiple factors and confounding effects, we present the use of general linear modeling theory to model MEG experimental data. We demonstrate the theory in a specific MEG experiment involving a visual spatial cueing paradigm. To extract contrast statistics of attention related alpha activity, we follow a massively univariate approach and model each subject, region of interest, and time-frequency band separately with a novel ANCOVA (analysis of covariance) design, where power in rectangular time-frequency bands forms the observation variables, and baseline power forms the covariate. We also demonstrate the use of false discovery rate, a less conservative alternative to familywise error rate control, to do multiplicity adjustments to our statistics. Advisors/Committee Members: Leahy, Richard M. (Committee Chair), Nayak, Krishna S. (Committee Member), Singh, Manbir (Committee Member).

Subjects/Keywords: magnetoencephalography; permutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pantazis, D. (2006). Statistical signal processing of magnetoencephalography data. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/28405/rec/6056

Chicago Manual of Style (16^th Edition):

Pantazis, Dimitrios. “Statistical signal processing of magnetoencephalography data.” 2006. Doctoral Dissertation, University of Southern California. Accessed January 17, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/28405/rec/6056.

MLA Handbook (7^th Edition):

Pantazis, Dimitrios. “Statistical signal processing of magnetoencephalography data.” 2006. Web. 17 Jan 2021.

Vancouver:

Pantazis D. Statistical signal processing of magnetoencephalography data. [Internet] [Doctoral dissertation]. University of Southern California; 2006. [cited 2021 Jan 17]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/28405/rec/6056.

Council of Science Editors:

Pantazis D. Statistical signal processing of magnetoencephalography data. [Doctoral Dissertation]. University of Southern California; 2006. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/28405/rec/6056

University of Waterloo

9. Chan, Aaron C.S. Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus.

Degree: 2016, University of Waterloo

URL: http://hdl.handle.net/10012/10541

► The problem of map enumeration is one that has been studied intensely for the past half century. Early work on this subject included the works… (more)

▼ The problem of map enumeration is one that has been studied intensely for the past half century. Early work on this subject included the works of Tutte for various types of rooted planar maps and the works of Brown for non-planar maps. Furthermore, the works of Bender, Canfield, and Richmond as well as Bender and Gao give asymptotic results for the enumeration of various types of maps. This subject also attracted the attention of physicists when they independently discovered that map enumeration can be applied to quantum field theory. The results of 't Hooft established the connection between matrix integration and map enumeration, which allowed algebraic techniques to be used. Other examples of this application can be found in the papers of Itzykson and Zuber. One result of particular significance is the Harer-Zagier formula, which gives the genus series for maps with one vertex. This result has been proved many times in the literature, a selection of which includes the proofs of Goulden and Nica, Itzykson and Zuber, Jackson, Kerov, Kontsevich, Lass, Penner, and Zagier. An extension of this result to locally orientable maps on one vertex can be found in Goulden and Jackson, while another extension to two vertex maps can be found in Goulden and Slofstra. In this thesis, we will extend the combinatorial techniques used in the papers of Goulden and Nica and Goulden and Slofstra, so that they can be applied to maps with an arbitrary number of vertices, when the graph being embedded is a tree with loops and multiple edges. This involves defining a new set of combinatorial objects that extends the ones used in Goulden and Slofstra, and develop new techniques for handling these objects. Furthermore, we will simplify some of the techniques and results in the existing literature. Finally, we seek to relate the techniques used in this thesis to techniques in other map enumeration problems, and briefly discuss the potential of applying our techniques to those problems.

Subjects/Keywords: combinatorics; enumeration; maps; permutations; genus

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chan, A. C. S. (2016). Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10541

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chan, Aaron C S. “Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus.” 2016. Thesis, University of Waterloo. Accessed January 17, 2021. http://hdl.handle.net/10012/10541.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chan, Aaron C S. “Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus.” 2016. Web. 17 Jan 2021.

Vancouver:

Chan ACS. Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/10012/10541.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chan ACS. Combinatorial Methods for Enumerating Maps in Surfaces of Arbitrary Genus. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10541

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

10. Pudwell, Lara Kristin. Enumeration schemes for pattern-avoiding words and permutations.

Degree: PhD, Mathematics, 2008, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17374

►

Let p=p₁...p_n and q=q₁...q_m be permutations. We say that p contains q as a pattern if there are indices 1 [less than]= i₁ [less than]… (more)

Subjects/Keywords: Permutations; Mathematics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pudwell, L. K. (2008). Enumeration schemes for pattern-avoiding words and permutations. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17374

Chicago Manual of Style (16^th Edition):

Pudwell, Lara Kristin. “Enumeration schemes for pattern-avoiding words and permutations.” 2008. Doctoral Dissertation, Rutgers University. Accessed January 17, 2021. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17374.

MLA Handbook (7^th Edition):

Pudwell, Lara Kristin. “Enumeration schemes for pattern-avoiding words and permutations.” 2008. Web. 17 Jan 2021.

Vancouver:

Pudwell LK. Enumeration schemes for pattern-avoiding words and permutations. [Internet] [Doctoral dissertation]. Rutgers University; 2008. [cited 2021 Jan 17]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17374.

Council of Science Editors:

Pudwell LK. Enumeration schemes for pattern-avoiding words and permutations. [Doctoral Dissertation]. Rutgers University; 2008. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17374

11. Vong, Vincent. Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations.

Degree: Docteur es, Informatique, 2014, Université Paris-Est

URL: http://www.theses.fr/2014PEST1185

►

Cette thèse se situe au carrefour de la combinatoire et de l'algèbre. Elle se consacre d'une part à traduire des problèmes algébriques en des problèmes… (more)

▼

Cette thèse se situe au carrefour de la combinatoire et de l'algèbre. Elle se consacre d'une part à traduire des problèmes algébriques en des problèmes combinatoires, et inversement, utilise le formalisme algébrique pour traiter des questions combinatoires. Après un rappel des notions classiques de combinatoire et d'algèbres de Hopfavec quelques applications, nous abordons l'étude de certaines statistiques définies sur les permutations : les pics, les vallées, les doubles montées et les doubles descentes, qui sont à la base de la bijection de Françon-Viennot, elle-même débouchant sur une étude combinatoire des polynômes orthogonaux. Nous montrons qu'à partir de ces statistiques, il est possible de construire diverses sous-algèbres ou algèbres quotients de FQSym, une algèbre dont une base est indexée par les permutations. Puis, nous étudions deux suites classiques de combinatoire par une démarche non commutative : les polynômes de Gandhi, un raffinement polynomial des nombres de Genocchi, et les nombres d'Euler, une suite recelant de nombreuses propriétés combinatoires. Nous nous attachons à montrer que l'approche non commutative permet, dans la majeure partie des cas, d'obtenir de manière directe des interprétations d'identités combinatoires. Enfin, inversement, certaines questions de nature algébrique peuvent être abordées d'un point de vue combinatoire. Ainsi, à travers l'étude des algèbres dendriformes, des algèbres tridendriformes, et des quadrialgèbres, nous prouvons des questions de liberté à propos de ces algèbres grâce à la combinatoire des arbres étiquetés

This thesis is at the crossroads between combinatorics and algebra. It studies some algebraic problems from a combinatorial point of view, and conversely, some combinatorial problems have an algebraic approach which enables us tosolve them. In the first part, some classical statistics on permutations are studied: the peaks, the valleys, the double rises, and the double descents. We show that we can build sub algebras and quotients of FQSym, an algebra which basis is indexed by permutations. Then, we study classical combinatorial sequences such as Gandhi polynomials, refinements of Genocchi numbers, and Euler numbers in a non commutative way. In particular, we see that combinatorial interpretations arise naturally from the non commutative approach. Finally, we solve some freeness problems about dendriform algebras, tridendriform algebras and quadrialgebras thanks to combinatorics of some labelled trees

Advisors/Committee Members: Novelli, Jean-Christophe (thesis director).

Subjects/Keywords: Algèbres de hopf combinatoires; Permutations; Opérades; Combinatorial hopf algebras; Permutations; Operads

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Vong, V. (2014). Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2014PEST1185

Chicago Manual of Style (16^th Edition):

Vong, Vincent. “Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations.” 2014. Doctoral Dissertation, Université Paris-Est. Accessed January 17, 2021. http://www.theses.fr/2014PEST1185.

MLA Handbook (7^th Edition):

Vong, Vincent. “Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations.” 2014. Web. 17 Jan 2021.

Vancouver:

Vong V. Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations. [Internet] [Doctoral dissertation]. Université Paris-Est; 2014. [cited 2021 Jan 17]. Available from: http://www.theses.fr/2014PEST1185.

Council of Science Editors:

Vong V. Combinatoire algébrique des permutations et de leurs généralisations : Algebraic combinatorics of permutations and their generalisations. [Doctoral Dissertation]. Université Paris-Est; 2014. Available from: http://www.theses.fr/2014PEST1185

University of Delaware

12. Castillo, Chris. A method for constructing groups of permutation polynomials and its application to projective geometry.

Degree: PhD, University of Delaware, Department of Mathematical Sciences, 2015, University of Delaware

URL: http://udspace.udel.edu/handle/19716/17430

► This dissertation presents original work on permutation polynomials over finite fields. From a consideration of the proof of Cayley's theorem, it is clear that any… (more)

Subjects/Keywords: Permutations.; Polynomials.; Finite fields (Algebra); Cayley algebras.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Castillo, C. (2015). A method for constructing groups of permutation polynomials and its application to projective geometry. (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/17430

Chicago Manual of Style (16^th Edition):

Castillo, Chris. “A method for constructing groups of permutation polynomials and its application to projective geometry.” 2015. Doctoral Dissertation, University of Delaware. Accessed January 17, 2021. http://udspace.udel.edu/handle/19716/17430.

MLA Handbook (7^th Edition):

Castillo, Chris. “A method for constructing groups of permutation polynomials and its application to projective geometry.” 2015. Web. 17 Jan 2021.

Vancouver:

Castillo C. A method for constructing groups of permutation polynomials and its application to projective geometry. [Internet] [Doctoral dissertation]. University of Delaware; 2015. [cited 2021 Jan 17]. Available from: http://udspace.udel.edu/handle/19716/17430.

Council of Science Editors:

Castillo C. A method for constructing groups of permutation polynomials and its application to projective geometry. [Doctoral Dissertation]. University of Delaware; 2015. Available from: http://udspace.udel.edu/handle/19716/17430

University of Pennsylvania

13. Poh, Wei Quan Julius. Shape and Other Properties of 1324-Avoiding Permutations.

Degree: 2015, University of Pennsylvania

URL: https://repository.upenn.edu/edissertations/1950

► Of the three Wilf classes of permutations avoiding a single pattern of length 4, the exact enumerations for two of them were found by Gessel… (more)

Subjects/Keywords: 1324; avoiding; pattern; permutations; shape; Mathematics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Poh, W. Q. J. (2015). Shape and Other Properties of 1324-Avoiding Permutations. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/1950

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Poh, Wei Quan Julius. “Shape and Other Properties of 1324-Avoiding Permutations.” 2015. Thesis, University of Pennsylvania. Accessed January 17, 2021. https://repository.upenn.edu/edissertations/1950.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Poh, Wei Quan Julius. “Shape and Other Properties of 1324-Avoiding Permutations.” 2015. Web. 17 Jan 2021.

Vancouver:

Poh WQJ. Shape and Other Properties of 1324-Avoiding Permutations. [Internet] [Thesis]. University of Pennsylvania; 2015. [cited 2021 Jan 17]. Available from: https://repository.upenn.edu/edissertations/1950.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Poh WQJ. Shape and Other Properties of 1324-Avoiding Permutations. [Thesis]. University of Pennsylvania; 2015. Available from: https://repository.upenn.edu/edissertations/1950

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Johnson, Emily Nance. Permutation tests for mixed paired and two-sample designs.

Degree: 2018, NC Docks

URL: http://libres.uncg.edu/ir/uncg/f/Johnson_uncg_0154M_12520.pdf

► In this thesis we propose permutation tests of previously developed statistics for the case of mixed paired and two-sample data. We also explore the different… (more)

Subjects/Keywords: Permutations; Nonparametric statistics; Missing observations (Statistics)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Johnson, E. N. (2018). Permutation tests for mixed paired and two-sample designs. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncg/f/Johnson_uncg_0154M_12520.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Johnson, Emily Nance. “Permutation tests for mixed paired and two-sample designs.” 2018. Thesis, NC Docks. Accessed January 17, 2021. http://libres.uncg.edu/ir/uncg/f/Johnson_uncg_0154M_12520.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Johnson, Emily Nance. “Permutation tests for mixed paired and two-sample designs.” 2018. Web. 17 Jan 2021.

Vancouver:

Johnson EN. Permutation tests for mixed paired and two-sample designs. [Internet] [Thesis]. NC Docks; 2018. [cited 2021 Jan 17]. Available from: http://libres.uncg.edu/ir/uncg/f/Johnson_uncg_0154M_12520.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Johnson EN. Permutation tests for mixed paired and two-sample designs. [Thesis]. NC Docks; 2018. Available from: http://libres.uncg.edu/ir/uncg/f/Johnson_uncg_0154M_12520.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. Widmer, Steven. Topics in word complexity : Autour de la Complexité des mots.

Degree: Docteur es, Mathématiques, 2010, Université Claude Bernard – Lyon I

URL: http://www.theses.fr/2010LYO10287

►

Les principaux sujets d'intérêt de cette thèse concerneront deux notions de la complexité d'un mot infini : la complexité abélienne et la complexité de permutation.… (more)

▼

Les principaux sujets d'intérêt de cette thèse concerneront deux notions de la complexité d'un mot infini : la complexité abélienne et la complexité de permutation. La complexité abélienne a été étudiée durant les dernières décennies. La complexité de permutation est, elle, une forme de complexité des mots relativement nouvelle qui associe à chaque mot apériodique de manière naturelle une permutation infinie. Nous nous pencherons sur deux sujets dans le domaine de la complexité abélienne. Dans un premier temps, nous nous intéresserons à une notion abélienne de la maximal pattern complexity définie par T. Kamae. Deuxièmement, nous analyserons une limite supérieure de cette complexité pour les mots C-équilibré. Dans le domaine de la complexité de permutation des mots apériodiques binaires, nous établissons une formule pour la complexité de permutation du mot de Thue-Morse, conjecturée par Makarov, en étudiant la combinatoire des sous-permutations sous l'action du morphisme de Thue-Morse. Par la suite, nous donnons une méthode générale pour calculer la complexité de permutation de l'image de certains mots sous l'application du morphisme du doublement des lettres. Finalement, nous déterminons la complexité de permutation de l'image du mot de Thue-Morse et d'un mot Sturmien sous l'application du morphisme du doublement des lettres.

The main topics of interest in this thesis will be two types of complexity, abelian complexity and permutation complexity. Abelian complexity has been investigated over the past decades. Permutation complexity is a relatively new type of word complexity which investigates lexicographical ordering of shifts of an aperiodic word. We will investigate two topics in the area of abelian complexity. Firstly we will consider an abelian variation of maximal pattern complexity. Secondly we consider an upper bound for words with the C-balance property. In the area of permutation complexity, we compute the permutation complexity function for a number of words. A formula for the complexity of Thue-Morse word is established by studying patterns in subpermutations and the action of the Thue-Morse morphism on the subpermutations. We then give a method to calculate the complexity of the image of certain words under the doubling map. The permutation complexity function of the image of the Thue-Morse word under the doubling map and the image of a Sturmian word under the doubling map are established.

Advisors/Committee Members: Zamboni, Luca (thesis director), Glen, Amy (thesis director).

Subjects/Keywords: Mots infinis; Complexités; Palindromes; Infinies permutations; Infinite words; Complexity; Palindrome; Infinite permutations; 510

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Widmer, S. (2010). Topics in word complexity : Autour de la Complexité des mots. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2010LYO10287

Chicago Manual of Style (16^th Edition):

Widmer, Steven. “Topics in word complexity : Autour de la Complexité des mots.” 2010. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed January 17, 2021. http://www.theses.fr/2010LYO10287.

MLA Handbook (7^th Edition):

Widmer, Steven. “Topics in word complexity : Autour de la Complexité des mots.” 2010. Web. 17 Jan 2021.

Vancouver:

Widmer S. Topics in word complexity : Autour de la Complexité des mots. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2010. [cited 2021 Jan 17]. Available from: http://www.theses.fr/2010LYO10287.

Council of Science Editors:

Widmer S. Topics in word complexity : Autour de la Complexité des mots. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2010. Available from: http://www.theses.fr/2010LYO10287

University of Miami

16. Hyatt, Matthew. Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups.

Degree: PhD, Mathematics (Arts and Sciences), 2011, University of Miami

URL: https://scholarlyrepository.miami.edu/oa_dissertations/609

► Eulerian quasisymmetric functions were introduced by Shareshian and Wachs in order to obtain a q-analog of Euler's exponential generating function formula for the Eulerian polynomials.… (more)

Subjects/Keywords: Signed permutations; Colored permutations; Permutation statistics; Eulerian polynomials; Quasisymmetric functions; Symmetric functions

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hyatt, M. (2011). Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups. (Doctoral Dissertation). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_dissertations/609

Chicago Manual of Style (16^th Edition):

Hyatt, Matthew. “Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups.” 2011. Doctoral Dissertation, University of Miami. Accessed January 17, 2021. https://scholarlyrepository.miami.edu/oa_dissertations/609.

MLA Handbook (7^th Edition):

Hyatt, Matthew. “Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups.” 2011. Web. 17 Jan 2021.

Vancouver:

Hyatt M. Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups. [Internet] [Doctoral dissertation]. University of Miami; 2011. [cited 2021 Jan 17]. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/609.

Council of Science Editors:

Hyatt M. Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups. [Doctoral Dissertation]. University of Miami; 2011. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/609

17. Nunge, Arthur. Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP.

Degree: Docteur es, Informatique, 2018, Université Paris-Est

URL: http://www.theses.fr/2018PESC1116

►

Cette thèse se situe à l'interface de la combinatoire énumérative et algébrique et porte sur l'étude des probabilités du processus d'exclusion partiellement asymétrique (PASEP).Dans un… (more)

▼

Cette thèse se situe à l'interface de la combinatoire énumérative et algébrique et porte sur l'étude des probabilités du processus d'exclusion partiellement asymétrique (PASEP).Dans un premier temps, nous démontrons bijectivement une conjecture de Novelli-Thibon-Williams concernant l'interprétation combinatoire de coefficients de matrices de transition dans l'algèbre des fonctions symétriques non-commutatives. Plus précisément, ces matrices expriment les coefficients de changement de base des bases complètes et rubans d'une part vers les bases monomiales et fondamentales introduites par Tevlin d'autre part. Les coefficients de ces matrices donnent un raffinement des probabilités du PASEP et sont décrits en utilisant de nouvelles statistiques sur les permutations. La conjecture stipule que ce raffinement peut se formuler via des statistiques déjà connues dans le monde du PASEP. Nous nous intéressons ensuite à une généralisation du PASEP avec deux types de particules dans le modèle : le 2-PASEP. Nous donnons ainsi plusieurs interprétations combinatoires des probabilités de ce modèle. Pour ce faire, nous introduisons une nouvelle famille de chemins généralisant les histoires de Laguerre : les histoires de Laguerre marquées. Nous généralisons ensuite la bijection de Françon-Viennot entre les histoires de Laguerre et les permutations pour définir les permutations partiellement signées qui nous donneront une seconde interprétation combinatoire de ces probabilités. Dans une troisième partie, nous généralisons les travaux de Tevlin afin de définir des bases monomiales et fondamentales dans l'algèbre des compositions segmentées. Afin de décrire les matrices de changement de base entre ces bases et d'autres déjà connues dans cette algèbre, nous définissons une algèbre indexée par les permutations partiellement signées en utilisant les statistiques définies précédemment pour décrire la combinatoire du 2-PASEP. Nous définissons également des q-analogues de ces bases afin de faire le lien avec les probabilités du 2-PASEP en fonction du paramètre q de ce modèle. Enfin, en utilisant le fait que les permutations partiellement signées sont en bijection avec les permutations segmentées, nous nous inspirons des statistiques définies précédemment pour introduire des descentes sur ces objets et ainsi définir une généralisation des polynômes eulériens sur les permutations segmentées. Pour étudier ces polynômes, nous utilisons les outils algébriques développés dans la partie précédente

This thesis comes within the scope of enumerative and algebraic combinatorics and studies the probabilities of the partially asymmetric exclusion process (PASEP).First, we bijectively prove a conjecture of Novelli-Thibon-Williams concerning the combinatorial interpretation of the entries of the transition matrices between some bases of the noncommutative symmetric functions algebra. More precisely, these matrices correspond to the transition matrices of, on the one hand the complete and ribbon bases and on the other hand the monomial and fundamental…

Advisors/Committee Members: Novelli, Jean-Christophe (thesis director).

Subjects/Keywords: Combinatoire; Algèbre de Hopf; Bijections; Pasep; Permutations; Combinatorics; Hopf algebra; Bijections; Pasep; Permutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nunge, A. (2018). Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2018PESC1116

Chicago Manual of Style (16^th Edition):

Nunge, Arthur. “Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP.” 2018. Doctoral Dissertation, Université Paris-Est. Accessed January 17, 2021. http://www.theses.fr/2018PESC1116.

MLA Handbook (7^th Edition):

Nunge, Arthur. “Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP.” 2018. Web. 17 Jan 2021.

Vancouver:

Nunge A. Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP. [Internet] [Doctoral dissertation]. Université Paris-Est; 2018. [cited 2021 Jan 17]. Available from: http://www.theses.fr/2018PESC1116.

Council of Science Editors:

Nunge A. Combinatoire énumérative et algébrique autour du PASEP : Enumerative and algebraic combinatorics related to the PASEP. [Doctoral Dissertation]. Université Paris-Est; 2018. Available from: http://www.theses.fr/2018PESC1116

Universidade Estadual de Campinas

18. Silva, Jordan Lambert, 1989-. Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert.

Degree: 2017, Universidade Estadual de Campinas

URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/330848

► Abstract: This thesis presents combinatorial aspects related to topology/geometry of Schubert varieties. The first problem consists to obtain an explicit formula to compute the coefficients… (more)

Subjects/Keywords: Schubert, Variedades de; Topologia algébrica; Permutações (Matemática); Permutações evitando padrões (Matemática); Schubert varieties; Algebraic topology; Permutations (Mathematics); Pattern-avoiding permutations (Mathematics)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Silva, Jordan Lambert, 1. (2017). Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/330848

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Silva, Jordan Lambert, 1989-. “Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert.” 2017. Thesis, Universidade Estadual de Campinas. Accessed January 17, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/330848.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Silva, Jordan Lambert, 1989-. “Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert.” 2017. Web. 17 Jan 2021.

Vancouver:

Silva, Jordan Lambert 1. Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert. [Internet] [Thesis]. Universidade Estadual de Campinas; 2017. [cited 2021 Jan 17]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/330848.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Silva, Jordan Lambert 1. Combinatorics on Schubert varieties = Combinatória em variedades de Schubert: Combinatória em variedades de Schubert. [Thesis]. Universidade Estadual de Campinas; 2017. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/330848

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

19. Sage, Marc. Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers.

Degree: Docteur es, Informatique, 2012, Université Paris-Est

URL: http://www.theses.fr/2012PEST1102

►

Ce mémoire se veut une synthèse, destinée à la communauté combinatoricienne, de quelques outils développés pour aborder le problème d'Hurwitz ainsi qu'une présentation des résultats… (more)

▼

Ce mémoire se veut une synthèse, destinée à la communauté combinatoricienne, de quelques outils développés pour aborder le problème d'Hurwitz ainsi qu'une présentation des résultats récoltés. Le problème d'Hurwitz consiste à évaluer, dans un groupe symétrique, le nombre (dit d'Hurwitz) de factorisations transitives de la permutation identité dont on a imposé le type cyclique des facteurs. Nous décrivons tout d'abord les origines topologiques de ce problème à travers le dénombrement des revêtements ramifiés de la sphère. Nous présentons également un cadre algébrique naturel, le monoïde des permutations scindées, qui permet d'exprimer les nombres d'Hurwitz comme coefficients de structure de l'algèbre de ce monoïde, plus précisément de la sous-algèbre engendrée par les classes de conjugaison, dont une base naturelle est indexée par les multipartitions (ou partitions scindées). La théorie des représentations de cette algèbre fournit un algorithme pour calculer les nombres d'Hurwitz à une partition dont la complexité (minimale, uniforme et exponentielle) est bien meilleure que celle d'une approche naïve. Ce cadre algébrique donne par ailleurs une formule décrivant les séries d'Hurwitz à plusieurs partitions comme polynômes en les séries d'Hurwitz à une seule partition. Nous présentons secondement le cadre géométrique dans lequel s'expriment d'une part la formule ELSV, laquelle décrit les nombres d'Hurwitz à une partition comme fonctions de certaines intégrales, d'autre part un théorème de M. Kazarian exprimant les séries de Hurwitz à une partition comme polynômes en certaines séries formelles dont l'étude asymptotique est achevée. Une fois décrit le fonctionnement de ce cadre intégral, nous récoltons l'asymptotique de tous les nombres d'Hurwitz

This thesis is meant to be a digest, adressed to the combinatorician community, of some tools developped to tackle the problem of Hurwitz, as well as an exhibition of the thus-harvested results. The problem of Hurwitz consists of computing, in a symmetric group, the (so-called Hurwitz) number of transitive factorisations of the identity permutation whose factors have prescribed cyclic types. We first describe the topological layout of this problem through the enumeration of the ramified coverings of the sphere. We also present a natural algebraic frame, the monoid of split permutations, which allows to describe Hurwitz numbers as structure coeffcients of the algebra of this monoid, more precisely of the subalgebra spanned by the conjugacy classes, whose natural basis is indexed by multipartitions (or split partitions). The representation theory of this algebra yields an algoithm to compute one-partition Hurwitz numbers whose complexity (minimal, uniform and exponential) is far better than that of a naive edging about. This algebraic frame yields a formula describing several-partition Hurwitz series as polynomials in one-partition Hurwitz series. We secondly present the geometric frame in which are been expressed on the one hand the ELSV formula, which describes one-partition…

Advisors/Committee Members: Novelli, Jean-Christophe (thesis director).

Subjects/Keywords: Nombres d'Hurwitz; Factorisations transitives; Asymptotique; Formule ELSV; Permutations scindées; Multipartitions; Hurwitz numbers; Transitive factorisations; Asymptotics; ELSV formula; Split permutations; Multipartitions

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sage, M. (2012). Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2012PEST1102

Chicago Manual of Style (16^th Edition):

Sage, Marc. “Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers.” 2012. Doctoral Dissertation, Université Paris-Est. Accessed January 17, 2021. http://www.theses.fr/2012PEST1102.

MLA Handbook (7^th Edition):

Sage, Marc. “Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers.” 2012. Web. 17 Jan 2021.

Vancouver:

Sage M. Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers. [Internet] [Doctoral dissertation]. Université Paris-Est; 2012. [cited 2021 Jan 17]. Available from: http://www.theses.fr/2012PEST1102.

Council of Science Editors:

Sage M. Combinatoire algébrique et géométrique des nombres de Hurwitz : Algebraic and geometric combinatorics of Hurwitz numbers. [Doctoral Dissertation]. Université Paris-Est; 2012. Available from: http://www.theses.fr/2012PEST1102

20. Bahier, Valentin. Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices.

Degree: Docteur es, Mathématiques appliquées, 2018, Université Toulouse III – Paul Sabatier

URL: http://www.theses.fr/2018TOU30069

►

Dans cette thèse, nous nous intéressons à des matrices aléatoires en lien avec des permutations. Nous abordons l'étude de leurs spectres de plusieurs manières, et… (more)

▼

Dans cette thèse, nous nous intéressons à des matrices aléatoires en lien avec des permutations. Nous abordons l'étude de leurs spectres de plusieurs manières, et à différentes échelles d'observation. Dans un premier temps, nous prolongeons l'étude de Wieand à propos des nombres de valeurs propres appartenant à certains arcs fixés du cercle unité. Pour cela nous tirons parti des travaux réalisés par Ben Arous et Dang sur les statistiques linéaires du spectre de matrices de permutation pour une famille de lois à un paramètre englobant le cas de la loi uniforme sur le groupe symétrique, appelée famille des lois d'Ewens. Une partie innovante de notre travail réside dans la généralisation à des arcs non nécessairement fixés. Nous obtenons en effet des résultats similaires en autorisant les longueurs des arcs à décroître lentement vers zéro avec la taille des matrices. Dans un deuxième temps, nous regardons le spectre à échelle microscopique. En nous inspirant des travaux de Najnudel et Nikeghbali en rapport avec la convergence de mesures empiriques des angles propres normalisés, nous commençons par donner un sens à la convergence en terme de comptages de points sur des intervalles fixés. A partir du processus ponctuel limite, nous montrons que le nombre de points dans un intervalle a des fluctuations asymptotiquement gaussiennes lorsque la longueur de l'intervalle tend vers l'infini. Enfin, nous adaptons certains résultats de Chhaibi, Najnudel et Nikeghbali sur le polynôme caractéristique de matrices du CUE à échelle microscopique, et les développons dans notre cadre. De manière analogue mais avec d'autres techniques de preuves, nous obtenons des convergences des polynômes caractéristiques vers des fonctions entières, et cela pour une grande famille de lois pour le tirage des permutations, incluant les lois d'Ewens.

In this thesis, our goal is to study random matrices related to permutations. We tackle the study of their spectra in various ways, and at different scales. First, we extend the work of Wieand about the numbers of eigenvalues lying in some fixed arcs of the unit circle. We take advantage of the results of Ben Arous and Dang on the linear statistics of the spectrum of permutation matrices for a one-parameter family of deformations of the uniform law on the symmetric group, called Ewens' measures. One of the most innovative parts of our work is the generalization to non-fixed arcs. Indeed we get similar results when we let the lengths of the arcs decrease to zero slower than 1/n. Then, we look at the spectrum at microscopic scale. Inspired by the work of Najnudel and Nikeghbali about the convergence of empirical measures of rescaled eigenangles, we give a meaning to the convergence in terms of indicator functions of intervals. From the limiting point process, we show that the number of points in any interval is asymptotically normal as the length of the interval goes to infinity. Finally, we adapt some results of Chhaibi, Najnudel and Nikeghbali on the characteristic polynomial of the CUE at microscopic…

Advisors/Committee Members: Najnudel, Joseph (thesis director).

Subjects/Keywords: Matrices aléatoires; Permutations aléatoires; Valeurs propres; Processus ponctuels; Fluctuations asymptotiques; Random matrices; Random permutations; Point processes; Asymptotic fluctuations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bahier, V. (2018). Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices. (Doctoral Dissertation). Université Toulouse III – Paul Sabatier. Retrieved from http://www.theses.fr/2018TOU30069

Chicago Manual of Style (16^th Edition):

Bahier, Valentin. “Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices.” 2018. Doctoral Dissertation, Université Toulouse III – Paul Sabatier. Accessed January 17, 2021. http://www.theses.fr/2018TOU30069.

MLA Handbook (7^th Edition):

Bahier, Valentin. “Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices.” 2018. Web. 17 Jan 2021.

Vancouver:

Bahier V. Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices. [Internet] [Doctoral dissertation]. Université Toulouse III – Paul Sabatier; 2018. [cited 2021 Jan 17]. Available from: http://www.theses.fr/2018TOU30069.

Council of Science Editors:

Bahier V. Spectre de matrices de permutation aléatoires : Spectrum of random permutation matrices. [Doctoral Dissertation]. Université Toulouse III – Paul Sabatier; 2018. Available from: http://www.theses.fr/2018TOU30069

21. Korba, Anna. Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes.

Degree: Docteur es, Mathématiques appliquées, 2018, Université Paris-Saclay (ComUE)

URL: http://www.theses.fr/2018SACLT009

► Les données de classement, c.à. d. des listes ordonnées d'objets, apparaissent naturellement dans une grande variété de situations, notamment lorsque les données proviennent d’activités humaines… (more)

▼ Les données de classement, c.à. d. des listes ordonnées d'objets, apparaissent naturellement dans une grande variété de situations, notamment lorsque les données proviennent d’activités humaines (bulletins de vote d'élections, enquêtes d'opinion, résultats de compétitions) ou dans des applications modernes du traitement de données (moteurs de recherche, systèmes de recommendation). La conception d'algorithmes d'apprentissage automatique, adaptés à ces données, est donc cruciale. Cependant, en raison de l’absence de structure vectorielle de l’espace des classements et de sa cardinalité explosive lorsque le nombre d'objets augmente, la plupart des méthodes classiques issues des statistiques et de l’analyse multivariée ne peuvent être appliquées directement. Par conséquent, la grande majorité de la littérature repose sur des modèles paramétriques. Dans cette thèse, nous proposons une théorie et des méthodes non paramétriques pour traiter les données de classement. Notre analyse repose fortement sur deux astuces principales. La première est l’utilisation poussée de la distance du tau de Kendall, qui décompose les classements en comparaisons par paires. Cela nous permet d'analyser les distributions sur les classements à travers leurs marginales par paires et à travers une hypothèse spécifique appelée transitivité, qui empêche les cycles dans les préférences de se produire. La seconde est l'utilisation des fonctions de représentation adaptées aux données de classements, envoyant ces dernières dans un espace vectoriel. Trois problèmes différents, non supervisés et supervisés, ont été abordés dans ce contexte: l'agrégation de classement, la réduction de dimensionnalité et la prévision de classements avec variables explicatives.La première partie de cette thèse se concentre sur le problème de l'agrégation de classements, dont l'objectif est de résumer un ensemble de données de classement par un classement consensus. Parmi les méthodes existantes pour ce problème, la méthode d'agrégation de Kemeny se démarque. Ses solutions vérifient de nombreuses propriétés souhaitables, mais peuvent être NP-difficiles à calculer. Dans cette thèse, nous avons étudié la complexité de ce problème de deux manières. Premièrement, nous avons proposé une méthode pour borner la distance du tau de Kendall entre tout candidat pour le consensus (généralement le résultat d'une procédure efficace) et un consensus de Kemeny, sur tout ensemble de données. Nous avons ensuite inscrit le problème d'agrégation de classements dans un cadre statistique rigoureux en le reformulant en termes de distributions sur les classements, et en évaluant la capacité de généralisation de consensus de Kemeny empiriques.La deuxième partie de cette théorie est consacrée à des problèmes d'apprentissage automatique, qui se révèlent être étroitement liés à l'agrégation de classement. Le premier est la réduction de la dimensionnalité pour les données de classement, pour lequel nous proposons une approche de transport optimal, pour approximer une distribution sur les classements par… Advisors/Committee Members: Clémençon, Stéphan (thesis director).

Subjects/Keywords: Statistiques; Apprentissage automatiques; Classements; Agrégation; Permutations; Comparaisons par paires; Statistics; Machine Learning; Ranking; Aggregation; Permutations; Pairwise comparisons

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Korba, A. (2018). Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2018SACLT009

Chicago Manual of Style (16^th Edition):

Korba, Anna. “Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes.” 2018. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed January 17, 2021. http://www.theses.fr/2018SACLT009.

MLA Handbook (7^th Edition):

Korba, Anna. “Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes.” 2018. Web. 17 Jan 2021.

Vancouver:

Korba A. Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2018. [cited 2021 Jan 17]. Available from: http://www.theses.fr/2018SACLT009.

Council of Science Editors:

Korba A. Learning from ranking data : theory and methods : Apprendre des données de classement : théorie et méthodes. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2018. Available from: http://www.theses.fr/2018SACLT009

University of California – San Diego

22. Pan, Ran. Block patterns in permutations and words and generalized clusters.

Degree: Mathematics, 2016, University of California – San Diego

URL: http://www.escholarship.org/uc/item/18w5s22b

► Goulden and Jackson introduced a very powerful method to study the distributions ofcertain consecutive patterns in permutations, words, and other combinatorial objects which isnow called… (more)

Subjects/Keywords: Mathematics; arrays; consecutive patterns; enumerative combinatorics; generalized clusters; permutations; words

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pan, R. (2016). Block patterns in permutations and words and generalized clusters. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/18w5s22b

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Pan, Ran. “Block patterns in permutations and words and generalized clusters.” 2016. Thesis, University of California – San Diego. Accessed January 17, 2021. http://www.escholarship.org/uc/item/18w5s22b.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Pan, Ran. “Block patterns in permutations and words and generalized clusters.” 2016. Web. 17 Jan 2021.

Vancouver:

Pan R. Block patterns in permutations and words and generalized clusters. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2021 Jan 17]. Available from: http://www.escholarship.org/uc/item/18w5s22b.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pan R. Block patterns in permutations and words and generalized clusters. [Thesis]. University of California – San Diego; 2016. Available from: http://www.escholarship.org/uc/item/18w5s22b

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universidade Estadual de Campinas

23. Garcia, Heitor Amaral, 1991-. O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations.

Degree: 2017, Universidade Estadual de Campinas

URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/325395

► Abstract: In this dissertation several Combinatorial Analysis problems (permutations, arrangements and combinations) will be solved without the use of formulas, in a natural and logical… (more)

Subjects/Keywords: Análise combinatória; Combinações (Matemática); Permutações (Matemática); Combinatorial analysis; Combinations; Permutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Garcia, Heitor Amaral, 1. (2017). O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/325395

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Garcia, Heitor Amaral, 1991-. “O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations.” 2017. Thesis, Universidade Estadual de Campinas. Accessed January 17, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/325395.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Garcia, Heitor Amaral, 1991-. “O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations.” 2017. Web. 17 Jan 2021.

Vancouver:

Garcia, Heitor Amaral 1. O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations. [Internet] [Thesis]. Universidade Estadual de Campinas; 2017. [cited 2021 Jan 17]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/325395.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Garcia, Heitor Amaral 1. O ensino da análise combinatória através de situações problema: Teaching combinatorial analysis through problem situations. [Thesis]. Universidade Estadual de Campinas; 2017. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/325395

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

24. El-Zein, Hicham. Space Efficient Data Structures and Algorithms in the Word-RAM Model.

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/13200

► In modern computation the volume of data-sets has increased dramatically. Since the majority of these data-sets are stored in internal memory, reducing their storage requirement… (more)

Subjects/Keywords: Algorithms; Data Structures; Space Efficient; Range Searching; Permutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

El-Zein, H. (2018). Space Efficient Data Structures and Algorithms in the Word-RAM Model. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13200

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

El-Zein, Hicham. “Space Efficient Data Structures and Algorithms in the Word-RAM Model.” 2018. Thesis, University of Waterloo. Accessed January 17, 2021. http://hdl.handle.net/10012/13200.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

El-Zein, Hicham. “Space Efficient Data Structures and Algorithms in the Word-RAM Model.” 2018. Web. 17 Jan 2021.

Vancouver:

El-Zein H. Space Efficient Data Structures and Algorithms in the Word-RAM Model. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/10012/13200.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

El-Zein H. Space Efficient Data Structures and Algorithms in the Word-RAM Model. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13200

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Johannesburg

25. Shongwe, Thokozani Calvin. Synchronization with permutation codes and Reed-Solomon codes.

Degree: 2014, University of Johannesburg

URL: http://hdl.handle.net/10210/12157

►

D.Ing. (Electrical And Electronic Engineering)

We address the issue of synchronization, using sync-words (or markers), for encoded data. We focus on data that is encoded… (more)

Subjects/Keywords: Coding theory; Synchronization; Data transmission systems; Reed-Solomon codes; Permutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shongwe, T. C. (2014). Synchronization with permutation codes and Reed-Solomon codes. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/12157

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Shongwe, Thokozani Calvin. “Synchronization with permutation codes and Reed-Solomon codes.” 2014. Thesis, University of Johannesburg. Accessed January 17, 2021. http://hdl.handle.net/10210/12157.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Shongwe, Thokozani Calvin. “Synchronization with permutation codes and Reed-Solomon codes.” 2014. Web. 17 Jan 2021.

Vancouver:

Shongwe TC. Synchronization with permutation codes and Reed-Solomon codes. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/10210/12157.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shongwe TC. Synchronization with permutation codes and Reed-Solomon codes. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/12157

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Johannesburg

26. Ouahada, Khmaies Taher. Spectral shaping and distance mapping with permutation sequences.

Degree: 2012, University of Johannesburg

URL: http://hdl.handle.net/10210/4800

►

D.Ing.

In this thesis we combined two techniques, namely a spectral shaping technique and a distance-preserving mapping technique to design new codes with both special… (more)

Subjects/Keywords: Mappings (Mathematics); Error-correcting codes (Information theory); Permutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ouahada, K. T. (2012). Spectral shaping and distance mapping with permutation sequences. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/4800

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ouahada, Khmaies Taher. “Spectral shaping and distance mapping with permutation sequences.” 2012. Thesis, University of Johannesburg. Accessed January 17, 2021. http://hdl.handle.net/10210/4800.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ouahada, Khmaies Taher. “Spectral shaping and distance mapping with permutation sequences.” 2012. Web. 17 Jan 2021.

Vancouver:

Ouahada KT. Spectral shaping and distance mapping with permutation sequences. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/10210/4800.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ouahada KT. Spectral shaping and distance mapping with permutation sequences. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/4800

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

California State University – San Bernardino

27. Herrera, Diana. Homormophic Images and their Isomorphism Types.

Degree: MAin Mathematics, Mathematics, 2014, California State University – San Bernardino

URL: https://scholarworks.lib.csusb.edu/etd/37

► In this thesis we have presented original homomorphic images of permutations and monomial progenitors. In some cases we have used the double coset enumeration… (more)

Subjects/Keywords: homomorphic images of permutations and monomial progenitors; Algebra

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Herrera, D. (2014). Homormophic Images and their Isomorphism Types. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd/37

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Herrera, Diana. “Homormophic Images and their Isomorphism Types.” 2014. Thesis, California State University – San Bernardino. Accessed January 17, 2021. https://scholarworks.lib.csusb.edu/etd/37.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Herrera, Diana. “Homormophic Images and their Isomorphism Types.” 2014. Web. 17 Jan 2021.

Vancouver:

Herrera D. Homormophic Images and their Isomorphism Types. [Internet] [Thesis]. California State University – San Bernardino; 2014. [cited 2021 Jan 17]. Available from: https://scholarworks.lib.csusb.edu/etd/37.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Herrera D. Homormophic Images and their Isomorphism Types. [Thesis]. California State University – San Bernardino; 2014. Available from: https://scholarworks.lib.csusb.edu/etd/37

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Manitoba

28. Al-Meanazel, Ayat. The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets.

Degree: Statistics, 2015, University of Manitoba

URL: http://hdl.handle.net/1993/30872

► The distribution theory of runs and patterns has a long and rich history. In this dissertation we study the distribution of some run-related statistics in… (more)

Subjects/Keywords: Permutations; Multi-sets; Markov chain; Longest Increasing Subsequence

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Al-Meanazel, A. (2015). The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/30872

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Al-Meanazel, Ayat. “The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets.” 2015. Thesis, University of Manitoba. Accessed January 17, 2021. http://hdl.handle.net/1993/30872.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Al-Meanazel, Ayat. “The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets.” 2015. Web. 17 Jan 2021.

Vancouver:

Al-Meanazel A. The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets. [Internet] [Thesis]. University of Manitoba; 2015. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1993/30872.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Al-Meanazel A. The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets. [Thesis]. University of Manitoba; 2015. Available from: http://hdl.handle.net/1993/30872

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

29. Dansie, B. R. (Brenton Ronald). The analysis of permutations / by B.R. Dansie.

Degree: 1988, University of Adelaide

URL: http://hdl.handle.net/2440/18613

Subjects/Keywords: 519.5 20; Permutations.; Mathematical statistics.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Dansie, B. R. (. R. (1988). The analysis of permutations / by B.R. Dansie. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/18613

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Dansie, B R (Brenton Ronald). “The analysis of permutations / by B.R. Dansie.” 1988. Thesis, University of Adelaide. Accessed January 17, 2021. http://hdl.handle.net/2440/18613.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Dansie, B R (Brenton Ronald). “The analysis of permutations / by B.R. Dansie.” 1988. Web. 17 Jan 2021.

Vancouver:

Dansie BR(R. The analysis of permutations / by B.R. Dansie. [Internet] [Thesis]. University of Adelaide; 1988. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/2440/18613.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dansie BR(R. The analysis of permutations / by B.R. Dansie. [Thesis]. University of Adelaide; 1988. Available from: http://hdl.handle.net/2440/18613

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Manchester

30. Steele, Hugh Paul. Combinatorial arguments for linear logic full completeness.

Degree: PhD, 2013, University of Manchester

URL: https://www.research.manchester.ac.uk/portal/en/theses/combinatorial-arguments-for-linear-logic-full-completeness(274c6b87-dc58-4dc3-86bc-8c29abc2fc34).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568657

► 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… (more)

Subjects/Keywords: 511; Linear Logic; Category Theory; Categorical Logic; Multilinear Algebra; Combinatorics; Permutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Steele, H. P. (2013). Combinatorial arguments for linear logic full completeness. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/combinatorial-arguments-for-linear-logic-full-completeness(274c6b87-dc58-4dc3-86bc-8c29abc2fc34).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568657

Chicago Manual of Style (16^th Edition):

Steele, Hugh Paul. “Combinatorial arguments for linear logic full completeness.” 2013. Doctoral Dissertation, University of Manchester. Accessed January 17, 2021. https://www.research.manchester.ac.uk/portal/en/theses/combinatorial-arguments-for-linear-logic-full-completeness(274c6b87-dc58-4dc3-86bc-8c29abc2fc34).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568657.

MLA Handbook (7^th Edition):

Steele, Hugh Paul. “Combinatorial arguments for linear logic full completeness.” 2013. Web. 17 Jan 2021.

Vancouver:

Steele HP. Combinatorial arguments for linear logic full completeness. [Internet] [Doctoral dissertation]. University of Manchester; 2013. [cited 2021 Jan 17]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/combinatorial-arguments-for-linear-logic-full-completeness(274c6b87-dc58-4dc3-86bc-8c29abc2fc34).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568657.

Council of Science Editors:

Steele HP. Combinatorial arguments for linear logic full completeness. [Doctoral Dissertation]. University of Manchester; 2013. Available from: https://www.research.manchester.ac.uk/portal/en/theses/combinatorial-arguments-for-linear-logic-full-completeness(274c6b87-dc58-4dc3-86bc-8c29abc2fc34).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568657

Open Access Theses and Dissertations