Search

In this study, we define and examine the Richard and Raoul sequences and we deal with, in detail, two special cases, namely, Richard and Raoul sequences. We indicate that there are close relations between Richard and Raoul numbers and Padovan and Perrin numbers. Moreover, we present the Binet-like formulas, generating functions, summation formulas, and some identities for these sequences.

In this article, we define q-cosine and q-sine Apostol-type Frobenius–Euler polynomials and derive interesting relations. We also obtain new properties by making use of power series expansions of q-trigonometric functions, properties of q-exponential functions, and q-analogues of the binomial theorem. By using the Mathematica program, the computational formulae and graphical representation for the aforementioned polynomials are obtained. By making use of a partial derivative operator, we derived some interesting finite combinatorial sums. Finally, we detail some special cases for these results.

We outline symmetry-based combinatorial and computational techniques to enumerate the colorings of all the hyperplanes (q = 1–8) of the 8-dimensional hypercube (8-cube) and for all 185 irreducible representations (IRs) of the 8-dimensional hyperoctahedral group, which contains 10,321,920 symmetry operations. The combinatorial techniques invoke the Möbius inversion method in conjunction with the generalized character cycle indices for all 185 IRs to obtain the generating functions for the colorings of eight kinds of hyperplanes of the 8-cube, such as vertices, edges, faces, cells, tesseracts, and hepteracts. We provide the computed tables for the colorings of all the hyperplanes of the 8-cube. We also show that the developed techniques have a number of chemical, biological, chiral, and other applications that make use of such recursive symmetries.

Many properties of special polynomials, such as recurrence relations, sum formulas, and symmetric properties, have been studied in the literature with the help of generating functions and their functional equations. In this paper, we define the generalized (p,q)-Bernoulli–Fibonacci and generalized (p,q)-Bernoulli–Lucas polynomials and numbers by using the (p,q)-Bernoulli numbers, unified (p,q)-Bernoulli polynomials, h(x)-Fibonacci polynomials, and h(x)-Lucas polynomials. We also introduce the generalized bivariate (p,q)-Bernoulli–Fibonacci and generalized bivariate (p,q)-Bernoulli–Lucas polynomials and numbers. Then, we derive some properties of these newly established polynomials and numbers by using their generating functions with their functional equations. Finally, we provide some families of bilinear and bilateral generating functions for the generalized bivariate (p,q)-Bernoulli–Fibonacci polynomials.

In this paper, we derive some new symmetric properties of k-Fibonacci numbers by making use of symmetrizing operator. We also give some new generating functions for the products of some special numbers such as k-Fibonacci numbers, k-Pell numbers, Jacobsthal numbers, Fibonacci polynomials and Chebyshev polynomials.

Let $b_{\ell;3}(n)$ denote the number of $\ell$-regular partitions of $n$ in 3 colours. In this paper, we find some general generating functions and new infinite families of congruences modulo arbitrary powers of $3$ when $\ell\in\{9,27\}$. For instance, for positive integers $n$ and $k$, we have\begin{align*}b_{9;3}\left(3^k\cdot n+3^k-1\right)&\equiv0~\left(\mathrm{mod}~3^{2k}\right),\\b_{27;3}\left(3^{2k+3}\cdot n+\dfrac{3^{2k+4}-13}{4}\right)&\equiv0~\left(\mathrm{mod}~3^{2k+5}\right).\end{align*}

We propose an algorithm for obtaining the common transfer digraph $ D^*_m$ for enumeration of 2-factors in graphs from the title all of which with $m n$ vertices ($m, n \in N, m >1 $). The numerical data gathered for $m, 19 pages, with Appendix 88 pages, 8 figures, 5 Tables

We refine necessary and sufficient conditions for the generating series of a weighted model of a quarter plane walk to be differentially algebraic. In addition, we give algorithms based on the theory of Mordell-Weil lattices, that, for each weighted model, yield polynomial conditions on the weights determining this property of the associated generating series., 37 Pages

In this paper, the Fourier series expansions of Apostol-type Frobenius–Euler polynomials of complex parameters and order α are derived, and consequently integral representations of these polynomials are established. This paper provides some techniques in computing the symmetries of the defining equation of Apostol-type Frobenius–Euler polynomials resulting in their expansions and integral representations.

