subject:(GENERATING FUNCTIONS)

Michigan State University

1. Dahlberg, Samantha. Patterns in set partitions and restricted growth functions.

Degree: 2016, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:3816

►

Thesis Ph. D. Michigan State University. Mathematics 2016

In this thesis we study two related notions of pattern avoidance.One is in set partitions σ of… (more)

▼

Thesis Ph. D. Michigan State University. Mathematics 2016

In this thesis we study two related notions of pattern avoidance.One is in set partitions σ of [n]={1,2\dots, n} which are families of nonempty subsets B₁,\dots,B_k whose disjoint union is [n], written σ=B₁/\dots/B_k\vdash S. The other is in restricted growth functions (RGFs) which are words w=a_1a₂\dots a_n of positive integers such that a₁=1 and a_i ≤ 1+\max{a₁,\dots,a_i-1} for i>1. The concept of pattern avoidance is built on a standardization map {st} on an object O, be it a set partition or RGF, where {st}(O) is obtained by replacing the ith smallest integer with i. A set partition σ will contain a pattern π if σ has a subpartition which standardizes to π, and when σ does not contain π we say σ avoids π. Pattern avoidance in RGFs is defined similarly. This work is the study of the generating functions for Wachs and White's statistics on RGFs over the avoidance classes of set partitions and RGFs. The first half of the thesis concentrates on set partitions. We characterize most of these generating functions for avoiding single and multiple set partitions of length three, and we highlight the longer pattern 14/2/3, a partition of [4], as its avoidance class has a particularly nice characterization. The second half of this thesis will present our results about the generating functions for RGF patterns, starting with those of length three. We find many equidistribution properties which we prove using integer partitions and the hook decomposition of Young diagrams. For certain patterns of any length we provide a recursive formula for their generating functions including the pattern 12\dots k. We finish this presentation by discussing the patterns 1212 and 1221 which have connections to noncrossing and nonnesting partitions, respectfully. We find connections to two-colored Motzkin paths and define explicit bijections between these combinatorial objects.

Description based on online resource;

Advisors/Committee Members: Sagan, Bruce, Bell, Robert, Hall, Jonathan, Magyar, Peter, Shapiro, Michael.

Subjects/Keywords: Partitions (Mathematics); Generating functions; Combinatorial analysis; Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Dahlberg, S. (2016). Patterns in set partitions and restricted growth functions. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:3816

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):

Dahlberg, Samantha. “Patterns in set partitions and restricted growth functions.” 2016. Thesis, Michigan State University. Accessed January 15, 2021. http://etd.lib.msu.edu/islandora/object/etd:3816.

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

MLA Handbook (7^th Edition):

Dahlberg, Samantha. “Patterns in set partitions and restricted growth functions.” 2016. Web. 15 Jan 2021.

Vancouver:

Dahlberg S. Patterns in set partitions and restricted growth functions. [Internet] [Thesis]. Michigan State University; 2016. [cited 2021 Jan 15]. Available from: http://etd.lib.msu.edu/islandora/object/etd:3816.

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

Council of Science Editors:

Dahlberg S. Patterns in set partitions and restricted growth functions. [Thesis]. Michigan State University; 2016. Available from: http://etd.lib.msu.edu/islandora/object/etd:3816

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

University of Pennsylvania

2. Levande, Paul. Combinatorial Structures and Generating Functions of Fishburn Numbers, Parking Functions, and Tesler Matrices.

Degree: 2012, University of Pennsylvania

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

► This dissertation reflects the author's work on two problems involving combinatorial structures. The first section, which was also published in the Journal of Combinatorial Theory,… (more)

▼ This dissertation reflects the author's work on two problems involving combinatorial structures. The first section, which was also published in the Journal of Combinatorial Theory, Series A, discusses the author's work on several conjectures relating to the Fishburn numbers. The Fishburn numbers can be defined as the coefficients of the generating function begin{align*} 1+sum_m=1^infty prod_i=1^m(1-(1-t)ⁱ). end{align*} Combinatorially, the Fishburn numbers enumerate certain supersets of sets enumerated by the Catalan numbers. We add to this work by giving an involution-based proof of the conjecture of Claesson and Linusson that the Fishburn numbers enumerate non-2-neighbor-nesting matchings. We begin by proving that a map originally defined by Claesson and Linusson gives a bijection between non-2-neighbor-nesting matchings and textbf{(2-1)}-avoiding inversion tables. We then define a set of diagrams, which we call Fishburn diagrams, that give a natural interpretation to the generating function of the Fishburn numbers. Using an involution on Fishburn diagrams, we then prove that the Fishburn numbers enumerate textbf{(2-1)}-avoiding inversion tables. By using two variations of this involution on two subsets of Fishburn diagrams, we then give a visual proof of the conjecture of Remmel and Kitaev that two bivariate refinements of the generating function of the Fishburn numbers are equivalent. In an appendix, we give an inductive proof of the conjecture of Claesson and Linusson that the distribution of left-nestings over the set of all matchings is given by the second-order Eulerian triangle. The conjecture of Remmel and Kitaev was independently proved by Jelin'ek and by Yan with a matrix interpretation defined by Dukes and Parviainen. Bijections surveyed by Callan can lead to a similar proof of the conjecture of Claesson and Linusson giving the distribution of left-nestings over matchings, using a result on the Stirling permutations due to Gessel and Stanley. This work was done independently. The second section, some of which was presented at the Formal Power Series and Algebriac Combinatorics conference (FPSAC), discusses the author's work on several conjectures relating to parking functions and to Tesler matrices. Parking functions are combinatorial objects which generalize both permutations and Catalan paths. Haglund and Loehr conjectured that the generating functions of two statistics, area and dinv, over the set of parking functions (the q, t-parking functions) gives the Hilbert series of the diagonal coinvariants. Haglund recently proved that this Hilbert series is given by another generating function over the set of matrices with every hook sum equal to one (``Tesler matrices''). We prove several structural results on parking functions inspired by Tesler matrices, including a near-recursive generation of the q, t-parking functions. We also give consistent bijective proofs of several special cases of Haglund's Tesler function identity, giving a combinatorial connection between parking…

Subjects/Keywords: ascent sequences; Fishburn numbers; generating functions; parking functions; Tesler matrices; Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Levande, P. (2012). Combinatorial Structures and Generating Functions of Fishburn Numbers, Parking Functions, and Tesler Matrices. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/657

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):

Levande, Paul. “Combinatorial Structures and Generating Functions of Fishburn Numbers, Parking Functions, and Tesler Matrices.” 2012. Thesis, University of Pennsylvania. Accessed January 15, 2021. https://repository.upenn.edu/edissertations/657.

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

MLA Handbook (7^th Edition):

Levande, Paul. “Combinatorial Structures and Generating Functions of Fishburn Numbers, Parking Functions, and Tesler Matrices.” 2012. Web. 15 Jan 2021.

Vancouver:

Levande P. Combinatorial Structures and Generating Functions of Fishburn Numbers, Parking Functions, and Tesler Matrices. [Internet] [Thesis]. University of Pennsylvania; 2012. [cited 2021 Jan 15]. Available from: https://repository.upenn.edu/edissertations/657.

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

Council of Science Editors:

Levande P. Combinatorial Structures and Generating Functions of Fishburn Numbers, Parking Functions, and Tesler Matrices. [Thesis]. University of Pennsylvania; 2012. Available from: https://repository.upenn.edu/edissertations/657

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

3. Atash, Ahmed Ali Lasma. Study of generating functions and special functions;.

Degree: Applied Mathematics, 2005, Aligarh Muslim University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/53518

Abstract available newline newline

Bibliography p. 137-147

Advisors/Committee Members: Khan, Abdul Hakim.

Subjects/Keywords: Study; Generating; Functions; Special

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Atash, A. A. L. (2005). Study of generating functions and special functions;. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/53518

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):

Atash, Ahmed Ali Lasma. “Study of generating functions and special functions;.” 2005. Thesis, Aligarh Muslim University. Accessed January 15, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/53518.

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

MLA Handbook (7^th Edition):

Atash, Ahmed Ali Lasma. “Study of generating functions and special functions;.” 2005. Web. 15 Jan 2021.

Vancouver:

Atash AAL. Study of generating functions and special functions;. [Internet] [Thesis]. Aligarh Muslim University; 2005. [cited 2021 Jan 15]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/53518.

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

Council of Science Editors:

Atash AAL. Study of generating functions and special functions;. [Thesis]. Aligarh Muslim University; 2005. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/53518

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

4. Ghazala, Yasmin. Generating relations of some special functions using representations of lie algebras;.

Degree: Mathematics, 2002, Aligarh Muslim University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/52250

Abstract not available newline newline

