Related papers: An asymptotic version of Dumnicki's algorithm for …
A class of two-dimensional systems of second-order ordinary differential equations is identified in which a system requires fewer Lie point symmetries than required to solve it. The procedure distinguishes among those which are…
In this paper, we obtain new bounds for the tensor rank of multiplication in any extension of $\F_2$. In particular, it also enables us to obtain the best known asymptotic bound. In this aim, we use the generalized algorithm of type…
The classical Lorenz lowest order system of three nonlinear ordinary differential equations, capable of producing chaotic solutions, has been generalized by various authors in two main directions: (i) for number of equations larger than…
New algorithms for construction of asymptotic expansions for stationary distributions of nonlinearly perturbed semi-Markov processes with finite phase spaces are presented. These algorithms are based on a special technique of sequential…
We consider covariance asymptotics for linear statistics of general stationary random measures in terms of their truncated pair correlation measure. We give exact infinite series-expansion formulas for covariance of smooth statistics of…
The asymptotic iteration method (AIM) is an iterative technique used to find exact and approximate solutions to second-order linear differential equations. In this work, we employed AIM to solve systems of two first-order linear…
We obtain new asymptotical bounds for the symmetric tensor rank of multiplication in any finite extension of any finite field $\F_q$. In this aim, we use the symmetric Chudnovsky-type generalized algorithm applied on a family of Shimura…
The L_2-discrepancy measures the irregularity of the distribution of a finite point set. In this note we prove lower bounds for the L_2 discrepancy of arbitrary N-point sets. Our main focus is on the two-dimensional case. Asymptotic upper…
In a decision-theoretic framework, the minimax lower bound provides the worst-case performance of estimators relative to a given class of statistical models. For parametric and semiparametric models, the H\'{a}jek--Le Cam local asymptotic…
We investigate bivariate interpolation problems in characteristic 2. Given a nonnegative integer $t$, we describe all the sub-linear systems generated by monomials, in which there is no curve passing through a general point with…
The method of asymptotic expansions is used to build an approximation scheme relevant to celestial mechanics in relativistic theories of gravitation. A scalar theory is considered, both as a simple example and for its own sake. This theory…
Let $X$ be a projective surface and let $L$ be an ample line bundle on $X$. The global Seshadri constant $\varepsilon(L)$ of $L$ is defined as the infimum of Seshadri constants $\varepsilon(L,x)$ as $x\in X$ varies. It is an interesting…
We develop a new asymptotic method for the analysis of matrix Riemann-Hilbert problems. Our method is a generalization of the steepest descent method first proposed by Deift and Zhou; however our method systematically handles jump matrices…
We describe methods for proving bounds on infinite-time averages in differential dynamical systems. The methods rely on the construction of nonnegative polynomials with certain properties, similarly to the way nonlinear stability can be…
In their seminal work, Polyak and Juditsky showed that stochastic approximation algorithms for solving smooth equations enjoy a central limit theorem. Moreover, it has since been argued that the asymptotic covariance of the method is best…
We prove a generalized version of Schmidt's subspace theorem for closed subschemes in general position in terms of suitably defined Seshadri constants with respect to a fixed ample divisor. Our proof builds on previous work by Evertse and…
A system of plane curves defined by prescribing n points of multiplicity m in general position is regular if n > (2m)^2. The proof uses computation of limits of linear systems acquiring fixed divisors, an interesting problem in itself.
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition…
We obtain non asymptotic bounds for the Monte Carlo algorithm associated to the Euler discretization of some diffusion processes. The key tool is the Gaussian concentration satisfied by the density of the discretization scheme. This…
In this paper, harkening back to ideas of Hardy and Ramanujan, Mahler and de Bruijn, with the addition of more recent results on the Fibonacci Dirichlet series, we determine the asymptotic number of ways $p_F(n)$ to write an integer as the…