Orientador: José Plínio de Oliveira Santos Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica Resumo: Este trabalho trata da aplicação do Método Simbólico na resolução de problemas de Combinatória. A vantagem desta técnica é o cálculo direto de uma expressão fechada para a Função Geradora F(z) do problema escrito como uma Série de Potências. Consequentemente garantimos a facilidade na enumeração da sequência que queremos a partir do coeficiente de zn de F(z). O desenvolvimento de nosso estudo foi feito aplicando-se o método a dois tipos de Classes: Rotuladas e não Rotuladas, apontando as diferenças básicas entre elas através de exemplos e resultados teóricos. Ao final, concluímos que a enumeração independe do tipo de modelagem feita para o problema Abstract: This work deals with the application of the Symbolic Method in the solutions of combinatorial problems. The advantage of this technique is the direct calculus for the exact expression of the Generating Function F(z) of the problem, written as a Power Series. Consequently, we ensure the enumeration of the desired sequence, from the coefficient of zn of F(z). Our study was developed by applying the method in two types of Classes: Labeled and unlabelled, pointing the basic differences between them through examples and theoretical results. Finally, we concluded that the enumeration does not depend of the type of the model chosen for the problem Mestrado Matemática Aplicada Mestra em Matemática Aplicada

Orientador: Jose Plinio de Oliveira Santos Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica Resumo: Neste trabalho são desenvolvidos conceitos algébricos, analíticos e combinatórios que culminam no Teorema de Enumeração de Pólya; bem como são fornecidas muitas de suas aplicações em enumeração de padrões (grafos, colorações geométricas, tipos e permutações, etc). Tal teorema clássico, que tem suas bases em Teoria dos Grupos, utiliza fundamentalmente o conceito de funções geradoras, o que permite grande generalidade e computabilidade de resultados. Finalmente são apresentadas algumas generalizações do resultado principal, aplicações destas e também uma importante interpretação probabilística Abstract: In this dissertation we present algebraic, analytic and combinatorial results that are used to prove Polya's Enumeration Theorem. Applications to counting patterns (graphs, colourings, permutations, etc.) are given. This classical Theorem has its foundations on the theory of groups and uses, mainly, the concept of generating functions which allows great generality and computability of results. At the end some generalizations of the main theorem are given including applications and, aiso, an important probabilistic interpretation Mestrado Combinatória Enumerativa Mestre em Matemática Aplicada

In this paper, we introduce the two variable generalized Laguerre polynomials (2VGLP) \({}_GL^{(\alpha,\beta)}_n(x,y)\). Some properties of these polynomials such as generating functions, summation formulae and expansions are also discussed.

In this paper, we introduce a new operator in order to derive some new symmetric properties of k-Fibonacci and k-Pell numbers and Tchebychev polynomials of first and second kind. By making use of the new operator defined in this paper, we give some new generating functions for k-Fibonacci and k-Pell numbers and Fibonacci polynomials.

The aim of this work is to introduce a new sequence of numbers called k-Pell hybrid numbers and the presentation of some algebraic properties involving this sequence. In addition, we presen...

The method of integral representation and calculation of the combinatorial sums of various type (the method of coefficients) using the formal Laurent power series over $\mathbbm C$, the theory of analitical functions and the theory of multiple residues in $\mathbbm C^n$ were proposed by the author in the late seventies. This method was applied in various fields of mathematics. The method of coefficients is important for a difficult problem of calculation of the multiple sums with linear constraints on summation indices. Various combinatorial problems can be formulated in terms of such constraints. The calculation of the multiple sum with $q$-binomial coefficients and linear recurrent constraints on summation indices was published by the author in \guillemotleft The Bulletin of Irkutsk State University. Series Mathematics.\guillemotright in 2016. This problem appears at the enumeration of all own $t$-dimensional subspaces of the space $V_m$ over field $GF(q)$. V.P. Krivokolesko and E.K. Leinartas in \guillemotleft The Bulletin of Irkutsk State University. Series Mathematics.\guillemotright\, in 2012, using the Hadamard composition have proved the multiple identity with polynomial coefficients and various constraints on the limits of summation, containing the family of free parameters. This identity is generalisation of the identities studied earlier by several authors, since constructions of the Deubechies filters in the wavelets theory. Using the author's method of coefficients the short and simple calculation of Krivokolesko--Leinartas sum is carried out. These calculations also automatically provides an equivalent way of calculation of the specified sum by means of a traditional method of generation functions, using only the well-known operations over corresponding multiple formal Laurent power series.