Bibliography p. 96-107

Advisors/Committee Members: Khan, Subuhi.

Subjects/Keywords: Relations; Generating; Representations; Algebras; Functions

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ghazala, Y. (2002). Generating relations of some special functions using representations of lie algebras;. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/52250

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):

Ghazala, Yasmin. “Generating relations of some special functions using representations of lie algebras;.” 2002. Thesis, Aligarh Muslim University. Accessed January 15, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/52250.

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

MLA Handbook (7^th Edition):

Ghazala, Yasmin. “Generating relations of some special functions using representations of lie algebras;.” 2002. Web. 15 Jan 2021.

Vancouver:

Ghazala Y. Generating relations of some special functions using representations of lie algebras;. [Internet] [Thesis]. Aligarh Muslim University; 2002. [cited 2021 Jan 15]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/52250.

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

Council of Science Editors:

Ghazala Y. Generating relations of some special functions using representations of lie algebras;. [Thesis]. Aligarh Muslim University; 2002. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/52250

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

Penn State University

5. Katz, Matthew H. On the Number of a x b Quotient Diagrams of Integer Partitions.

Degree: 2013, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/18952

► In the early 1980's, James Propp querried about the enumeration of objects related to the theory of partitions which he called quotient diagrams; in the… (more)

Subjects/Keywords: integer partitions; t-core partitions; quotient diagrams; Ferrers diagrams; generating functions

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Katz, M. H. (2013). On the Number of a x b Quotient Diagrams of Integer Partitions. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/18952

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):

Katz, Matthew H. “On the Number of a x b Quotient Diagrams of Integer Partitions.” 2013. Thesis, Penn State University. Accessed January 15, 2021. https://submit-etda.libraries.psu.edu/catalog/18952.

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

MLA Handbook (7^th Edition):

Katz, Matthew H. “On the Number of a x b Quotient Diagrams of Integer Partitions.” 2013. Web. 15 Jan 2021.

Vancouver:

Katz MH. On the Number of a x b Quotient Diagrams of Integer Partitions. [Internet] [Thesis]. Penn State University; 2013. [cited 2021 Jan 15]. Available from: https://submit-etda.libraries.psu.edu/catalog/18952.

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

Council of Science Editors:

Katz MH. On the Number of a x b Quotient Diagrams of Integer Partitions. [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/18952

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

6. Clapperton, James Anthony. Computational and theoretical aspects of iterated generating functions.

Degree: PhD, 2013, University of Derby

URL: http://hdl.handle.net/10545/291078

► The thesis offers an investigation into the analysis of so-called iterated generating functions and the schemes that produce them. Beginning with the study of some… (more)

Subjects/Keywords: 512.9; iterated generating functions; infinite sequences; Catalan polynomials; Householder's method

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Clapperton, J. A. (2013). Computational and theoretical aspects of iterated generating functions. (Doctoral Dissertation). University of Derby. Retrieved from http://hdl.handle.net/10545/291078

Chicago Manual of Style (16^th Edition):

Clapperton, James Anthony. “Computational and theoretical aspects of iterated generating functions.” 2013. Doctoral Dissertation, University of Derby. Accessed January 15, 2021. http://hdl.handle.net/10545/291078.

MLA Handbook (7^th Edition):

Clapperton, James Anthony. “Computational and theoretical aspects of iterated generating functions.” 2013. Web. 15 Jan 2021.

Vancouver:

Clapperton JA. Computational and theoretical aspects of iterated generating functions. [Internet] [Doctoral dissertation]. University of Derby; 2013. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/10545/291078.

Council of Science Editors:

Clapperton JA. Computational and theoretical aspects of iterated generating functions. [Doctoral Dissertation]. University of Derby; 2013. Available from: http://hdl.handle.net/10545/291078

Florida Atlantic University

7. Sullivan, Shaun. Multivariate finite operator calculus applied to counting ballot paths containing patterns.

Degree: PhD, 2011, Florida Atlantic University

URL: http://purl.flvc.org/FAU/3174076

►

Summary: Counting lattice paths where the number of occurrences of a given pattern is monitored requires a careful analysis of the pattern. Not the length,… (more)

Subjects/Keywords: Combinatorial probabilities; Lattice paths; Combinatorial enumeration problems; Generating functions

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Sullivan, S. (2011). Multivariate finite operator calculus applied to counting ballot paths containing patterns. (Doctoral Dissertation). Florida Atlantic University. Retrieved from http://purl.flvc.org/FAU/3174076

Chicago Manual of Style (16^th Edition):

Sullivan, Shaun. “Multivariate finite operator calculus applied to counting ballot paths containing patterns.” 2011. Doctoral Dissertation, Florida Atlantic University. Accessed January 15, 2021. http://purl.flvc.org/FAU/3174076.

MLA Handbook (7^th Edition):

Sullivan, Shaun. “Multivariate finite operator calculus applied to counting ballot paths containing patterns.” 2011. Web. 15 Jan 2021.

Vancouver:

Sullivan S. Multivariate finite operator calculus applied to counting ballot paths containing patterns. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2011. [cited 2021 Jan 15]. Available from: http://purl.flvc.org/FAU/3174076.

Council of Science Editors:

Sullivan S. Multivariate finite operator calculus applied to counting ballot paths containing patterns. [Doctoral Dissertation]. Florida Atlantic University; 2011. Available from: http://purl.flvc.org/FAU/3174076

NSYSU

8. Guo, Shu-Fen. Sequence and Series Problems of High School Mathematics Teacher Recruitment Exams in Taiwan.

Degree: Master, Applied Mathematics, 2016, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0517116-103322

► This study investigates selected sequence and series problems of high school mathematics teacher recruitment exam in Taiwan from 2008 to 2015. Each topics begins with… (more)

Subjects/Keywords: recursive relations; Mobius sequence; sequence; series; arithmetico-geometric series; generating functions; telescoping series

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Guo, S. (2016). Sequence and Series Problems of High School Mathematics Teacher Recruitment Exams in Taiwan. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0517116-103322

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):

Guo, Shu-Fen. “Sequence and Series Problems of High School Mathematics Teacher Recruitment Exams in Taiwan.” 2016. Thesis, NSYSU. Accessed January 15, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0517116-103322.

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

MLA Handbook (7^th Edition):

Guo, Shu-Fen. “Sequence and Series Problems of High School Mathematics Teacher Recruitment Exams in Taiwan.” 2016. Web. 15 Jan 2021.

Vancouver:

Guo S. Sequence and Series Problems of High School Mathematics Teacher Recruitment Exams in Taiwan. [Internet] [Thesis]. NSYSU; 2016. [cited 2021 Jan 15]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0517116-103322.

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

Council of Science Editors:

Guo S. Sequence and Series Problems of High School Mathematics Teacher Recruitment Exams in Taiwan. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0517116-103322

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

9. Fisher, Brent. Renewal Theory: Simple and Elegant Derivations.

Degree: MSc (MS/Maîtrise ès sciences), Mathematics/Mathématiques, 2015, Royal Military College of Canada

URL: http://hdl.handle.net/11264/421

►

This thesis comprises two principal areas of research: new derivations of asymptotic results in renewal theory and the computation of the distribution for the number… (more)

▼

This thesis comprises two principal areas of research: new derivations of asymptotic results in renewal theory and the computation of the distribution for the number of renewals with bulk arrivals. A simple and elegant solution to determine the asymptotic results for the renewal density as well as for the first and second moments of the number of renewals for the discrete-time renewal process is presented. Using generating functions, the difficult-to-determine constant term in the second moment is also addressed. A similar process using Laplace transforms (LTs) is likewise employed to determine analogous results in continuous time. Further, the solution is extended to determine the asymptotic results for the first and second moments of the number of bulk renewals as well. The distribution of the number of renewals for both single and bulk arrivals in continuous time is calculated using an algorithm employed through MAPLE. These numerical results are acquired by considering rational as well as non-rational LTs and Padé-approximated LTs for the distributions of inter-renewal times. The asymptotic results derived in the first part of this thesis then help to validate the accuracy of these numerical results.

