scholarly journals Counting connected graphs with large excess

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Élie De Panafieu
Keyword(s):  
Asymptotic Expansion ◽  
Generating Function ◽  
Large Excess ◽  
Complete Asymptotic Expansion ◽  
Connected Graphs ◽  
Analytic Combinatorics ◽  
International Audience

International audience We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations, we derive the complete asymptotic expansion.

scholarly journals Cyclic sieving phenomenon in non-crossing connected graphs

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Alan Guo
Keyword(s):  
Generating Function ◽  
Connected Graph ◽  
Connected Graphs ◽  
Cyclic Sieving Phenomenon ◽  
International Audience ◽  
Cyclic Sieving

International audience A non-crossing connected graph is a connected graph on vertices arranged in a circle such that its edges do not cross. The count for such graphs can be made naturally into a q-binomial generating function. We prove that this generating function exhibits the cyclic sieving phenomenon, as conjectured by S.-P. Eu. Un graphe connexe dont les sommets sont disposés sur un cercle est sans croisement si ses arêtes ne se croisent pas. Nous démontrons une conjecture de S.-P. Eu affirmant que la fonction génératrice q-binomiale dénombrant de tels graphes exhibe le phénomène du crible cyclique.

scholarly journals Asymptotic expansions of Lambert series and related q-series

2017 ◽  
Vol 13 (08) ◽  
pp. 2097-2113 ◽  
Author(s):  
Shubho Banerjee ◽  
Blake Wilkerson
Keyword(s):  
Asymptotic Expansion ◽  
Asymptotic Expansions ◽  
Theta Functions ◽  
Lambert Series ◽  
Pochhammer Symbol ◽  
Complete Asymptotic Expansion ◽  
Polygamma Functions ◽  
Jacobi Theta Functions ◽  
Relative Errors ◽  
Asymptotic Forms

We study the Lambert series [Formula: see text], for all [Formula: see text]. We obtain the complete asymptotic expansion of [Formula: see text] near [Formula: see text]. Our analysis of the Lambert series yields the asymptotic forms for several related [Formula: see text]-series: the [Formula: see text]-gamma and [Formula: see text]-polygamma functions, the [Formula: see text]-Pochhammer symbol and the Jacobi theta functions. Some typical results include [Formula: see text] and [Formula: see text], with relative errors of order [Formula: see text] and [Formula: see text] respectively.

scholarly journals Congruence successions in compositions

2014 ◽  
Vol Vol. 16 no. 1 (Combinatorics) ◽  
Author(s):  
Toufik Mansour ◽  
Mark Shattuck ◽  
Mark Wilson
Keyword(s):  
General Formula ◽  
Generating Function ◽  
Asymptotic Estimate ◽  
International Audience ◽  
Limiting Case ◽  
Positive Integers

Combinatorics International audience A composition is a sequence of positive integers, called parts, having a fixed sum. By an m-congruence succession, we will mean a pair of adjacent parts x and y within a composition such that x=y(modm). Here, we consider the problem of counting the compositions of size n according to the number of m-congruence successions, extending recent results concerning successions on subsets and permutations. A general formula is obtained, which reduces in the limiting case to the known generating function formula for the number of Carlitz compositions. Special attention is paid to the case m=2, where further enumerative results may be obtained by means of combinatorial arguments. Finally, an asymptotic estimate is provided for the number of compositions of size n having no m-congruence successions.

scholarly journals Data Processing Method of Well Testing

2021 ◽  
Vol 134 (3) ◽  
pp. 35-38
Author(s):  
A. M. Svalov ◽  
Keyword(s):  
Boundary Condition ◽  
Asymptotic Expansion ◽  
Test Data ◽  
Traditional Method ◽  
Processing Method ◽  
Well Testing ◽  
Well Test ◽  
Conductivity Equation ◽  
Complete Asymptotic Expansion ◽  
Data Processing Method

Horner’s traditional method of processing well test data can be improved by a special transformation of the pressure curves, which reduces the time the converted curves reach the asymptotic regimes necessary for processing these data. In this case, to take into account the action of the «skin factor» and the effect of the wellbore, it is necessary to use a more complete asymptotic expansion of the exact solution of the conductivity equation at large values of time. At the same time, this method does not allow to completely eliminate the influence of the wellbore, since the used asymptotic expansion of the solution for small values of time is limited by the existence of a singular point, in the vicinity of which the asymptotic expansion ceases to be valid. To solve this problem, a new method of processing well test data is proposed, which allows completely eliminating the influence of the wellbore. The method is based on the introduction of a modified inflow function to the well, which includes a component of the boundary condition corresponding to the influence of the wellbore.