Chebyshev polynomials are traditionally applied to the approximation theory where are used in polynomial interpolation and also in the study of di erential equations, in particular in some special cases of Sturm-Liouville di erential equation. Many of the operational techniques presented, by using suitable integral transforms, via a symbolic approach to the Laplace transform, allow us to introduce polynomials recognized belonging to the families of Chebyshev of multi-dimensional type. The non-standard approach come out from the theory of multi-index Hermite polynomials, in particular by using the concepts and the related formalism of translation operators.

This paper is concerned with the sequence of positive linear operators obtained by certain generating functions of polynomials and with investigation of its approximation properties in detail. Initially, the convergence theorem is expressed for the sequence constructed in this article using the universal Korovkin-type theorem and then considering the modulus of continuity and the Lipschitz class, an estimate of the degree of approximation is obtained for this sequence of positive linear operators. Moreover, the generalization involving integral of these operators is defined and then their approximation properties are examined.

Orientador: José Plínio de Oliveira Santos Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica Resumo: Neste trabalho estudamos dois importantes tópicos em combinatória. O primeiro deles é o Teorema Enumerativo de Pólya. No capítulo 2 é dada uma demonstração deste teorema usando o Teorema de Burnside. Também neste capítulo, encontram-se algumas de suas diversas aplicações. O segundo tópico trata de Teoria de Partições. Esta dissertação aborda alguns objetos de estudo desta área. O primeiro objeto é o método de Partition Analisys, usado para achar funções geradoras de vários tipos de interessantes funções de partição. Ainda relacionado a funções geradoras, o capítulo 3 aborda um pouco sobre q-séries. O segundo objeto é o método gráfico, que utiliza a representação gráfica de Ferrers para uma partição. Ainda neste capítulo, são usados os conceitos de quadrado de Durfee e símbolo de Frobenius para provar algumas identidades. Abstract: This paper presents two important topics in combinatorics. The first one is the Pólya Enumeration Theorem. In chapter 2 is given a demonstration of this theorem by Burnside's Theorem. Also in this chapter are some of their various applications. The second topic deals with the Theory of Partition. This dissertation addresses some aspects of the study on this area. The first is Partition Analysis, this method is used to find the generating functions of various kinds of interesting partition functions. In the third chapter we deal with q-series which is also related to generating functions. The second is the graphical method, which uses a Ferrers's graphical representation of a partition. In addition, we use the concepts of Durfee square and Frobenius's symbol to prove some identities. Mestrado Mestre em Matemática

In this paper, we give some new generating functions of the products of (p, q)-Fibonacci numbers, (p, q) -Lucas numbers, (p, q)-Pell numbers, $$\left( p,q\right)$$ -Pell Lucas numbers, (p, q)-Jacobsthal numbers, and (p, q)-Jacobsthal Lucas numbers with 2-orthogonal Chebyshev polynomials and trivariate Fibonacci polynomials.

We re-visit the asymptotics of a binomial and a Poisson sum which arose as (average) displacement costs when moving randomly placed sensors to anchor positions. The first-order asymptotics of these sums were derived in several stages in a series of recent papers. In this paper, we give a unified approach based on the classical Laplace method with which one can also derive more terms in the asymptotic expansions. Moreover, in a special case, full asymptotic expansions can be given which even hold as identities. This will be proved by a combinatorial approach and systematic ways of computing all coefficients of these identities will be discussed as well.

