Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Generating functions and their applications
Download
index.pdf
Date
2010
Author
Bilgin, Begül
Metadata
Show full item record
Item Usage Stats
161
views
178
downloads
Cite This
Generating functions are important tools that are used in many areas of mathematics and especially statistics. Besides analyzing the general structure of sequences and their asymptotic behavior; these functions, which can be roughly thought as the transformation of sequences into functions, are also used effciently to solve combinatorial problems. In this thesis, the effects of the transformations of generating functions on their corresponding sequences and the effects of the change in sequences on the generating functions are examined. With these knowledge, the generating functions for the resulting sequence of some combinatorial problems such as number of partitions, number of involutions, Fibonacci numbers and Catalan numbers are found. Moreover, some mathematical identities are proved by using generating functions. The sequences are the bases of especially symmetric key cryptosystems in cryptography. It is seen that by using generating functions, linear complexities and periods of sequences generated by constant coeffcient linear homogeneous recursions, which are used in linear feedback shift register (LFSR) based stream ciphers, can be calculated. Hence studying generating functions leads to have a better understanding in them. Therefore, besides combinatorial problems, such recursions are also examined and the results are used to observe the linear complexity and the period of LFSR’s combined in different ways to generate “better” system of stream cipher.
Subject Keywords
Mathematics.
URI
http://etd.lib.metu.edu.tr/upload/12612437/index.pdf
https://hdl.handle.net/11511/19964
Collections
Graduate School of Applied Mathematics, Thesis
Suggestions
OpenMETU
Core
Non-commutative holomorphic functions in elements of a Lie algebra and the absolute basis problem
Dosi (Dosiev), A. A. (IOP Publishing, 2009-11-01)
We study the absolute basis problem in algebras of holomorphic functions in non-commuting variables generating a finite-dimensional nilpotent Lie algebra g. This is motivated by J. L. Taylor's programme of non-commutative holomorphic functional calculus in the Lie algebra framework.
Betti Numbers of Smooth Schubert Varieties and the Remarkable Formula of Kostant, Macdonald, Shapiro, and Steinberg
Akyıldız, Ersan (2012-01-01)
The purpose of this note is to give a refinement of the product formula proved in [1] for the Poincare polynomial of a smooth Schubert variety in the flag variety of an algebraic group G over C. This yields a factorization of the number of elements in a Bruhat interval [e,w] in the Weyl group W of G provided the Schubert variety associated to w is smooth. This gives an elementary necessary condition for a Schubert variety in the flag variety to be smooth.
Isomorphism classes of elliptic curves over finite fields of characteristic two
Kırlar, Barış Bülent; Akyıldız, Ersan; Department of Mathematics (2005)
In this thesis, the work of Menezes on the isomorphism classes of elliptic curves over finite fields of characteristic two is studied. Basic definitions and some facts of the elliptic curves required in this context are reviewed and group structure of elliptic curves are constructed. A fairly detailed investigation is made for the isomorphism classes of elliptic curves due to Menezes and Schoof. This work plays an important role in Elliptic Curve Digital Signature Algorithm. In this context, those isomorphi...
A semismooth newton method for generalized semi-infinite programming problems
Tezel Özturan, Aysun; Karasözen, Bülent; Department of Mathematics (2010)
Semi-infinite programming problems is a class of optimization problems in finite dimensional variables which are subject to infinitely many inequality constraints. If the infinite index of inequality constraints depends on the decision variable, then the problem is called generalized semi-infinite programming problem (GSIP). If the infinite index set is fixed, then the problem is called standard semi-infinite programming problem (SIP). In this thesis, convergence of a semismooth Newton method for generalize...
Pre-service elementary mathematics teachers’ views about using graphing calculators in elementary school algebra: the case of using Classpad
Kaplan, Merve; Çetinkaya, Bülent; Erbaş, Ayhan Kürşat; Department of Secondary Science and Mathematics Education (2011)
Mathematics education could and should benefit from technology in order to improve teaching and learning, particularly in topics where visualizations and connections to other concepts are needed. Handheld technologies such as graphing calculators can provide students with visualization, confirmation and exploration of problems and concepts they are learning. Handheld graphing technologies have been taken place widely in elementary and secondary level mathematics courses and considered to be beneficial in va...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
B. Bilgin, “Generating functions and their applications,” M.S. - Master of Science, Middle East Technical University, 2010.