Cette thèse comprend deux domaines de recherche principaux: de nouvelles dérivations de résultats asymptotiques pour la théorie du renouvellement, et le calcul de la distribution pour le nombre de renouvellements pour les arrivées en groupes. Une solution simple et élégante pour déterminer les résultats asymptotiques pour la densité de renouvellement ainsi que pour les premiers et deuxièmes moments du nombre de renouvellements pour le processus de renouvellement en temps discret est présentée. En utilisant des fonctions génératrices, le terme constant qui est difficile à déterminer pour le second moment est également résolu. Un processus similaire utilisant les transformations de Laplace (LTs) est également utilisé pour déterminer des résultats similaires en temps continu. De plus, la solution est poursuivie afin de déterminer les résultats asymptotiques pour les premiers et deuxièmes moments du nombre de renouvellements en groupes. La distribution du nombre de renouvellements pour les arrivées simples et en groupes en temps continu est calculée en utilisant un algorithme fait avec MAPLE. Ces résultats numériques sont acquis en considérant les LTs rationnelles et non-rationnelles ainsi que les LTs de Padé pour les distributions des intervalles de renouvellement. Les résultats asymptotiques dérivés dans la première partie de cette thèse aident ensuite à valider le calcul d’incertitude de ces résultats numériques.

Graduate

Advisors/Committee Members: Royal Military College of Canada / Collège militaire royal du Canada, Chaudhry, Mohan.

Subjects/Keywords: Renewal theory; Numerical results; Asymptotic results; Bulk arrivals; Generating functions; Laplace transforms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Fisher, B. (2015). Renewal Theory: Simple and Elegant Derivations. (Masters Thesis). Royal Military College of Canada. Retrieved from http://hdl.handle.net/11264/421

Chicago Manual of Style (16^th Edition):

Fisher, Brent. “Renewal Theory: Simple and Elegant Derivations.” 2015. Masters Thesis, Royal Military College of Canada. Accessed January 15, 2021. http://hdl.handle.net/11264/421.

MLA Handbook (7^th Edition):

Fisher, Brent. “Renewal Theory: Simple and Elegant Derivations.” 2015. Web. 15 Jan 2021.

Vancouver:

Fisher B. Renewal Theory: Simple and Elegant Derivations. [Internet] [Masters thesis]. Royal Military College of Canada; 2015. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/11264/421.

Council of Science Editors:

Fisher B. Renewal Theory: Simple and Elegant Derivations. [Masters Thesis]. Royal Military College of Canada; 2015. Available from: http://hdl.handle.net/11264/421

10. Khan, Naseem Ahmad. A certain class of multiple generating functions involving some generalized special functions and polynomials; -.

Degree: Applied Mathematics, 2007, Aligarh Muslim University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/53708

Abstract not available newline newline

Bibliography p. 157-180

Advisors/Committee Members: Khan, Mumtaz Ahmad.

Subjects/Keywords: Certain; Multiple; Generating; Functions; Involving; Polynomials

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Khan, N. A. (2007). A certain class of multiple generating functions involving some generalized special functions and polynomials; -. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/53708

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):

Khan, Naseem Ahmad. “A certain class of multiple generating functions involving some generalized special functions and polynomials; -.” 2007. Thesis, Aligarh Muslim University. Accessed January 15, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/53708.

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

MLA Handbook (7^th Edition):

Khan, Naseem Ahmad. “A certain class of multiple generating functions involving some generalized special functions and polynomials; -.” 2007. Web. 15 Jan 2021.

Vancouver:

Khan NA. A certain class of multiple generating functions involving some generalized special functions and polynomials; -. [Internet] [Thesis]. Aligarh Muslim University; 2007. [cited 2021 Jan 15]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/53708.

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

Council of Science Editors:

Khan NA. A certain class of multiple generating functions involving some generalized special functions and polynomials; -. [Thesis]. Aligarh Muslim University; 2007. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/53708

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

11. Khan, Nabiullah. On certain class of generating functions involving generalized polynomials;.

Degree: Mathematics, 2002, Aligarh Muslim University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/52255

Abstract not available newline newline

Bibliography p. 122-136, Appendix given

Advisors/Committee Members: Pathan, M A.

Subjects/Keywords: Certain; Generating; Functions; Involving; Generalized; Polynomials

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Khan, N. (2002). On certain class of generating functions involving generalized polynomials;. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/52255

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):

Khan, Nabiullah. “On certain class of generating functions involving generalized polynomials;.” 2002. Thesis, Aligarh Muslim University. Accessed January 15, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/52255.

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

MLA Handbook (7^th Edition):

Khan, Nabiullah. “On certain class of generating functions involving generalized polynomials;.” 2002. Web. 15 Jan 2021.

Vancouver:

Khan N. On certain class of generating functions involving generalized polynomials;. [Internet] [Thesis]. Aligarh Muslim University; 2002. [cited 2021 Jan 15]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/52255.

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

Council of Science Editors:

Khan N. On certain class of generating functions involving generalized polynomials;. [Thesis]. Aligarh Muslim University; 2002. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/52255

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

12. Khan, Nabiullah. On certain class of generating functions involving generalized polynomials;.

Degree: Mathematics, 2002, Aligarh Muslim University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/52256

Abstract not available newline newline

Bibliography p. 122-136, Appendix given

Advisors/Committee Members: Pathan, M A.

Subjects/Keywords: Certain; Generating; Functions; Involving; Generalized; Polynomials

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Khan, N. (2002). On certain class of generating functions involving generalized polynomials;. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/52256

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):

Khan, Nabiullah. “On certain class of generating functions involving generalized polynomials;.” 2002. Thesis, Aligarh Muslim University. Accessed January 15, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/52256.

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

MLA Handbook (7^th Edition):

Khan, Nabiullah. “On certain class of generating functions involving generalized polynomials;.” 2002. Web. 15 Jan 2021.

Vancouver:

Khan N. On certain class of generating functions involving generalized polynomials;. [Internet] [Thesis]. Aligarh Muslim University; 2002. [cited 2021 Jan 15]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/52256.

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

Council of Science Editors:

Khan N. On certain class of generating functions involving generalized polynomials;. [Thesis]. Aligarh Muslim University; 2002. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/52256

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

Arizona State University

13. Kadloor, Nikhil. Photovoltaic Systems: Forecasting for Demand Response Management and Environmental Modelling to Design Accelerated Aging Tests.

Degree: Industrial Engineering, 2017, Arizona State University

URL: http://repository.asu.edu/items/44105

► Distributed Renewable energy generators are now contributing a significant amount of energy into the energy grid. Consequently, reliability adequacy of such energy generators will depend… (more)

▼ Distributed Renewable energy generators are now contributing a significant amount of energy into the energy grid. Consequently, reliability adequacy of such energy generators will depend on making accurate forecasts of energy produced by them. Power outputs of Solar PV systems depend on the stochastic variation of environmental factors (solar irradiance, ambient temperature & wind speed) and random mechanical failures/repairs. Monte Carlo Simulation which is typically used to model such problems becomes too computationally intensive leading to simplifying state-space assumptions. Multi-state models for power system reliability offer a higher flexibility in providing a description of system state evolution and an accurate representation of probability. In this study, Universal Generating Functions (UGF) were used to solve such combinatorial problems. 8 grid connected Solar PV systems were analyzed with a combined capacity of about 5MW located in a hot-dry climate (Arizona) and accuracy of 98% was achieved when validated with real-time data. An analytics framework is provided to grid operators and utilities to effectively forecast energy produced by distributed energy assets and in turn, develop strategies for effective Demand Response in times of increased share of renewable distributed energy assets in the grid. Second part of this thesis extends the environmental modelling approach to develop an aging test to be run in conjunction with an accelerated test of Solar PV modules. Accelerated Lifetime Testing procedures in the industry are used to determine the dominant failure modes which the product undergoes in the field, as well as predict the lifetime of the product. UV stressor is one of the ten stressors which a PV module undergoes in the field. UV exposure causes browning of modules leading to drop in Short Circuit Current. This thesis presents an environmental modelling approach for the hot-dry climate and extends it to develop an aging test methodology. This along with the accelerated tests would help achieve the goal of correlating field failures with accelerated tests and obtain acceleration factor. This knowledge would help predict PV module degradation in the field within 30% of the actual value and help in knowing the PV module lifetime accurately.

Subjects/Keywords: Statistics; Energy; Sustainability; Accelerated tests; Distributed energy; Photovoltaics; Reliability; Support Vector Regression; Universal Generating Functions

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kadloor, N. (2017). Photovoltaic Systems: Forecasting for Demand Response Management and Environmental Modelling to Design Accelerated Aging Tests. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/44105

Chicago Manual of Style (16^th Edition):

Kadloor, Nikhil. “Photovoltaic Systems: Forecasting for Demand Response Management and Environmental Modelling to Design Accelerated Aging Tests.” 2017. Masters Thesis, Arizona State University. Accessed January 15, 2021. http://repository.asu.edu/items/44105.

MLA Handbook (7^th Edition):

Kadloor, Nikhil. “Photovoltaic Systems: Forecasting for Demand Response Management and Environmental Modelling to Design Accelerated Aging Tests.” 2017. Web. 15 Jan 2021.

Vancouver:

Kadloor N. Photovoltaic Systems: Forecasting for Demand Response Management and Environmental Modelling to Design Accelerated Aging Tests. [Internet] [Masters thesis]. Arizona State University; 2017. [cited 2021 Jan 15]. Available from: http://repository.asu.edu/items/44105.

Council of Science Editors:

Kadloor N. Photovoltaic Systems: Forecasting for Demand Response Management and Environmental Modelling to Design Accelerated Aging Tests. [Masters Thesis]. Arizona State University; 2017. Available from: http://repository.asu.edu/items/44105

14. Claeys, Dieter. Analysis of queueing models with batch service.

Degree: 2011, Ghent University

URL: http://hdl.handle.net/1854/LU-1955129

► This dissertation is the result of my research work at the SMACS research group (Department of Telecommunications and Information Processing, Ghent University) and it concerns… (more)

▼ This dissertation is the result of my research work at the SMACS research group (Department of Telecommunications and Information Processing, Ghent University) and it concerns the analysis of queueing models with batch service. A queueing model basically is a mathematical abstraction of a situation where customers arrive and queue up until they receive some kind of service. These phenomena are omnipresent in real life: people waiting at a counter of a post office or bank, people in the waiting room of a doctor, airplanes waiting to take off, people waiting until they get connected with the call center, data packets which are temporarily stored into a buffer until the transmisssion channel is available, et cetera. The analysis of queueing models constitutes the subject of the applied mathematical discipline called queueing theory and amounts to answering questions such as “How many customers are waiting on average?”, “How long do customers have to wait?”, “Is there a large variation on the waiting time?”, “What is the probability that data packets are lost due to a full buffer?”, “What is the probability that a customer suffers a lengthy delay?”, et cetera. In queueing theory, the number of customers and their waiting time are often denominated by respectively buffer content and customer delay. In addition, the probability that a quantity, such as the buffer content or customer delay, is very large or lengthy, is generally called a tail probability. The models we investigate throughout this dissertation have in common that customers can be served in batches, meaning that several customers can be served simultaneously. An elevator can be viewed as a classic example, as several people can be transported simultaneously to another floor. Also, in a variety of production or transport processes several goods can be processed together. Furthermore, in quality control, classification of items as good or bad can often be achieved more economically by examining the items in groups rather than individually. If the result of a group test is good, all items within it can then be classified as good, whereas one or more items are bad in the opposite case, where the items can then be retested by considering smaller groups. Group testing is especially of importance when the percentage of bad items is small. In addition, in telecommunications networks, packets with the same destination and quality of service (QoS) requirements are often aggregated into so-called bursts and these bursts are transmitted over the network. This is mainly done for efficiency reasons, since only one header per aggregated burst has to be constructed, instead of one header per single information unit, thus leading to an increased throughput. Technologies using packet aggregation include for instance Optical burst switched (OBS) networks and IEEE 802.11n wireless local area networks (WLANs). An inherent aspect of batch service is that newly arriving customers cannot join the ongoing service, even if there is free capacity (we denominate the maximum number of… Advisors/Committee Members: Bruneel, Herwig, Walraevens, Joris.

Subjects/Keywords: Technology and Engineering; probability generating functions; batch service; customer delay; buffer content

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Claeys, D. (2011). Analysis of queueing models with batch service. (Thesis). Ghent University. Retrieved from http://hdl.handle.net/1854/LU-1955129

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):

Claeys, Dieter. “Analysis of queueing models with batch service.” 2011. Thesis, Ghent University. Accessed January 15, 2021. http://hdl.handle.net/1854/LU-1955129.

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

MLA Handbook (7^th Edition):

Claeys, Dieter. “Analysis of queueing models with batch service.” 2011. Web. 15 Jan 2021.

Vancouver:

Claeys D. Analysis of queueing models with batch service. [Internet] [Thesis]. Ghent University; 2011. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/1854/LU-1955129.

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

Council of Science Editors:

Claeys D. Analysis of queueing models with batch service. [Thesis]. Ghent University; 2011. Available from: http://hdl.handle.net/1854/LU-1955129

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

North Carolina State University

15. D'Souza, Erwin Francis. Automating the Enumeration of Sequences Defined by Digraphs.

Degree: MS, Computer Science, 2005, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/933

► We consider sequences of nonnegative integers S=(s₁,s₂,ldots, s_n) defined by systems of constraints represented as weighted directed graphs in which edge (s_a,s_b) of weight w… (more)

▼ We consider sequences of nonnegative integers S=(s₁,s₂,ldots, s_n) defined by systems of constraints represented as weighted directed graphs in which edge (s_a,s_b) of weight w indicates constraint s_a~geq~s_b~+~w. We propose a set of seven rules and a decomposition technique for obtaining multivariate and single-variable generating functions for families of such graphs. Our method compares to existing techniques by offering an elegant and intuitive approach to obtaining generating functions and recurrences, albeit only for a subset of the partition and composition enumeration problems addressed by other techniques. The decomposition technique we propose remains relevant, nevertheless, to a wide range of applications, including several well-known ones. Moreover, our objective is to obtain recurrences for generating functions so as to assist the formulation and proof of their closed-form solutions. For integer sequences defined by directed graphs with w in 0,1], we prove that our technique holds sufficient. We describe the formulation of finite-variable generating function recurrences from multi-variable ones and provide a set of rules to determine the variables chosen. The construction tree is introduced as the tree representation of the construction of a generating function from the decomposition of a weighted directed graph. Given such a construction tree, automation of the process of building the multi-variable and finite-variable recurrences is possible, and we implement it as a computer program. Finally, we apply our techniques and tools to a wide range of famous problems, including 2-rowed plane partitions, up-down compositions and hexagonal plane partitions, as well as some new problems, and obtain recurrences to each. We find that our methods are not only effective but also easy and simple to use. Advisors/Committee Members: Dr. Carla Savage, Committee Chair (advisor), Dr. Jon Doyle, Committee Member (advisor), Dr. Erich Kaltofen, Committee Member (advisor), Dr. Mehmet Ozturk, Committee Member (advisor).

Subjects/Keywords: GFPartitions; Maple; constraint graphs; recurrences; generating functions; integer sequences

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

D'Souza, E. F. (2005). Automating the Enumeration of Sequences Defined by Digraphs. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/933

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):

D'Souza, Erwin Francis. “Automating the Enumeration of Sequences Defined by Digraphs.” 2005. Thesis, North Carolina State University. Accessed January 15, 2021. http://www.lib.ncsu.edu/resolver/1840.16/933.

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

MLA Handbook (7^th Edition):

D'Souza, Erwin Francis. “Automating the Enumeration of Sequences Defined by Digraphs.” 2005. Web. 15 Jan 2021.

Vancouver:

D'Souza EF. Automating the Enumeration of Sequences Defined by Digraphs. [Internet] [Thesis]. North Carolina State University; 2005. [cited 2021 Jan 15]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/933.

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

Council of Science Editors:

D'Souza EF. Automating the Enumeration of Sequences Defined by Digraphs. [Thesis]. North Carolina State University; 2005. Available from: http://www.lib.ncsu.edu/resolver/1840.16/933

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

16. M. Chessa. A MATHEMATICAL ANALYSIS OF CONFLICTS IN VOTING SYSTEMS.

Degree: 2013, Università degli Studi di Milano

URL: http://hdl.handle.net/2434/217565

► Game Theory applied to voting gives rise to the study of many different topics. In this thesis we present some results in order to evaluate… (more)

▼ Game Theory applied to voting gives rise to the study of many different topics. In this thesis we present some results in order to evaluate the power share inside a Parliament, to analyze the criteria for the assessment of the voters’ preferences and to provide more efficient ways to compute the existing instruments. The first part of the thesis deals with the issue of power in a voting system. In order to better analyze it, we investigate the way of combining a communication structure with the already existing indices of power. Moreover, we present the possibility of assuming some coalitions as less probable, but not infeasible, as the political scenario is complex enough to admit the possibility of very unlikely coalitions to form. Then, we add another important aspect to the problem; the alliances inside a decisional situation are not stable, but may evolve with time, mainly due to the fact that each agent aims at getting a higher power. We refer to an already existing instrument which, theoretically, may perfectly describe this situation. Unfortunately, the current computational complexity does not permit to adopt it in many real cases. Another important topic is the evaluation of the power to block instead of the power to win. We provide an index which evaluates the veto power and which can be extended in order to catch other characteristics of the game; for example, the probability that a party takes a particular decision, or that not every member of a party is present at the vote. The second part of this thesis considers a previous step of the formation of a democracy: the evaluation of how much the resulting Parliament reflects the preferences expressed by the electors. We think that the goodness of a Parliament mainly depends on the power share between the parties and not only on the number of seats. Finally, the last part shows a new exact method to improve the efficiency of the evaluation of one of the existing indices of power, the Public Good index. Advisors/Committee Members: tutor: V. Fragnelli, coordinatore: B. van Geemen, VAN GEEMEN, LAMBERTUS.