The aim of this paper is to give generating functions for parametrically generalized polynomials that are related to the combinatorial numbers, the Bernoulli polynomials and numbers, the Euler polynomials and numbers, the cosine-Bernoulli polynomials, the sine-Bernoulli polynomials, the cosine-Euler polynomials, and the sine-Euler polynomials. We investigate some properties of these generating functions. By applying Euler’s formula to these generating functions, we derive many new and interesting formulas and relations related to these special polynomials and numbers mentioned as above. Some special cases of the results obtained in this article are examined. With this special case, detailed comments and comparisons with previously available results are also provided. Furthermore, we come up with open questions about interpolation functions for these polynomials. The main results of this paper highlight the existing symmetry between numbers and polynomials in a more general framework. These include Bernouilli, Euler, and Catalan polynomials.

Differential equations are commonly used to model various types of real life applications. The complexity of these models may often hinder the ability to acquire an analytical solution. To overcome this drawback, numerical methods were introduced to approximate the solutions. Initially when developing a numerical algorithm, researchers focused on the key aspect which is accuracy of the method. As numerical methods becomes more and more robust, accuracy alone is not sufficient hence begins the pursuit of efficiency which warrants the need for reducing computational cost. The current research proposes a numerical algorithm for solving initial value higher order ordinary differential equations (ODEs). The proposed algorithm is derived as a three point block multistep method, developed in an Adams type formulae (3PBCS) and will be used to solve various types of ODEs and systems of ODEs. Type of ODEs that are selected varies from linear to nonlinear, artificial and real life problems. Results will illustrate the accuracy and efficiency of the proposed three point block method. Order, stability and convergence of the method are also presented in the study.

In the present paper, we aim to extend the Hurwitz–Lerch zeta function $\varPhi _{\delta ,\varsigma ;\gamma }(\xi ,s,\upsilon ;p)$ Φ δ , ς ; γ ( ξ , s , υ ; p ) involving the extension of the beta function (Choi et al. in Honam Math. J. 36(2):357–385, 2014). We also study the basic properties of this extended Hurwitz–Lerch zeta function which comprises various integral formulas, a derivative formula, the Mellin transform, and the generating relation. The fractional kinetic equation for an extended Hurwitz–Lerch zeta function is also obtained from an application point of view. Furthermore, we obtain certain interesting relations in the form of particular cases.

We use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another, simple and elegant, way of counting the number of such objects. Counting geometric graphs is then equivalent to calculating the powers of a production matrix. Applying the technique of Riordan Arrays to these production matrices, we establish new formulas for the numbers of geometric graphs as well as combinatorial identities derived from the production matrices. Further, we obtain the characteristic polynomial and the eigenvectors of such production matrices. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 734922. This research is also supported by PID2019-104129GB-I00/MCIN/AEI/10.13039/501100011033. C. H. and R. I. S. were supported by MINECO MTM2015-63791-R and Gen. Cat. 2017SGR1336 and 2017SGR1640. G. E. is also funded by an FPU of the Universidad de Alcalá.

Beaton, Owczarek and Xu (2019) studied generating functions of Kreweras walks and of reverse Kreweras walks in the quarter plane, with interacting boundaries. They proved that for the reverse Kreweras step set, the generating function is always algebraic, and for the Kreweras step set, the generating function is always D-finite. However, apart from the particular case where the interactions are symmetric in $x$ and~$y$, they left open the question of whether the latter one is algebraic. Using computer algebra tools, we confirm their intuition that the generating function of Kreweras walks is not algebraic, apart from the particular case already identified., Comment: 13 pages, accepted at FPSAC'21

International audience; We analyze a nonlocal partial differential equation (PDE) model describing the dynamics of adaptation of a phenotypically structured population, under the effects of mutation and selection, in a changing environment. Previous studies have analyzed the large-time behavior of such models, with particular forms of environmental changes---either linearly changing or periodically fluctuating. We use here a completely different mathematical approach, which allows us to consider very general forms of environmental variations and to give an analytic description of the full trajectories of adaptation, including the transient phase, before a stationary behavior is reached. The main idea behind our approach is to study a bivariate distribution of two “fitness components" that contains enough information to describe the distribution of fitness at any time. This distribution solves a degenerate parabolic equation that is dealt with by defining a multidimensional cumulant generating function associated with the distribution and solving the associated transport equation. We apply our results to several examples and check their accuracy using stochastic individual-based simulations as a benchmark. These examples illustrate the importance of being able to describe the transient dynamics of adaptation to understand the development of drug resistance in pathogens.