scholarly journals Counting occurrences for a finite set of words: an inclusion-exclusion approach

2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Frédérique Bassino ◽  
Julien Clément ◽  
J. Fayolle ◽  
P. Nicodème
Keyword(s):  
Generating Function ◽  
Exclusion Principle ◽  
Complete Proof ◽  
Detailed Proof ◽  
Finite Set ◽  
International Audience ◽  
The One ◽  
Maple Package

International audience In this paper, we give the multivariate generating function counting texts according to their length and to the number of occurrences of words from a finite set. The application of the inclusion-exclusion principle to word counting due to Goulden and Jackson (1979, 1983) is used to derive the result. Unlike some other techniques which suppose that the set of words is reduced (<i>i..e.</i>, where no two words are factor of one another), the finite set can be chosen arbitrarily. Noonan and Zeilberger (1999) already provided a MAPLE package treating the non-reduced case, without giving an expression of the generating function or a detailed proof. We give a complete proof validating the use of the inclusion-exclusion principle and compare the complexity of the method proposed here with the one using automata for solving the problem.

scholarly journals Statistics on Lattice Walks and q-Lassalle Numbers

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Lenny Tevlin
Keyword(s):  
Positive Integer ◽  
Generating Function ◽  
Catalan Numbers ◽  
Binomial Coefficients ◽  
Integer Coefficients ◽  
Major Index ◽  
Lattice Walks ◽  
International Audience ◽  
The Difference ◽  
Positive Integers

International audience This paper contains two results. First, I propose a $q$-generalization of a certain sequence of positive integers, related to Catalan numbers, introduced by Zeilberger, see Lassalle (2010). These $q$-integers are palindromic polynomials in $q$ with positive integer coefficients. The positivity depends on the positivity of a certain difference of products of $q$-binomial coefficients.To this end, I introduce a new inversion/major statistics on lattice walks. The difference in $q$-binomial coefficients is then seen as a generating function of weighted walks that remain in the upper half-plan. Cet document contient deux résultats. Tout d’abord, je vous propose un $q$-generalization d’une certaine séquence de nombres entiers positifs, liés à nombres de Catalan, introduites par Zeilberger (Lassalle, 2010). Ces $q$-integers sont des polynômes palindromiques à $q$ à coefficients entiers positifs. La positivité dépend de la positivité d’une certaine différence de produits de $q$-coefficients binomial.Pour ce faire, je vous présente une nouvelle inversion/major index sur les chemins du réseau. La différence de $q$-binomial coefficients est alors considérée comme une fonction de génération de trajets pondérés qui restent dans le demi-plan supérieur.

scholarly journals How to obtain an asymptotic expansion of a sequence from an analytic identity satisfied by its generating function

1994 ◽  
Vol 56 (1) ◽  
pp. 131-143 ◽  
Author(s):  
J. M. Plotkin ◽  
John W. Rosenthal
Keyword(s):  
Asymptotic Expansion ◽  
Generating Function ◽  
Partial Derivative ◽  
Radius Of Convergence

AbstractLet fn be a sequence of nonnegative integers and let f(x): = Σn≥0 fn xn be its generating function. Assume f(x) has the following properties: it has radius of convergence r, 0 < r < 1, with its only singualarity on the circle of convergence at x = r and f(r) = s; y = f(x) satisfies an analytic identity F(x, y) = 0 near (r, s); for some k ≥ 2 F0.j = 0, 0 ≤ j < k, F0.k ≠ 0 where Fi is the value at (r, s) of the ith partial derivative with respect to x and the jth partial derivative with respect to y of F. These assumptions form the basis of what we call the typical and general cases. In both cases we show how to obtain an asymptotic expansion of fn. We apply our technique to produce several terms in the asymptotic expansion of combinatorial sequences for which previously only the first term was known.

Landau constants and their q-analogues

2015 ◽  
Vol 13 (02) ◽  
pp. 217-231 ◽  
Author(s):  
Mourad E. H. Ismail ◽  
Xin Li ◽  
M. Rahman
Keyword(s):  
Asymptotic Expansion ◽  
Large Degree ◽  
Complete Asymptotic Expansion

We derive inequalities and a complete asymptotic expansion for the Landau constants Gn, as n → ∞ using the asymptotic sequence n!/(n + k)!. We also introduce a q-analogue of the Landau constants and calculate their large degree asymptotics. In the process, we also establish q-analogues of identities due to Ramanujan and Bailey.

Sign in / Sign up

Export Citation Format

Share Document