Related papers: Taking the logarithm of binomial type sequences: l…
In this paper, we study the growth of transcendental entire solutions of linear difference equations \begin{equation} P_m(z)\Delta^mf(z)+\cdots+P_1(z)\Delta f(z)+P_0(z)f(z)=0,\tag{+} \end{equation} where $P_j(z)$ are polynomials for…
We look at the asymptotic behavior of the coefficients of the $q$-binomial coefficients (or Gaussian polynomials) $\binom{a+k}{k}_q$, when $k$ is fixed. We give a number of results in this direction, some of which involve Eulerian…
Large-margin classifiers are popular methods for classification. We derive the asymptotic expression for the generalization error of a family of large-margin classifiers in the limit of both sample size $n$ and dimension $p$ going to…
We establish a law of the iterated logarithm (LIL) for the set of real numbers whose $n$-th partial quotient is bigger than $\alpha_n$, where $(\alpha_n)$ is a sequence such that $\sum 1/\alpha_n$ is finite. This set is shown to have…
Over the last several decades, improvements in the fields of analytic combinatorics and computer algebra have made determining the asymptotic behaviour of sequences satisfying linear recurrence relations with polynomial coefficients largely…
We consider the number of linear extensions of an N-free order P. We give upper and lower bounds on this number in terms of parameters of the corresponding arc diagram. We propose a dynamic programming algorithm to calculate the number. The…
The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…
It is shown by the author in [J. Lie Theory 29:4, 1045-1070, 2019] that for every connected linear complex Lie group the algebra of polynomials (regular functions) is dense in the algebra of holomorphic functions of exponential type.…
We combine dependent types with linear type systems that soundly and completely capture polynomial time computation. We explore two systems for capturing polynomial time: one system that disallows construction of iterable data, and one,…
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…
In this paper, we propose some algorithms for analytical solution construction to nonlinear polynomial partial differential equations with constant function coefficients. These schemes are based on one-(single), two- (double) or three-…
This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…
Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…
In this paper we establish new integral representations for the remainder term of the known asymptotic expansion of the logarithm of the Barnes $G$-function. Using these representations, we obtain explicit and numerically computable error…
In this paper, we study the asymptotics of the Hahn polynomials Q_n(x; {\alpha}, {\beta}, N) as the degree n grows to infinity, when the parameters {\alpha} and {\beta} are fixed and the ratio of n/N = c is a constant in the interval (0,…
Asymptotic expansions are derived for solutions of the parabolic cylinder and Weber differential equations. In addition the inhomogeneous versions of the equations are considered, for the case of polynomial forcing terms. The expansions…
A new general Lie-algebraic approach is proposed to solving evolution tasks in some nonlinear problems of quantum physics with polynomially deformed Lie algebras $su_{pd}(2)$ as their dynamic symmetry algebras. The method makes use of an…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
This paper considers the problem of iterative Bayesian smoothing in nonlinear state-space models with additive noise using Gaussian approximations. Iterative methods are known to improve smoothed estimates but are not guaranteed to…
We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…