The frequent emergence of diseases with the potential to become threats at local and global scales, such as influenza A(H1N1), SARS, MERS, and recently COVID-19 disease, makes it crucial to keep designing models of disease propagation and strategies to prevent or mitigate their effects in populations. Since isolated systems are exceptionally rare to find in any context, especially in human contact networks, here we examine the susceptible-infected-recovered model of disease spreading in a multiplex network formed by two distinct networks or layers, interconnected through a fraction $q$ of shared individuals (overlap). We model the interactions through weighted networks, because person-to-person interactions are diverse (or disordered); weights represent the contact times of the interactions. Using branching theory supported by simulations, we analyze a social distancing strategy that reduces the average contact time in both layers, where the intensity of the distancing is related to the topology of the layers. We find that the critical values of the distancing intensities, above which an epidemic can be prevented, increase with the overlap $q$. Also we study the effect of the social distancing on the mutual giant component of susceptible individuals, which is crucial to keep the functionality of the system. In addition, we find that for relatively small values of the overlap $q$, social distancing policies might not be needed at all to maintain the functionality of the system., Comment: 24 pages, 9 figures

In this paper, the Fourier series expansion of Tangent polynomials of higher order is derived using the Cauchy residue theorem. Moreover, some variations of higher-order Tangent polynomials are defined by mixing the concept of Tangent polynomials with that of Bernoulli and Genocchi polynomials, Tangent–Bernoulli and Tangent–Genocchi polynomials. Furthermore, Fourier series expansions of these variations are also derived using the Cauchy residue theorem.

In this paper, we apply a general family of basic (or q-) polynomials with double q-binomial coefficients as well as some homogeneous q-operators in order to construct several q-difference equations involving seven variables. We derive the Rogers type and the extended Rogers type formulas as well as the Srivastava-Agarwal-type bilinear generating functions for the general q-polynomials, which generalize the generating functions for the Cigler polynomials. We also derive a class of mixed generating functions by means of the aforementioned q-difference equations. The various results, which we have derived in this paper, are new and sufficiently general in character. Moreover, the generating functions presented here are potentially applicable not only in the study of the general q-polynomials, which they have generated, but indeed also in finding solutions of the associated q-difference equations. Finally, we remark that it will be a rather trivial and inconsequential exercise to produce the so-called (p,q)-variations of the q-results, which we have investigated here, because the additional forced-in parameter p is obviously redundant.

Patterns within strings enable us to extract vital information regarding a string&rsquo, s randomness. Understanding whether a string is random (Showing no to little repetition in patterns) or periodic (showing repetitions in patterns) are described by a value that is called the kth Subword Complexity of the character string. By definition, the kth Subword Complexity is the number of distinct substrings of length k that appear in a given string. In this paper, we evaluate the expected value and the second factorial moment (followed by a corollary on the second moment) of the kth Subword Complexity for the binary strings over memory-less sources. We first take a combinatorial approach to derive a probability generating function for the number of occurrences of patterns in strings of finite length. This enables us to have an exact expression for the two moments in terms of patterns&rsquo, auto-correlation and correlation polynomials. We then investigate the asymptotic behavior for values of k = &Theta, ( log n ) . In the proof, we compare the distribution of the kth Subword Complexity of binary strings to the distribution of distinct prefixes of independent strings stored in a trie. The methodology that we use involves complex analysis, analytical poissonization and depoissonization, the Mellin transform, and saddle point analysis..

In this paper, we consider the degenerate type 2 Changhee numbers and polynomials and derive some new identities involving degenerate type 2 Changhee polynomials, the type 2 Changhee polynomials, the type 2 Euler polynomials, generalized Bell numbers, the Changhee-central numbers of the second kind and Euler polynomials by using the generating function method and the Riordan matrix method.

