English
Related papers

Related papers: A numerical study of L-convex polyominoes and 201-…

200 papers

Based on the work of Chen and Its [{\em J. Approx. Theory} {\bf 162} ({2010}) {270--297}], we further study orthogonal polynomials with respect to the singularly perturbed Laguerre weight $w(x;t,\alpha) = {x^\alpha}{\mathrm e^{-…

Classical Analysis and ODEs · Mathematics 2025-11-27 Chao Min , Xiaoqing Wu

In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…

Mathematical Physics · Physics 2015-06-04 H. Bergeron , E. M. F. Curado , J. P. Gazeau , Ligia M. C. S. Rodrigues

This doctoral thesis undertakes an in-depth exploration of limiting shape theorems across diverse mathematical structures, with a specific focus on subadditive processes within finitely generated groups exhibiting polynomial growth rates,…

Probability · Mathematics 2024-08-22 Lucas R. de Lima

This paper is a continuation of our analysis, begun in arXiv:1310.2276, of the rational solutions of the inhomogeneous Painleve-II equation and associated rational solutions of the homogeneous coupled Painleve-II system in the limit of…

Classical Analysis and ODEs · Mathematics 2015-06-19 Robert J. Buckingham , Peter D. Miller

We use combinatorial and generating function techniques to enumerate various sets of involutions which avoid 231 or contain 231 exactly once. Interestingly, many of these enumerations can be given in terms of $k$-generalized Fibonacci…

Combinatorics · Mathematics 2007-05-23 Eric S. Egge , Toufik Mansour

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…

Combinatorics · Mathematics 2015-05-13 W. R. G. James , I. Jensen , A. J. Guttmann

Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…

Combinatorics · Mathematics 2025-08-27 Mikhail Isaev , Brendan D. McKay

Many limits are known for hypergeometric orthogonal polynomials that occur in the Askey scheme. We show how asymptotic representations can be derived by using the generating functions of the polynomials. For example, we discuss the…

Classical Analysis and ODEs · Mathematics 2015-06-26 Nico M. Temme , Jose L. Lopez

We consider asymptotics of power series coefficients of rational functions of the form $1/Q$ where $Q$ is a symmetric multilinear polynomial. We review a number of such cases from the literature, chiefly concerned either with positivity of…

Combinatorics · Mathematics 2018-05-01 Yuliy Baryshnikov , Stephen Melczer , Robin Pemantle , Armin Straub

The algebraic properties of formal power series, whose coefficients show factorial growth and admit a certain well-behaved asymptotic expansion, are discussed. It is shown that these series form a subring of $\mathbb{R}[[x]]$. This subring…

Combinatorics · Mathematics 2020-08-07 Michael Borinsky

In this paper, we study the asymptotic behavior for multi-scale stochastic differential equations driven by L\'evy processes. The optimal strong convergence order 1/2 is obtained by studying the regularity estimates for the solution of…

Probability · Mathematics 2023-09-26 Yinghui Shi , Xiaobin Sun , Liqiong Wang , Yingchao Xie

Motivated by the problem of finding resistances among vertices in a hypercube, we derive exact expressions, generating functions, and asymptotic expansions for these resistances, then study the combinatorial interpretations of the…

Combinatorics · Mathematics 2009-04-14 Nicholas Pippenger

In 1993 Delest and F\'edou showed that a generating function for connected skew shapes is given as a ratio $J_{\nu+1}/J_{\nu}$ of the Hahn--Exton $q$-Bessel functions when a parameter $\nu$ is zero. They conjectured that when $\nu$ is a…

Combinatorics · Mathematics 2021-05-25 Jang Soo Kim , Dennis Stanton

We continue the investigations of lattice walks in the three dimensional lattice restricted to the positive octant. We separate models which clearly have a D-finite generating function from models for which there is no reason to expect that…

Combinatorics · Mathematics 2015-11-19 Axel Bacher , Manuel Kauers , Rika Yatchak

Let S be a subset of {-1,0,1}^2 not containing (0,0). We address the enumeration of plane lattice walks with steps in S, that start from (0,0) and always remain in the first quadrant. A priori, there are 2^8 problems of this type, but some…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou , Marni Mishna

We recover Gessel's determinantal formula for the generating function of permutations with no ascending subsequence of length m+1. The starting point of our proof is the recursive construction of these permutations by insertion of the…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou

Assuming that a plane partition of the positive integer $n$ is chosen uniformly at random from the set of all such partitions, we propose a general asymptotic scheme for the computation of expectations of various plane partition statistics…

Combinatorics · Mathematics 2017-07-18 Ljuben Mutafchiev

We prove an asymptotic formula for the recurrence coefficients of orthogonal polynomials with orthogonality measure $\log \bigl(\frac{2}{1-x}\bigr) {\rm d}x$ on $(-1,1)$. The asymptotic formula confirms a special case of a conjecture by…

Classical Analysis and ODEs · Mathematics 2024-01-11 Percy Deift , Mateusz Piorkowski

Asymptotic expansions are derived for associated Legendre functions of degree $\nu$ and order $\mu$, where one or the other of the parameters is large. The expansions are uniformly valid for unbounded real and complex values of the argument…

Classical Analysis and ODEs · Mathematics 2025-07-04 T. M. Dunster

We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…

Combinatorics · Mathematics 2018-10-12 Elie de Panafieu