Related papers: Symbolic-Numeric Tools for Analytic Combinatorics …
We provide bivariate asymptotics for the poly-Bernoulli numbers, a combinatorial array that enumerates lonesum matrices, using the methods of Analytic Combinatorics in Several Variables (ACSV). For the diagonal asymptotic (i.e., for the…
We analyze the Krawtchouk polynomials K(n,x,N,p,q) asymptotically. We use singular perturbation methods to analyze them for N large with appropriate scalings of the two variables x and n. In particular, the WKB method and asymptotic…
We obtain large n asymptotics for products of powers of the absolute values of the characteristic polynomials in the Gaussian Unitary Ensemble of n\times n matrices. Our results can also be interpreted as asymptotics of the determinant of a…
This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating and proving properties about the…
In this paper we study the asymptotic of multiplicities of irreducible representations in large tensor products of finite dimensional representations of simple Lie algebras and their statistics with respect to Plancherel and character…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We introduce a new approach for generating combinatorial identities and formulas by the application of Kronecker substitution to polynomial expansions within quotient rings. Our main result enables the derivation of elementary arithmetic…
In this paper, we use the multivariate analytic techniques of Pemantle and Wilson to derive asymptotic formulae for the coefficients of a broad class of multivariate generating functions with algebraic singularities. Flajolet and Odlyzko…
We study the asymptotic properties of monic orthogonal polynomials (OPs) with respect to some Freud weights when the degree of the polynomial tends to infinity, including the asymptotics of the recurrence coefficients, the nontrivial…
We study the asymptotics of recurrence coefficients for monic orthogonal polynomials $\pi_n(z)$ with the quartic exponential weight $\exp[-N(\frac 12 z^2+\frac 14 tz^4)]$, where $t\in {\mathbb C}$ and $N\in{\mathbb N}$, $N\to\infty$. Our…
We construct asymptotic expansions for ordinary differential equations with highly oscillatory forcing terms, focussing on the case of multiple, non-commensurate frequencies. We derive an asymptotic expansion in inverse powers of the…
The Ap\'ery polynomials and in particular their asymptotic behavior play an essential role in the understanding of the irrationality of \zeta(3). In this paper, we present a method to study the asymptotic behavior of the sequence of the…
We investigate the strong asymptotics of Heine-Stieltjes polynomials - polynomial solutions of a second order differential equations with complex polynomial coefficients. The solution is given in terms of critical measures (saddle points of…
Strong asymptotics on the whole complex plane of a sequence of monic Jacobi polynomials $P_n^{(\alpha_n, \beta_n)}$ is studied, assuming that $$ \lim_{n\to\infty} \frac{\alpha_n}{n}=A, \qquad \lim_{n\to\infty} \frac{\beta _n}{n}=B, $$ with…
We propose an abstract stochastic scheme for solving a broad range of monotone operator inclusion problems in Hilbert spaces. This framework allows for the introduction of stochasticity at several levels in monotone operator splitting…
We consider a complex-valued linear mixture model, under discrete weakly stationary processes. We recover latent components of interest, which have undergone a linear mixing. We study asymptotic properties of a classical unmixing estimator,…
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…
Symbolic discovery of governing equations is a long-standing goal in scientific machine learning, yet a fundamental trade-off persists between interpretability and scalable learning. Classical symbolic regression methods yield explicit…
Asymptotic properties of matrices are, in general, difficult to analyze with classical mathematical techniques. In very specific cases, there is a well-known connection between the asymptotic behavior of a matrix's leading eigenvector and…