Related papers: Method of Asymptotics beyond All Orders and Restri…
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.…
For a given a normally hyperbolic invariant manifold, whose stable and unstable manifolds intersect transversally, we consider several tools and techniques to detect trajectories with prescribed itineraries: the scattering map, the…
We consider random rooted maps without regard to their genus, with fixed large number of edges, and address the problem of limiting distributions for six different parameters: vertices, leaves, loops, root edges, root isthmus, and root…
We are concerned with mapping class groups of surfaces with nonempty boundary. We present a very natural method, due to Thurston, of finding many different left orderings of such groups. The construction involves equipping the surface with…
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions the search into different subproblems of the DisCSP. The…
A graph is beyond-planar if it can be drawn in the plane with a specific restriction on crossings. Several types of beyond-planar graphs have been investigated, such as k-planar if every edge is crossed at most k times and RAC if edges can…
Robots operating in changing environments either predict obstacle changes and/or plan quickly enough to react to them. Predictive approaches require a strong prior about the position and motion of obstacles. Reactive approaches require no…
Recent studies have shown that chaotic maps are well-suited for applications requiring unpredictable behaviour, making them a valuable tool for enhancing unpredictability and complexity. A method is developed using 3D parametric equations…
Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according…
We develop symbolic methods of asymptotic approximations for solutions of linear ordinary differential equations and use to them stabilize numerical calculations. Our method follows classical analysis for first-order systems and…
Algebraic Branching Programs(ABPs) are standard models for computing polynomials. Syntactic multilinear ABPs (smABPs) are restrictions of ABPs where every variable is allowed to occur at most once in every path from the start to the…
We propose a novel holistic approach for safe autonomous exploration and map building based on constrained Bayesian optimisation. This method finds optimal continuous paths instead of discrete sensing locations that inherently satisfy…
Asymptotic statistical theory for estimating functions is reviewed in a generality suitable for stochastic processes. Conditions concerning existence of a consistent estimator, uniqueness, rate of convergence, and the asymptotic…
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…
This overview is devoted to splitting methods, a class of numerical integrators intended for differential equations that can be subdivided into different problems easier to solve than the original system. Closely connected with this class…
The present paper is devoted to the study of space mappings, which are more general than quasiregular mappings. The questions of the behavior of differentiable mappings having the so--called $N,$ $N^{-1},$ $ACP$ and $ACP^{-1}$ -- properties…
A ``hybrid method'', dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singularity analysis theory. This hybrid method applies to functions that remain of…
The (unweighted) point-separation problem asks, given a pair of points $s$ and $t$ in the plane, and a set of candidate geometric objects, for the minimum-size subset of objects whose union blocks all paths from $s$ to $t$. Recent work has…
We consider the Helmholtz equation in an angular sector partially covered by a homogeneous layer of small thickness, denoted $\varepsilon$. We propose in this work an asymptotic expansion of the solution with respect to $\varepsilon$ at any…
Let $\mathbb{N}$ denote the set of all nonnegative integers and $A$ be a subset of $\mathbb{N}$. Let $h\geq2$ and let $r_h(A,n)=\sharp \{ (a_1,\ldots,a_h)\in A^{h}: a_1+\cdots+a_h=n\}.$ The set $A$ is called an asymptotic basis of order $h$…