Home| Contact Us| New Journals| Browse Journals| Journal Prices| For Authors|

Print ISSN: 0976-4143
Online ISSN:
0976-4151


  About JISR
  DLINE Portal Home
Home
Aims & Scope
Editorial Board
Current Issue
Next Issue
Previous Issue
Sample Issue
Upcoming Conferences
Self-archiving policy
Alert Services
Be a Reviewer
Publisher
Paper Submission
Subscription
Contact us
 
  How To Order
  Order Online
Price Information
Request for Complimentary
Print Copy
 
  For Authors
  Guidelines for Contributors
Online Submission
Call for Papers
Author Rights
 
 
RELATED JOURNALS
Journal of Digital Information Management (JDIM)
International Journal of Computational Linguistics Research (IJCL)
International Journal of Web Application (IJWA)

 

 
Journal of Information Security Research

A Study of the Exponential Functions, Combinatorial Problems and the Generalizations Issues
Predrag Rajkovi, Slaana Marinkovi, Miomir Stankovi
University of Niš, Serbia, Aleksandra Medvedeva 14, Niš., University of Niš, Serbia, A. Medvedeva 12, Niš., Mathematical Institute SASA, Belgrade, Serbia
Abstract: For many years the concept exponential function has been a subject for interpretations, extensions and applications. Like the various types of orthogonal polynomials. In this paper we have highlighted the importance of the combinatorial problems. One such type is the Motzkin paths with provide positive weightage paths. We have discussed the continued fractions, the moments of the functions and generalizations of the exponential function. These discussions form an important of information security issues.
Keywords: Paths, Combinatorics, Exponential Functions, Orthogonal Polynomials A Study of the Exponential Functions, Combinatorial Problems and the Generalizations Issues
DOI:https://doi.org/10.6025/jisr/2021/12/2/47-58
Full_Text   PDF 1.46 MB   Download:   236  times
References:

[1] Shapiro, L. W. (1981). A Combinatorial Proof of a Chebyshev Polynomial Identity, Discrete Mathematics, vol. 34, p. 203-206.
[2] Viennot, G. (1983). Une Theorie Combinatoire des Polynomes Orthogonaux Generaux, Notes from a conference at the Universite du Quebec a Montreal.
[3] Andrews, G. E. (1976). The Theory of Partitions, Encyclopedia of Math., vol. 2, Addison-Wesley.
[4] Stanley, R. P. (2000). Enumerative Combinatorics, vol. 1, Cambridge University Press.
[5] Benjamin, A. T. Quinn, J. J. (2003). Proofs that Really Count, vol. 27, Washington, DC.
[6] Drake, D. (2009). The Combinatorics of Associated Hermite Polynomials, European Journal of Combinatorics, vol. 30, p. 1005-1021.
[7] Little, D. P., Sellers, J. A. (2010). A Tiling Approach to Eight Identities of Rogers, European Journal of Combinatorics, vol. 31, p. 694-709.
[8] Stanton, D. (2000). Orthogonal Polynomials and Combinatorics, Special Functions 2000, Kluwer, p. 389-411.
[9] Rajkovi, P. M., Marinkovi, S. D., Stankovi, M. S. (2008). Differential and Integral Calculus of Basic Hypergeometric Functions, (In Serbian) Niš.
[10] Exton, H. (1983). q-Hypergeometric Functions and Applications.
[11] Noreanini, R., Tourneux, J. L., Viea, L. (1995). More on the qoscillator Algebra and q-orthogonal Polynomials, I. Phys. A: Math Gen., vol. 28, p L287-LZ93.
[12] Stankovi, M. S., Marinkovi, S. D., Rajkovi, P. M. (2011). The Deformed Exponential Functions of Two Variables in the Context of Various Statistical Mechanics, Applied Mathematics and Computation, vol. 218, p. 2439-2448.
[13] Flajolet, P., Sedgewick, R. (2009). Analytic Combinatorics, Cambridge University Press.
[14] Bartschi, A., Geissmann, B., Graf, D., Hruz, T., Penna, P., Tschager, T. On Computing the Total Displacement Number via Weighted Motzkin Paths, arXiv:1606.05538v1 [cs.DS]


Home | Aim & Scope | Editorial Board | Author Guidelines | Publisher | Subscription | Previous Issue | Contact Us |Upcoming Conferences|Sample Issues|Library Recommendation Form|

 

Copyright © 2011 dline.info