Subjects/Keywords: game theory; voting games; power indices; veto power; representativeness; generating functions; Settore MAT/09 - Ricerca Operativa

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Chessa, M. (2013). A MATHEMATICAL ANALYSIS OF CONFLICTS IN VOTING SYSTEMS. (Thesis). Università degli Studi di Milano. Retrieved from http://hdl.handle.net/2434/217565

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):

Chessa, M.. “A MATHEMATICAL ANALYSIS OF CONFLICTS IN VOTING SYSTEMS.” 2013. Thesis, Università degli Studi di Milano. Accessed January 15, 2021. http://hdl.handle.net/2434/217565.

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

MLA Handbook (7^th Edition):

Chessa, M.. “A MATHEMATICAL ANALYSIS OF CONFLICTS IN VOTING SYSTEMS.” 2013. Web. 15 Jan 2021.

Vancouver:

Chessa M. A MATHEMATICAL ANALYSIS OF CONFLICTS IN VOTING SYSTEMS. [Internet] [Thesis]. Università degli Studi di Milano; 2013. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/2434/217565.

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

Council of Science Editors:

Chessa M. A MATHEMATICAL ANALYSIS OF CONFLICTS IN VOTING SYSTEMS. [Thesis]. Università degli Studi di Milano; 2013. Available from: http://hdl.handle.net/2434/217565

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

17. Bustillo, Jaime. Rigidité symplectique et EDPs hamiltoniennes : Symplectic rigidity and Hamiltonian PDEs.

Degree: Docteur es, Mathématiques fondamentales, 2018, Paris Sciences et Lettres (ComUE)

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

►

On étudie les propriétés de rigidité symplectique des difféomorphismes hamiltoniens en dimension finie et en dimension infinie. En dimension finie, les outils principaux qu'on utilise… (more)

▼

On étudie les propriétés de rigidité symplectique des difféomorphismes hamiltoniens en dimension finie et en dimension infinie. En dimension finie, les outils principaux qu'on utilise sont les fonctions génératrices et les capacités symplectiques. En dimension infinie on regarde les flots des équations en dérivées partielles (EDPs) hamiltoniennes et, en particulier, les flots qui peuvent être approchés uniformément par des flots hamiltoniens de dimension finie.Dans la première partie de la thèse on étudie les sélecteurs d'action définies à partir des fonctions génératrices et on construit des invariants hamiltoniens pour les sous-ensembles de R^2m x T^*T^k. Cela nous permet de démontrer un théorème non-squeezing coisotrope pour les difféomorphismes hamiltoniens à support compact de R²ⁿ. On montre à continuation que cette propriété apparaisse dans certains cas non compacts. Finalement, on explique comment ce résultat donne aussi l'information sur le problème de rigidité symplectique en dimension intermédiaire. Encore en dimension finie, on démontre qu'on peut utiliser le théorème du chameau symplectique pour produire des sous-ensembles invariants compacts dans des surfaces d'energie.Dans la deuxième partie on étudie les propriétés de rigidité symplectique des flots des EDPs hamiltoniennes. On se place dans le contexte introduit par Kuksin et on étudie une classe particulière de EDPs semi-linéaires qui peuvent être approchées par flots hamiltoniens de dimension finie. D'abord on donne une nouvelle construction de capacité symplectique en dimension infinie à partir des capacités de Viterbo. Puis on démontre l'analogue de la rigidité intermédiaire pour certaines EDPs hamiltoniennes. Cette classe inclue l'équation d'ondes en dimension 1 avec une non-linéarité bornée, comme par exemple l'équation de Sine-Gordon. Dans la dernière partie de la thèse on s'intéresse à un analogue de la conjecture d'Arnold pour l'équation de Schrödinger périodique avec une non linéarité de convolution.

We study symplectic rigidity properties in both finite and infinite dimension. In finite dimension, the main tools that we use are generating functions and symplectic capacities. In infinite dimension we study flows of Hamiltonian partial differential equations (PDEs) and, in particular, flows which can be uniformly approximated by finite dimensional Hamiltonian diffeomorphisms.In the first part of this thesis we study the action selectors defined from generating functions and we build Hamiltonian invariants for subsets of R^2m x T^*T^k. This allows us to prove a coisotropic non-squeezing theorem for compactly supported Hamiltonian diffeomorphisms of R²ⁿ. We then extend this result to some non-compact settings. Finally we explain how this result can give information about the middle dimensional symplectic rigidity problem. Still in finite dimensions, we show that it is possible to use the symplectic camel theorem to create energy surfaces with compact invariant subsets.In the second part of the thesis we study symplectic rigidity…

Advisors/Committee Members: Viterbo, Claude (thesis director).

Subjects/Keywords: Géometrie symplectique; Fonctions génératrices; Capacités symplectiques; EDPs hamiltoniennes; Symplectic geometry; Generating functions; Symplectic capacities; Hamiltonian PDEs; 510

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Bustillo, J. (2018). Rigidité symplectique et EDPs hamiltoniennes : Symplectic rigidity and Hamiltonian PDEs. (Doctoral Dissertation). Paris Sciences et Lettres (ComUE). Retrieved from http://www.theses.fr/2018PSLEE050

Chicago Manual of Style (16^th Edition):

Bustillo, Jaime. “Rigidité symplectique et EDPs hamiltoniennes : Symplectic rigidity and Hamiltonian PDEs.” 2018. Doctoral Dissertation, Paris Sciences et Lettres (ComUE). Accessed January 15, 2021. http://www.theses.fr/2018PSLEE050.

MLA Handbook (7^th Edition):

Bustillo, Jaime. “Rigidité symplectique et EDPs hamiltoniennes : Symplectic rigidity and Hamiltonian PDEs.” 2018. Web. 15 Jan 2021.

Vancouver:

Bustillo J. Rigidité symplectique et EDPs hamiltoniennes : Symplectic rigidity and Hamiltonian PDEs. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres (ComUE); 2018. [cited 2021 Jan 15]. Available from: http://www.theses.fr/2018PSLEE050.

Council of Science Editors:

Bustillo J. Rigidité symplectique et EDPs hamiltoniennes : Symplectic rigidity and Hamiltonian PDEs. [Doctoral Dissertation]. Paris Sciences et Lettres (ComUE); 2018. Available from: http://www.theses.fr/2018PSLEE050

University of Illinois – Urbana-Champaign

18. Tangjai, Wipawee. Density and spacing properties of some families of non-standard ternary representations.

Degree: PhD, 0439, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/50750

► In this dissertation, we study a family of non-standard digital representations in base 3. Let A be an index set such that A={0,u1,u2}, where u1… (more)

Subjects/Keywords: Combinatorial number theory; Digital representation; non-standard digit sets; ternary representations; generating functions; sequences; subsets of integers

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Tangjai, W. (2014). Density and spacing properties of some families of non-standard ternary representations. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50750

Chicago Manual of Style (16^th Edition):

Tangjai, Wipawee. “Density and spacing properties of some families of non-standard ternary representations.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 15, 2021. http://hdl.handle.net/2142/50750.

MLA Handbook (7^th Edition):

Tangjai, Wipawee. “Density and spacing properties of some families of non-standard ternary representations.” 2014. Web. 15 Jan 2021.

Vancouver:

Tangjai W. Density and spacing properties of some families of non-standard ternary representations. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/2142/50750.

Council of Science Editors:

Tangjai W. Density and spacing properties of some families of non-standard ternary representations. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50750

19. TABBARA, RAMI. Generalised directed walker models of adsorption and gelation.

Degree: 2015, University of Melbourne

URL: http://hdl.handle.net/11343/55359

► We outline an approach to constructing and solving models of highly interactive systems of single and multiple homopolymers, focusing on adsorption and gelation effects. In… (more)