Compact coalescent histories are combinatorial structures that describe for a given gene tree G and species tree S possibilities for the numbers of coalescences of G that take place on the various branches of S. They have been introduced as a data structure for evaluating probabilities of gene tree topologies conditioning on species trees, reducing computation time compared to standard coalescent histories. When gene trees and species trees have a matching labeled topology $$G=S=t$$ , the compact coalescent histories of t are encoded by particular integer labelings of the branches of t, each integer specifying the number of coalescent events of G present in a branch of S. For matching gene trees and species trees, we investigate enumerative properties of compact coalescent histories. We report a recursion for the number of compact coalescent histories for matching gene trees and species trees, using it to study the numbers of compact coalescent histories for small trees. We show that the number of compact coalescent histories equals the number of coalescent histories if and only if the labeled topology is a caterpillar or a bicaterpillar. The number of compact coalescent histories is seen to increase with tree imbalance: we prove that as the number of taxa n increases, the exponential growth of the number of compact coalescent histories follows $$4^n$$ in the case of caterpillar or bicaterpillar labeled topologies and approximately $$3.3302^n$$ and $$2.8565^n$$ for lodgepole and balanced topologies, respectively. We prove that the mean number of compact coalescent histories of a labeled topology of size n selected uniformly at random grows with $$3.3750^n$$ . Our results contribute to the analysis of the computational complexity of algorithms for computing gene tree probabilities, and to the combinatorial study of gene trees and species trees more generally.

As a three-dimensional generalization of fountains of coins, we analyze stacks of spheres and enumerate two particular classes, so-called “pyramidal” stacks and “Dominican” stacks. Using the machinery of generating functions, we obtain exact formulas for these types of stacks in terms of the sizes of their bases.

International Conference on Approximation and Computation - Theory and Applications (ACTA) -- NOV 30-DEC 02, 2017 -- Belgrade, SERBIA KUCUKOGLU, IREM/0000-0001-9100-2252 WOS: 000463447500004 The first aim of this paper is to give identities and relations for a new family of the combinatorial numbers and the Apostol-Euler type numbers of the second kind, the Stirling numbers, the Apostol-Bernoulli type numbers, the Bell numbers and the numbers of the Lyndon words by using some techniques including generating functions, functional equations and inversion formulas. The second aim is to derive some derivative formulas and combinatorial sums by applying derivative operators including the Caputo fractional derivative operators. Moreover, we give a recurrence relation for the Apostol-Euler type numbers of the second kind. By using this recurrence relation, we construct a computation algorithm for these numbers. In addition, we derive some novel formulas including the Stirling numbers and other special numbers. Finally, we also some remarks, comments and observations related to our results. Serbian Acad Sci & Arts, Math Inst, Univ Belgrade, Fac Mech Engn, Univ Belgrade, Fac Math, Univ Belgrade, Sch Elect Engn, Univ Nis, Univ Kragujevac, Fac Sci, Univ Novi Sad, Fac Sci Scientific Research Project Administration of Akdeniz UniversityAkdeniz University [FBA-2018-3292] The present paper was supported by Scientific Research Project Administration of Akdeniz University (with Project Number: FBA-2018-3292).

The Fourier series expansion of Apostol–tangent polynomials is derived using the Cauchy residue theorem and a complex integral over a contour. This Fourier series and the Hurwitz–Lerch zeta function are utilized to obtain the explicit formula at rational arguments of these polynomials. Using the Lipschitz summation formula, an integral representation of Apostol–tangent polynomials is also obtained.

We work with lattice walks in $\mathbb{Z}^{r+1}$ using step set $\{\pm 1\}^{r+1}$ that finish with $x_{r+1} = 0$. We further impose conditions of avoiding backtracking (i.e. $[v,-v]$) and avoiding consecutive steps (i.e. $[v,v]$) each possibly combined with restricting to the half-space $x_{r+1} \geq 0$. We find in all cases the generating functions for such walks are algebraic and give explicit formulas for them. We also find polynomial recurrences for their coefficients. From the generating functions we find the asymptotic enumeration of each family of walks considered. The enumeration in special cases includes central binomial coefficients and Catalan numbers as well as relations to enumeration of another family of walks previously studied for which we provide bijection.

