Related papers: Umbral-Algebraic Methods and Asymptotic Properties…
A general analytical method is developed for describing crossover phenomena of arbitrary nature. The method is based on the algebraic self-similar renormalization of asymptotic series, with control functions defined by crossover conditions.…
Previous research on exceptional units has primarily focused on the ring of rational integers or abstract finite rings, often restricted to linear or quadratic constraints. In this paper, we extend the concept of polynomial-type exceptional…
In this paper, we develop the Riemann-Hilbert method to study the asymptotics of discrete orthogonal polynomials on infinite nodes with an accumulation point. To illustrate our method, we consider the Tricomi-Carlitz polynomials…
$\bar\partial$-extension of the matrix Riemann-Hilbert method is used to study asymptotics of the polynomials $P_n(z)$ satisfying orthogonality relations \[ \int_{-1}^1 x^lP_n(x)\frac{\rho(x)dx}{\sqrt{1-x^2}}=0, \quad l\in\{0,\ldots,n-1\},…
We present a method to compute the Euler characteristic of an algebraic subset of $\bc^n$. This method relies on clasical tools such as Gr\"obner basis and primary decomposition. The existence of this method allows us to define a new…
We obtain some results on the asymptotic behaviour of Geometric polynomials in both the complex plane minus $[-1,0]$ and the interval $(-1,0)$. We also find the distance of consecutive zeros of these polynomials in the bulk of the interval…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…
Analytic combinatorics studies asymptotic properties of families of combinatorial objects using complex analysis on their generating functions. In their reference book on the subject, Flajolet and Sedgewick describe a general approach that…
Asymptotic almost automorphy is introduced and studied in the context of some algebras of generalized functions. We also give applications to neutral difference differential systems in the framework of such generalized functions.
We examine the asymptotics of the moments of characteristic polynomials of $N\times N$ matrices drawn from the Hermitian ensembles of Random Matrix Theory, in the limit as $N\to\infty$. We focus in particular on the Gaussian Unitary…
Using random variables as motivation, this paper presents an exposition of the formalisms developed by Rota and Taylor for the classical umbral calculus. A variety of examples are presented, culminating in several descriptions of sequences…
We give a new algorithmic method of detection of atypical values for 2-variables real polynomial functions with emphasis on the effectivity.
Symbolic methods of umbral nature play an important and increasing role in the theory of special functions and in related fields like combinatorics. We discuss an application of these methods to the theory of lacunary generating functions…
Asymptotic properties of solutions of difference equation of the form \[ \Delta^m(x_n+u_nx_{n+k})=a_nf(n,x_{\sigma(n)})+b_n \] are studied. We give sufficient conditions under which all solutions, or all solutions with polynomial growth, or…
This paper reports on recent work to compute the asymptotic solution of a n-th order ordinary differential equation. Symbolic methods are used to compute the asymptotics over a large region. Application is made to the computation of the…
Computer algebra algorithms are developed for evaluating the coefficients in Airy-type asymptotic expansions that are obtained from integrals with a large parameter. The coefficients are defined from recursive schemes obtained from…
We propose a formula for finding the horizontal, oblique or curvilinear asymptote of any rational polynomial function of any positive degree, as a sum of matrix determinants formed directly from the coefficients of the terms in the given…
We provide a general result for the algebraic independence of Mahler functions by a new method based on asymptotic analysis. As a consequence of our method, these results hold not only over $\mathbb{C}(z)$, but also over…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…