▼ We outline an approach to constructing and solving models of highly interactive systems of single and multiple homopolymers, focusing on adsorption and gelation effects. In particular, solutions of our model allow us describe the critical behaviour of our system, such as the temperature required to graft a polymer onto an attractive surface or the potential energy required to bond a collection of single polymers into a branched, dense gel structure. We begin by outlining a simple counting problem of finding a closed-form expression for the number of walks along a finite lattice that obey some specified step constraints. Of particular relevance is the constraint of self-avoidance which specifies that a given walk is only able to visit a given site once, and we highlight why self-avoiding walks are considered a good approach to modelling polymer conformations. We further highlight how one can incorporate this purely combinatorial problem into the framework of statistical mechanics which allows us to construct a probabilistic model that links the microscopic and macroscopic state of a thermodynamic system. In short, we review the well established approach of transforming the task of modelling a physical system of single or multiple polymers into a combinatorial problem. We then show how self-avoiding directed walkers can be employed to construct idealised models of these polymer systems and review known techniques that allow us to establish exact solutions. While previous work on directed walker models has predominantly focused on, at most, single interaction effects, the applicability of these current techniques to solve more sophisticated models that incorporate multiple polymer conformations and multiple interaction effects was relatively unconsidered. Indeed, we will showcase the versatility of such techniques, central of which is the kernel method, and further unearth extensions of these techniques to solve for a number of highly interactive polymer models, with subsequent analysis revealing a rich set of interesting and unexpected critical behaviour.

Subjects/Keywords: polymers; polymer models; directed walkers; directed walks; kernel method; combinatorics; adsorption; gelation; generating functions; multiple walkers; obstinate kernel method

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

TABBARA, R. (2015). Generalised directed walker models of adsorption and gelation. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/55359

Chicago Manual of Style (16^th Edition):

TABBARA, RAMI. “Generalised directed walker models of adsorption and gelation.” 2015. Doctoral Dissertation, University of Melbourne. Accessed January 15, 2021. http://hdl.handle.net/11343/55359.

MLA Handbook (7^th Edition):

TABBARA, RAMI. “Generalised directed walker models of adsorption and gelation.” 2015. Web. 15 Jan 2021.

Vancouver:

TABBARA R. Generalised directed walker models of adsorption and gelation. [Internet] [Doctoral dissertation]. University of Melbourne; 2015. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/11343/55359.

Council of Science Editors:

TABBARA R. Generalised directed walker models of adsorption and gelation. [Doctoral Dissertation]. University of Melbourne; 2015. Available from: http://hdl.handle.net/11343/55359

McGill University

20. Niculescu-Sanielevici, Mihaela. Generator Matrix Elements for Noncompact Sp(6) in a Sp(2) X 0(3) Basis.

Degree: PhD, Department of Physics, 1986, McGill University

URL: https://escholarship.mcgill.ca/downloads/xk81jn93r.pdf ; https://escholarship.mcgill.ca/concern/theses/9p290c98s

►

Cette thèse trouve les états de base du modèle symplectique pour le comportement collectif nucléaire. Nous trouvons une base complète I d'états pour Sp(6), le… (more)

▼

Cette thèse trouve les états de base du modèle symplectique pour le comportement collectif nucléaire. Nous trouvons une base complète I d'états pour Sp(6), le plus important groupe de mouvements collectifs dans les noyaux. Parmi la multitude d'états propres possibles, nous ne sommes intéressés que dans ceux de type vibrationnel, dits de Bohr-Mottelson, qui forment en même temps une base dans le sous-groupe Sp(2) x 0(3) de Sp(6). La base que nous trouvons n'est pas orthonormale mais elle est complète et nonredondante et nous montrons comment l'utiliser pour calculer des éléments de matrices des générateurs entre ces états. Puisque le Hamiltonien du problème obéit a l'algèbre enveloppante de Sp(6), il peut s'exprimer comme un polynôme de bas rang dans les générateurs de Sp(6) et le spectre vibrationnel des royaux peut donc être calculé. Ces résultats peuvent être appliqués pour tout noyau (tout Z). Nous parvenons à résoudre le problème compliqué de trouver les états de base en utilisant les méthodes de la fonction génératrice. Nous obtenons premièrement la fonction génératrice donnant des règles d'embranchement pour la chaine Sp(6), Sp(2) x 0(3) et nous interprétons les termes apparaissant dans la fonction génératrice comme des produits allongés d'un ensemble fini de diagrammes élémentaires permissibles qui forment une base d'intégrité. Les états de base de ce groupe et de ce sousgroupe sont définis en termes de cette base intégrité. […]

This thesis finds the basis states of the symplectic model for nuclear collective behaviour. We are able to find a complete set of states for Sp(6), the most important group of collective motions in nuclei. From the multitude of possible eigenstates we are interested in vibrational type ones, or Bohr-Mottelson type, which are at the same time a basis in the subgroup Sp(2) x 0(3) of Sp(6). The basis we find is not orthonormal but complete and nonredundant and we how to use it to determine generator matrix elements between these states. Since the Hamiltonian of the problem is in the enveloping algebra of Sp(6) it can be expressed as a low rank polynomial in the Sp(6) generators and the actual vibrational spectrum of nuclei is then calculable. The results are applicable to all nuclei (any Z). We are able to exactly solve the difficult problem of finding the basis states using generating function methods. We first obtain the generating function giving branching rules for the chain Sp(6), Sp(2) x 0(3) and we interpret the terms appearing in the generating function as stretched products of a finite set of elementary permissible diagrams which form the integrity basis. The basis states of the group and subgroup are defined in terms of this integrity basis. […]

Advisors/Committee Members: Sharp, R. T..

Subjects/Keywords: Nuclear collective models.; Generating functions.; Nuclear models.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Niculescu-Sanielevici, M. (1986). Generator Matrix Elements for Noncompact Sp(6) in a Sp(2) X 0(3) Basis. (Doctoral Dissertation). McGill University. Retrieved from https://escholarship.mcgill.ca/downloads/xk81jn93r.pdf ; https://escholarship.mcgill.ca/concern/theses/9p290c98s

Chicago Manual of Style (16^th Edition):

Niculescu-Sanielevici, Mihaela. “Generator Matrix Elements for Noncompact Sp(6) in a Sp(2) X 0(3) Basis.” 1986. Doctoral Dissertation, McGill University. Accessed January 15, 2021. https://escholarship.mcgill.ca/downloads/xk81jn93r.pdf ; https://escholarship.mcgill.ca/concern/theses/9p290c98s.

MLA Handbook (7^th Edition):

Niculescu-Sanielevici, Mihaela. “Generator Matrix Elements for Noncompact Sp(6) in a Sp(2) X 0(3) Basis.” 1986. Web. 15 Jan 2021.

Vancouver:

Niculescu-Sanielevici M. Generator Matrix Elements for Noncompact Sp(6) in a Sp(2) X 0(3) Basis. [Internet] [Doctoral dissertation]. McGill University; 1986. [cited 2021 Jan 15]. Available from: https://escholarship.mcgill.ca/downloads/xk81jn93r.pdf ; https://escholarship.mcgill.ca/concern/theses/9p290c98s.

Council of Science Editors:

Niculescu-Sanielevici M. Generator Matrix Elements for Noncompact Sp(6) in a Sp(2) X 0(3) Basis. [Doctoral Dissertation]. McGill University; 1986. Available from: https://escholarship.mcgill.ca/downloads/xk81jn93r.pdf ; https://escholarship.mcgill.ca/concern/theses/9p290c98s

21. McMillen, Brandon. The Knapsack Problem, Cryptography, and the Presidential Election.

Degree: MSin Mathematics, Department of Mathematics and Statistics, 2012, Youngstown State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ysu1340654189

► The 0-1 Knapsack Problem is an NP-hard optimization problem that has been studied extensively since the 1950s, due to its real world significance. The… (more)

Subjects/Keywords: Mathematics; Knapsack Problem; Cryptography; Generating Functions

…Functions In this section, we describe what is a generating function and how you can represent a… …problem and apply it to the presidential race. 3.1 Introduction Generating functions are used… …problem. In the next section, we will use the knapsack problem and its generating functions to… …number of ties. From our section on generating functions, we can easily determine this number… …cryptosystem have been approached, but have not had the power to sustain attacks. 3 Generating…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

McMillen, B. (2012). The Knapsack Problem, Cryptography, and the Presidential Election. (Masters Thesis). Youngstown State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ysu1340654189

Chicago Manual of Style (16^th Edition):

McMillen, Brandon. “The Knapsack Problem, Cryptography, and the Presidential Election.” 2012. Masters Thesis, Youngstown State University. Accessed January 15, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1340654189.

MLA Handbook (7^th Edition):

McMillen, Brandon. “The Knapsack Problem, Cryptography, and the Presidential Election.” 2012. Web. 15 Jan 2021.

Vancouver:

McMillen B. The Knapsack Problem, Cryptography, and the Presidential Election. [Internet] [Masters thesis]. Youngstown State University; 2012. [cited 2021 Jan 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ysu1340654189.

Council of Science Editors:

McMillen B. The Knapsack Problem, Cryptography, and the Presidential Election. [Masters Thesis]. Youngstown State University; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ysu1340654189

22. Singh, Sarabjeet. Branching Processes In Disease Epidemics.

Degree: PhD, Theoretical and Applied Mechanics, 2014, Cornell University

URL: http://hdl.handle.net/1813/37183

Subjects/Keywords: branching processes; infectious diseases; generating functions; asymptotics; scaling laws

…functions A.1 Generating functions . . . . . . . . . . A.2 Probability generating functions (… …1.13 can be solved by using probability generating functions (PGF, see Appendix A)… …100 104 108 108 109 109 110 111 114 115 116 117 118 122 126 PAGE A Probability generating… …134 C Appendix to chapter 2 136 C.1 Derivation of generating function for the BDI process… …yields a partial differential equation (PDE) for the generating function G: ∂G = βG2…

14 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Singh, S. (2014). Branching Processes In Disease Epidemics. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/37183

Chicago Manual of Style (16^th Edition):

Singh, Sarabjeet. “Branching Processes In Disease Epidemics.” 2014. Doctoral Dissertation, Cornell University. Accessed January 15, 2021. http://hdl.handle.net/1813/37183.

MLA Handbook (7^th Edition):

Singh, Sarabjeet. “Branching Processes In Disease Epidemics.” 2014. Web. 15 Jan 2021.

Vancouver:

Singh S. Branching Processes In Disease Epidemics. [Internet] [Doctoral dissertation]. Cornell University; 2014. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/1813/37183.

Council of Science Editors:

Singh S. Branching Processes In Disease Epidemics. [Doctoral Dissertation]. Cornell University; 2014. Available from: http://hdl.handle.net/1813/37183

University of Michigan

23. Woods, Kevin M. Rational generating functions and lattice point sets.

Degree: PhD, Pure Sciences, 2004, University of Michigan

URL: http://hdl.handle.net/2027.42/124338

► We prove that, for any fixed d, there is a polynomial time algorithm for computing the generating function of any projection of the set of… (more)

Subjects/Keywords: Frobenius Problem; Generating Functions; Lattice Point; Neighborhood Complex; Rational; Sets

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Woods, K. M. (2004). Rational generating functions and lattice point sets. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/124338

Chicago Manual of Style (16^th Edition):

Woods, Kevin M. “Rational generating functions and lattice point sets.” 2004. Doctoral Dissertation, University of Michigan. Accessed January 15, 2021. http://hdl.handle.net/2027.42/124338.

MLA Handbook (7^th Edition):

Woods, Kevin M. “Rational generating functions and lattice point sets.” 2004. Web. 15 Jan 2021.

Vancouver:

Woods KM. Rational generating functions and lattice point sets. [Internet] [Doctoral dissertation]. University of Michigan; 2004. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/2027.42/124338.

Council of Science Editors:

Woods KM. Rational generating functions and lattice point sets. [Doctoral Dissertation]. University of Michigan; 2004. Available from: http://hdl.handle.net/2027.42/124338

Universidade Estadual de Campinas

24. Nolibos, Denilson Amaral. Relações de referência e aplicações: Recurrent relations and applications.

Degree: 2010, Universidade Estadual de Campinas

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

► Abstract: This study is about Recurrence Relations and some of their methods of resolution. We tried to generate an easy-to-read-text which stimulates the reader to… (more)

Subjects/Keywords: Análise combinatória; Relações de recorrência; Funções geradoras; Combinatorial analysis; Recurrence relations; Generating functions

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Nolibos, D. A. (2010). Relações de referência e aplicações: Recurrent relations and applications. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/306042

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):

Nolibos, Denilson Amaral. “Relações de referência e aplicações: Recurrent relations and applications.” 2010. Thesis, Universidade Estadual de Campinas. Accessed January 15, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306042.

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

MLA Handbook (7^th Edition):

Nolibos, Denilson Amaral. “Relações de referência e aplicações: Recurrent relations and applications.” 2010. Web. 15 Jan 2021.

Vancouver:

Nolibos DA. Relações de referência e aplicações: Recurrent relations and applications. [Internet] [Thesis]. Universidade Estadual de Campinas; 2010. [cited 2021 Jan 15]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306042.

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

Council of Science Editors:

Nolibos DA. Relações de referência e aplicações: Recurrent relations and applications. [Thesis]. Universidade Estadual de Campinas; 2010. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306042

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

Universidade Estadual de Campinas

25. Mucelin, Cláudio. Demonstrações bijetivas em partições: Bijectives demonstrations in partitions.

Degree: 2011, Universidade Estadual de Campinas

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

► Abstract: This work presents some results about partitions of integers numbers and their importance in the history of Mathematics and in the Theory of the… (more)

Subjects/Keywords: Teoria dos números; Partições (Matemática); Números inteiros; Euler, Teorema de; Funções geradoras; Identidades combinatórias; Number theory; Partities (Mathematics); Integers; Euler theorem; Generating functions; Combinatorial identities

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Mucelin, C. (2011). Demonstrações bijetivas em partições: Bijectives demonstrations in partitions. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/306031

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):

Mucelin, Cláudio. “Demonstrações bijetivas em partições: Bijectives demonstrations in partitions.” 2011. Thesis, Universidade Estadual de Campinas. Accessed January 15, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306031.

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

MLA Handbook (7^th Edition):

Mucelin, Cláudio. “Demonstrações bijetivas em partições: Bijectives demonstrations in partitions.” 2011. Web. 15 Jan 2021.

Vancouver:

Mucelin C. Demonstrações bijetivas em partições: Bijectives demonstrations in partitions. [Internet] [Thesis]. Universidade Estadual de Campinas; 2011. [cited 2021 Jan 15]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306031.

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

Council of Science Editors:

Mucelin C. Demonstrações bijetivas em partições: Bijectives demonstrations in partitions. [Thesis]. Universidade Estadual de Campinas; 2011. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306031

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

Universidade Estadual de Campinas

26. Cunha Filho, Jair. Variações do diagrama de Ferrers, partições planas e funções geradoras.

Degree: 2006, Universidade Estadual de Campinas

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

► Abstract: Tn this thesis we study some variations of the Ferrers Diagram where we present, in particular, one that involves a infinite hexagonal diagram including… (more)

Subjects/Keywords: Partições (Matemática); Funções geradoras; Análise combinatória; Partitions, Mathematics; Generating functions; Combinatorial analysis

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cunha Filho, J. (2006). Variações do diagrama de Ferrers, partições planas e funções geradoras. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/307519

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):

Cunha Filho, Jair. “Variações do diagrama de Ferrers, partições planas e funções geradoras.” 2006. Thesis, Universidade Estadual de Campinas. Accessed January 15, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307519.

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

MLA Handbook (7^th Edition):

Cunha Filho, Jair. “Variações do diagrama de Ferrers, partições planas e funções geradoras.” 2006. Web. 15 Jan 2021.

Vancouver:

Cunha Filho J. Variações do diagrama de Ferrers, partições planas e funções geradoras. [Internet] [Thesis]. Universidade Estadual de Campinas; 2006. [cited 2021 Jan 15]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/307519.

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

Council of Science Editors:

Cunha Filho J. Variações do diagrama de Ferrers, partições planas e funções geradoras. [Thesis]. Universidade Estadual de Campinas; 2006. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/307519

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

27. Mateus Rodrigues Iritani. Modelos de sobrevivência de longa-duração : uma abordagem unificada.

Degree: 2008, Universidade Federal de São Carlos

URL: http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=2152

►

Em análise de sobrevivência, determinados estudos caracterizam-se por apresentar uma fração significativa de sobreviventes, ou seja, pacientes em tratamento que não apresentaram o evento de… (more)

▼

Em análise de sobrevivência, determinados estudos caracterizam-se por apresentar uma fração significativa de sobreviventes, ou seja, pacientes em tratamento que não apresentaram o evento de interesse, mesmo após um longo período de acompanhamento. Assim considerar modelos de sobrevivência usuais, que assumem que a função de sobrevivência converge para zero quando a variável tempo tende a infinito, pode não ser adequado. Nesse trabalho é apresentado uma extensão do modelo proposto por Chen, Ibrahim e Sinha (1999), usando a função geradora de uma sequência de números reais introduzida por Feller (1967). Essa extensão possibilitou o desenvolvimento de uma teoria unificada para os modelos de sobrevivência de longa-duração, Rodrigues et al. (2008). Mostra-se que modelos já existentes na literatura são considerados casos particulares da teoria unificada, por exemplo, o modelo de Berkson &Gage (1952). Também tem-se em Rodrigues et al. (2008), que a função geradora de longa-duração satisfaz a propriedade de risco proporcional se, e somente se, o número de causas competitivas relacionadas a ocorrência do evento de interesse segue uma distribuição de Poisson. Como ilutração utiliza-se um conjunto de dados reais.