The main purpose of this paper is to give many new formulas involving the Fibonacci numbers, the golden ratio, the Lucas numbers, and other special numbers. By using generating functions for the special numbers with their functional equations method, we also give many new relations among the Fibonacci numbers, the Lucas numbers, the golden ratio, the Stirling numbers, and other special numbers. Moreover, some applications of the Fibonacci numbers and the golden ratio in chemistry are given.

Let $H$ be a fixed graph and $\mathcal{G}$ a subcritical graph class. In this paper we show that the number of occurrences of $H$ (as a subgraph) in a uniformly at random graph of size $n$ in $\mathcal{G}$ follows a normal limiting distribution with linear expectation and variance. The main ingredient in our proof is the analytic framework developed by Drmota, Gittenberger and Morgenbesser to deal with infinite systems of functional equations. As a case study, we get explicit expressions for the number of triangles and cycles of length four for the family of series-parallel graphs., Comment: 32 pages, 6 figures

Various families of generating functions have been established by a number of authors in many different ways. In this paper, we aim at establishing (presumably new) a generating function for the extended second Appell hypergeometric function $F_{2} (a, b, b'; c, c'; x, y; p)$. Further we derive a relation in terms of the Laguerre polynomials and differentiation formulas. We also present special cases of the main results of this paper.

This paper contains a brief review of orthogonal polynomials in two and several variables. It supplements the Koornwinder survey [40]. Several recently discovered systems of orthogonal polynomials have been treated in this work. We did not provide any proofs of the theorem presented here but references to the original sources are given for the benefit of the interested reader. It is hoped that collecting these scattered results in one place will make them accessible for the user.

Equations of motion in Newtonian and Hamiltonian forms are used for classical molecular dynamics simulation of particle system time evolution. When Newton equations of motion are used for finding of particle coordinates and velocities in $N$-particle system it takes to solve $3N$ ordinary differential equations of second order at every time step. Traditionally numerical schemes of Verlet method are used for solving Newtonian equations of motion of molecular dynamics. A step of integration is necessary to decrease for Verlet numerical schemes steadiness conservation on sufficiently large time intervals. It leads to a significant increase of the volume of calculations. Numerical schemes of Verlet method with Hamiltonian conservation control (the energy of the system) at every time moment are used in the most software packages of molecular dynamics for numerical integration of equations of motion. It can be used two complement each other approaches to decrease of computational time in molecular dynamics calculations. The first of these approaches is based on enhancement and software optimization of existing software packages of molecular dynamics by using of vectorization, parallelization and special processor construction. The second one is based on the elaboration of efficient methods for numerical integration for equations of motion. A procedure for constructing of explicit, implicit and symmetric symplectic numerical schemes with given approximation accuracy in relation to integration step for solving of molecular dynamic equations of motion in Hamiltonian form is proposed in this work. The approach for construction of proposed in this work procedure is based on the following points: Hamiltonian formulation of equations of motion; usage of Taylor expansion of exact solution; usage of generating functions, for geometrical properties of exact solution conservation, in derivation of numerical schemes. Numerical experiments show that obtained in this work symmetric symplectic third-order accuracy scheme conserves basic properties of the exact solution in the approximate solution. It is more stable for approximation step and conserves Hamiltonian of the system with more accuracy at a large integration interval then second order Verlet numerical schemes.

The notion that the brain has a resting state mode of functioning has received increasing attention in recent years. The idea derives from experimental observations that showed a relatively spatially and temporally uniform high level of neuronal activity when no explicit task was being performed. Surprisingly, the total energy consumption supporting neuronal firing in this conscious awake baseline state is orders of magnitude larger than the energy changes during stimulation. This paper presents a novel and counterintuitive explanation of the high energy consumption of the brain at rest obtained using the recently developed intelligence and embodiment hypothesis. This hypothesis is based on evolutionary neuroscience and postulates the existence of a common information-processing principle associated with nervous systems that evolved naturally and serves as the foundation from which intelligence can emerge and to the efficiency of brain’s computations. The high energy consumption of the brain at rest is shown to be the result of the energetics associated to the most probable state of a statistical physics model aimed at capturing the behavior of a system constrained by power consumption and evolutionary designed to minimize metabolic demands.

A Markovian network of two queues, with finite size batch Poissonarrivals and departures, is solved approximately, but to arbitraryaccuracy, for its equilibrium state probabilities. Below a pair ofthresholds on the queue lengths, a modification of the SpectralExpansion Method is used to construct a semi-product-form at alllengths of one queue in a finite lattice strip defined by the thresh-old of the other queue. No additional special arrival streams arerequired, for example at empty queues, from which it is alreadyknown that a product-form can be constructed. Hence the firstexact closed form solution for the equilibrium probabilities in anunmodified Markovian queueing network with batches is obtained,the only constraint being finiteness of the batches. The methodis illustrated numerically, first in a tandem network and then in atwo-node network with feedback. Simulation results confirm theprecision of the method, lying almost on top of the those of themodel in plots. Partial batch forwarding and discarding are therebycompared quantitatively.

In Statistical theory, inclusion of an additional parameter to standard distributions is a usual practice. In this study, a new distribution referred to as Alpha-Power Pareto distribution is introduced by including an extra parameter. Several properties of the proposed distribution, including moment generating function, mode, quantiles, entropies, mean residual life function, stochastic orders and order statistics are obtained. Parameters of the proposed distribution have been estimated using maximum likelihood estimation technique. Two real datasets have been considered to examine the usefulness of the proposed distribution. It has been observed that the proposed distribution outperforms different variants of Pareto distribution on the basis of model selection criteria.

A direct saddle-point analysis (without relying on any modular forms, identities or functional equations) is developed to establish the asymptotics of Fishburn matrices and a large number of other variants with a similar sum of-finite-product form for their (formal) general functions. In addition to solving some conjectures, the application of our saddle-point approach to the distributional aspects of statistics on Fishburn matrices is also examined with many new limit theorems characterized, representing the first of their kind for such structures., Comment: 44 pages, 20 figures

Coalescent histories provide lists of species tree branches on which gene tree coalescences can take place, and their enumerative properties assist in understanding the computational complexity of calculations central in the study of gene trees and species trees. Here, we solve an enumerative problem left open by Rosenberg ( IEEE/ACM Transactions on Computational Biology and Bioinformatics 10: 1253-1262, 2013) concerning the number of coalescent histories for gene trees and species trees with a matching labeled topology that belongs to a generic caterpillar-like family. By bringing a generating function approach to the study of coalescent histories, we prove that for any caterpillar-like family with seed tree $t$ , the sequence $(h_n)_{n\ge 0}$ describing the number of matching coalescent histories of the $n$ th tree of the family grows asymptotically as a constant multiple of the Catalan numbers. Thus, $h_n \sim \beta _t c_n$ , where the asymptotic constant $\beta _t > 0$ depends on the shape of the seed tree $t$ . The result extends a claim demonstrated only for seed trees with at most eight taxa to arbitrary seed trees, expanding the set of cases for which detailed enumerative properties of coalescent histories can be determined. We introduce a procedure that computes from $t$ the constant $\beta _t$ as well as the algebraic expression for the generating function of the sequence $(h_n)_{n\ge 0}$ .

We present unified bijections for maps on the torus with control on the face-degrees and essential girth (girth of the periodic planar representation). A first step is to show that for d>=3 every toroidal d-angulation of essential girth d can be endowed with a certain "canonical" orientation (formulated as a weight-assignment on the half-edges). Using an adaptation of a construction by Bernardi and Chapuy, we can then derive a bijection between face-rooted toroidal d-angulations of essential girth d (with the condition that, apart from the root-face contour, no other closed walk of length d encloses the root-face) and a family of decorated unicellular maps. The orientations and bijections can then be generalized, for any d>=1, to toroidal face-rooted maps of essential girth d with a root-face of degree d (and with the same root-face contour condition as for d-angulations), and they take a simpler form in the bipartite case, as a parity specialization. On the enumerative side we obtain explicit algebraic expressions for the generating functions of rooted essentially simple triangulations and bipartite quadrangulations on the torus. Our bijective constructions can be considered as toroidal counterparts of those obtained by Bernardi and the first author in the planar case, and they also build on ideas introduced by Despr\'e, Gon\c{c}alves and the second author for essentially simple triangulations, of imposing a balancedness condition on the orientations in genus 1., Comment: 69 pages