Related papers: Combined fixed-order and effective-theory approach…
We calculate the triple correlations for the truncated divisor sum $\lambda_{R}(n)$. The $\lambda_{R}(n)$'s behave over certain averages just as the prime counting von Mangoldt function $\Lambda(n)$ does or is conjectured to do. We also…
A perturbative approach is used to derive approximations of arbitrary order to estimate high percentiles of sums of positive independent random variables that exhibit heavy tails. Closed-form expressions for the successive approximations…
We obtain the solution of the fourth order difference equation $$ x_{n+1}=\frac{ \alpha x_{n-3}}{A+B x_{n-1}x_{n-3}}$$ with the initial conditions; $x_{-3}=d,$ $x_{-2}=c,$ $x_{-1}=b,$ and $x_{0}=a$ are arbitrary nonzero real numbers,…
This is the 4-th paper in the series devoted to a systematic study of the problem of mathematically correct formulation of the rules needed to manage an effective field theory. Here we consider the problem of constructing the full set of…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
The Birkhoff Ergodic Theorem establishes pointwise convergence for integrable observables, but for $f\notin L^1$, no normalization yields almost sure convergence. This paper investigates trimmed ergodic sums, where the largest observations…
We develop an efficient algorithm for evaluating divergent perturbation expansions of field theories in the bare coupling constant g_B for which we possess a finite number L of expansion coefficients plus two more informations: The…
Trees are useful entities allowing to model data structures and hierarchical relationships in networked decision systems ubiquitously. An ordered tree is a rooted tree where the order of the subtrees (children) of a node is significant. In…
An overview of results and problems concerning the asymptotic behaviour for summatory functions of a certain class of additive functions is given. The class of functions in question involves Karamata's regular variation. Some new Abelian…
In this paper we study the convergence in distribution and the local limit theorem for the partial sums of linear random fields with i.i.d. innovations that have infinite second moment and belong to the domain of attraction of a stable law…
The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…
A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…
We give concentration bounds for martingales that are uniform over finite times and extend classical Hoeffding and Bernstein inequalities. We also demonstrate our concentration bounds to be optimal with a matching anti-concentration…
We provide a version of the celebrated theorem of Koml\'os in which, rather then random quantities, a sequence of finitely additive measures is considered. We obtain a form of the subsequence principle and some applications.
Subset Sum is a classical optimization problem taught to undergraduates as an example of an NP-hard problem, which is amenable to dynamic programming, yielding polynomial running time if the input numbers are relatively small. Formally,…
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…
In the Bin Packing problem one is given $n$ items with weights $w_1,\ldots,w_n$ and $m$ bins with capacities $c_1,\ldots,c_m$. The goal is to find a partition of the items into sets $S_1,\ldots,S_m$ such that $w(S_j) \leq c_j$ for every bin…
We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…
We provide novel theoretical results regarding local optima of regularized $M$-estimators, allowing for nonconvexity in both loss and penalty functions. Under restricted strong convexity on the loss and suitable regularity conditions on the…