In survival analysis some studies show a meaningful cure rate after treatment followup, so considering standard survival models can not be appropriate. In this work is extended the long-term survival model proposed by Chen, Ibrahim and Sinha (1999) via generating function of a real sequence introduced by Feller (1967). This new formulation is the uni_cation of the long-term survival models proposed by Rodrigues el al. (2008). Also, as in Rodrigues el al. (2008) it is shown that the long-term survival generating function satis_es the proportional hazard property if only if the number of competing causes related to the occurence of a event of interest follows a Poisson distribution. A real data set is considered to illustrate this approach.

Advisors/Committee Members: Josemar Rodrigues.

Subjects/Keywords: Análise de sobrevivência; Distribuição de Poisson; Distribuição binomial; Função geradora; Risco competitivo; ESTATISTICA; Long-term survival; Poisson; Bernolli; Competing risks; Generating Function; Proportional hazards functions

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Iritani, M. R. (2008). Modelos de sobrevivência de longa-duração : uma abordagem unificada. (Thesis). Universidade Federal de São Carlos. Retrieved from http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=2152

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):

Iritani, Mateus Rodrigues. “Modelos de sobrevivência de longa-duração : uma abordagem unificada.” 2008. Thesis, Universidade Federal de São Carlos. Accessed January 15, 2021. http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=2152.

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

MLA Handbook (7^th Edition):

Iritani, Mateus Rodrigues. “Modelos de sobrevivência de longa-duração : uma abordagem unificada.” 2008. Web. 15 Jan 2021.

Vancouver:

Iritani MR. Modelos de sobrevivência de longa-duração : uma abordagem unificada. [Internet] [Thesis]. Universidade Federal de São Carlos; 2008. [cited 2021 Jan 15]. Available from: http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=2152.

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

Council of Science Editors:

Iritani MR. Modelos de sobrevivência de longa-duração : uma abordagem unificada. [Thesis]. Universidade Federal de São Carlos; 2008. Available from: http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=2152

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

28. Gershon, Arthur. New Directions in the Enumeration of Tilings on a Chessboard .

Degree: 2015, Indiana University

URL: http://hdl.handle.net/2022/20745

Subjects/Keywords: tilings; enumeration; generating functions; transfer matrix; asymptotic enumeration; convex analysis

…constant 1 + m+1 2 . We then use Theorem 1.3 to actually compute generating functions Tm… …We put this abstract formula into practice to find concrete generating functions for more… …3m−1 um . 21 We pause now to make some general remarks about generating functions… …to compute generating functions for the number of ROSAs on m × n chessboards for any fixed… …thereby computes for us the corresponding generating function Tm (x) = P n n≥0 T…

1 more image…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Gershon, A. (2015). New Directions in the Enumeration of Tilings on a Chessboard . (Thesis). Indiana University. Retrieved from http://hdl.handle.net/2022/20745

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):

Gershon, Arthur. “New Directions in the Enumeration of Tilings on a Chessboard .” 2015. Thesis, Indiana University. Accessed January 15, 2021. http://hdl.handle.net/2022/20745.

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

MLA Handbook (7^th Edition):

Gershon, Arthur. “New Directions in the Enumeration of Tilings on a Chessboard .” 2015. Web. 15 Jan 2021.

Vancouver:

Gershon A. New Directions in the Enumeration of Tilings on a Chessboard . [Internet] [Thesis]. Indiana University; 2015. [cited 2021 Jan 15]. Available from: http://hdl.handle.net/2022/20745.

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

Council of Science Editors:

Gershon A. New Directions in the Enumeration of Tilings on a Chessboard . [Thesis]. Indiana University; 2015. Available from: http://hdl.handle.net/2022/20745

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

29. Nguyen Luu, Danh. The Computational Complexity of Presburger Arithmetic.

Degree: Mathematics, 2018, UCLA

URL: http://www.escholarship.org/uc/item/6j9051vs

► A wide variety of problems in Discrete Optimization and Integer Programming can be naturally phrased in the language of Presburger Arithmetic (PA), which is the… (more)

▼ A wide variety of problems in Discrete Optimization and Integer Programming can be naturally phrased in the language of Presburger Arithmetic (PA), which is the first order logic on the integers with only additions and inequalities. Understanding the exact computational complexity of PA is a classical topic in both logic and computer science. In this dissertation, we give answers to several open questions in this area.Most important in PA are the numbers of variables and inequalities involved. The main question addressed in Part I of the dissertation is: By restricting the number of variables and inequalities in PA, do we obtain polynomial complexity? We give a negative solution to this, which also settles two questions by Kannan and Barvinok–Woods on Parametric Integer Programming and Short Presburger Arithmetic, respectively. Our argument combines elements from Number Theory and Discrete Geometry. As applications, we apply our tools to analyze the VC-dimensions of PA formulas, as well as a variant theory, called Parametric Presburger Arithmetic.In Part II, we investigate the related theory of Short Generating Functions developed by Barvinok and Woods. First, we first extend their polynomial time algorithm for enumerating projected integer points in polytopes to the unbounded polyhedra case. Then we demon-strate several limitations of their general theory under simple point set operations such as projection and union, in the sense that the lengths of the generating functions do not remain polynomially bounded. The reasoning here parallels with Part I, and crucially exploits the structures of PA definable sets.In Part III, we present two different problems. The first one concerns an extension of PA with scalar multiplications by algebraic irrationals. We show that it has high nonelementary complexity far exceeding that of classical PA, even with a restricted number of variables and inequalities. The second problem is about minimizing the number of integer points in a polytope under translation. We show that it is NP-hard by embedding arbitrary polynomial functions as integer point counting functions of polytopes. We derive from this a consequence about the universality of Ehrhart quasi-polynomials.

Subjects/Keywords: Mathematics; complexity; Integer Programming; Presburger Arithmetic; short generating functions

…98 Short generating functions 100 6 A strengthening of the Barvinok–Woods theorem… …7 Complexity of short generating functions . . . . . . . . . . . . . . . . . . . 123 7.1… …hierarchy of generating functions . . . . . . . . . . . . . . . . . . . . . . . 140 7.6 Short…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Nguyen Luu, D. (2018). The Computational Complexity of Presburger Arithmetic. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/6j9051vs

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):

Nguyen Luu, Danh. “The Computational Complexity of Presburger Arithmetic.” 2018. Thesis, UCLA. Accessed January 15, 2021. http://www.escholarship.org/uc/item/6j9051vs.

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

MLA Handbook (7^th Edition):

Nguyen Luu, Danh. “The Computational Complexity of Presburger Arithmetic.” 2018. Web. 15 Jan 2021.

Vancouver:

Nguyen Luu D. The Computational Complexity of Presburger Arithmetic. [Internet] [Thesis]. UCLA; 2018. [cited 2021 Jan 15]. Available from: http://www.escholarship.org/uc/item/6j9051vs.

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

Council of Science Editors:

Nguyen Luu D. The Computational Complexity of Presburger Arithmetic. [Thesis]. UCLA; 2018. Available from: http://www.escholarship.org/uc/item/6j9051vs

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

University of Central Florida

30. Galiffa, Daniel. The Sheffer B-type 1 Orthogonal Polynomial Sequences.

Degree: 2009, University of Central Florida

URL: https://stars.library.ucf.edu/etd/3920

► In 1939, I.M. Sheffer proved that every polynomial sequence belongs to one and only one type. Sheffer extensively developed properties of the B-Type 0 polynomial… (more)

Subjects/Keywords: Sheffer; B-Type; Orthogonal polynomials; Characterizations; Three-term recurrence relation; Generating functions; Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Galiffa, D. (2009). The Sheffer B-type 1 Orthogonal Polynomial Sequences. (Doctoral Dissertation). University of Central Florida. Retrieved from https://stars.library.ucf.edu/etd/3920

Chicago Manual of Style (16^th Edition):

Galiffa, Daniel. “The Sheffer B-type 1 Orthogonal Polynomial Sequences.” 2009. Doctoral Dissertation, University of Central Florida. Accessed January 15, 2021. https://stars.library.ucf.edu/etd/3920.

MLA Handbook (7^th Edition):

Galiffa, Daniel. “The Sheffer B-type 1 Orthogonal Polynomial Sequences.” 2009. Web. 15 Jan 2021.

Vancouver:

Galiffa D. The Sheffer B-type 1 Orthogonal Polynomial Sequences. [Internet] [Doctoral dissertation]. University of Central Florida; 2009. [cited 2021 Jan 15]. Available from: https://stars.library.ucf.edu/etd/3920.

Council of Science Editors:

Galiffa D. The Sheffer B-type 1 Orthogonal Polynomial Sequences. [Doctoral Dissertation]. University of Central Florida; 2009. Available from: https://stars.library.ucf.edu/etd/3920

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations