Related papers: Method of Asymptotics beyond All Orders and Restri…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
We present a new method to count unrooted maps on the sphere up to orientation-preserving homeomorphisms. The principle, called tree-decomposition, is to deform a map into an arborescent structure whose nodes are occupied by constrained…
The perturbation technique within the framework of the asymptotic iteration method is used to obtain large-order shifted 1/N expansions, where N is the number of spatial dimensions. This method is contrary to the usual…
A generalization of the reduction technique for ODEs recently introduced by Gao and Liu is given. It is shown that the use of algebraic methods allows the extension of the procedure to much more general flows, as well as the derivation of…
Symmetry breaking is a crucial technique in modern combinatorial solving, but it is difficult to be sure it is implemented correctly. The most successful approach to deal with bugs is to make solvers certifying, so that they output not just…
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…
Establishing bounds on the accuracy achievable by localization techniques represents a fundamental technical issue. Bounds on localization accuracy have been derived for cases in which the position of an agent is estimated on the basis of a…
Here we address dependence among the test statistics in connection with asymptotically Bayes' optimal tests in presence of sparse alternatives. Extending the setup in Bogdan et.al. (2011) we consider an equicorrelated ( with equal…
Bifurcations in a system of coupled maps are investigated. Using symbolic dynamics it is proven that for coupled shift maps the well known space--time--mixing attractor becomes unstable at a critical coupling strength in favour of a…
We consider the asymptotic properties of Approximate Bayesian Computation (ABC) for the realistic case of summary statistics with heterogeneous rates of convergence. We allow some statistics to converge faster than the ABC tolerance, other…
The Method of Alternating Projections (MAP), a classical algorithm for solving feasibility prob- lems, has recently been intensely studied for nonconvex sets. However, intrinsically available are only local convergence results: convergence…
We present a diagrammatic method to build up sophisticated cellular automata (CAs) as models of complex physical systems. The diagrams complement the mathematical approach to CA modeling, whose details are also presented here, and allow CAs…
Orbital solutions for binary or multiple stellar systems that combine astrometry (e.g., position angles and angular separations) with spectroscopy (radial velocities) have important advantages over astrometric-only or spectroscopic-only…
We show that after mapping each element of a set of second class constraints to the surface of the other ones, half of them form a subset of abelian first class constraints. The explicit form of the map is obtained considering the most…
Parametric model order reduction using reduced basis methods can be an effective tool for obtaining quickly solvable reduced order models of parametrized partial differential equation problems. With speedups that can reach several orders of…
In this paper, we introduce a \textit{Bi-level OPTimization} (BiOPT) framework for minimizing the sum of two convex functions, where both can be nonsmooth. The BiOPT framework involves two levels of methodologies. At the upper level of…
We define an odometer in the Baire space. That is the non-compact space of one sided sequences of natural numbers. We go on to prove that it is topologically conjugated to the dyadic odometer restricted to an appropriate non-compact subset…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
In this paper, the operation of totally asymmetric simple exclusion process with one or two shortcuts under open boundary conditions is discussed. Using both mathematical analysis and numerical simulations, we have found that, according to…
In fixed-confidence best arm identification (BAI), the objective is to quickly identify the optimal option while controlling the probability of error below a desired threshold. Despite the plethora of BAI algorithms, existing methods…