Related papers: Approximate expressions for mathematical constants…
Finding a zero of a maximal monotone operator is fundamental in convex optimization and monotone operator theory, and \emph{proximal point algorithm} (PPA) is a primary method for solving this problem. PPA converges not only globally under…
We present an explicit polynomial formula for evaluating the principal logarithm of all matrices lying on the line segment $\{I(1-t)+At:t\in [0,1]\}$ joining the identity matrix $I$ (at $t=0$) to any real matrix $A$ (at $t=1$) having no…
We give explicit numerical values with 100 decimal digits for the Mertens constant involved in the asymptotic formula for $\sum\limits_{\substack{p\leq x p\equiv a \bmod{q}}}1/p$ and, as a by-product, for the Meissel-Mertens constant…
The paper proposes an approximate expression for calculating very complex one-dimensional integrals depending on the parameter $a$. These integrals often occur in computational problems theory of magnetic solitons. The resulting analytical…
The Bohnenblust-Hille inequality for $m$-linear forms was proven in 1931 as a generalization of the famous 4/3-Littlewood inequality. The optimal constants (or at least their asymptotic behavior as $m$ grows) is unknown, but significant for…
We introduce a basis of rational polynomial-like functions $P_0,\ldots,P_{n-1}$ for the free module of functions $Z/nZ\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the…
The aim of this paper is to develop analytic techniques to deal with certain monotonicity of combinatorial sequences. (1) A criterion for the monotonicity of the function $\sqrt[x]{f(x)}$ is given, which is a continuous analog for one…
Available proofs of result of the type 'at least one of the odd zeta values $\zeta(5),\zeta(7),\dots,\zeta(s)$ is irrational' make use of the saddle-point method or of linear independence criteria, or both. These two remarkable techniques…
We study the problem of computing approximate market equilibria in Fisher markets with separable piecewise-linear concave (SPLC) utility functions. In this setting, the problem was only known to be PPAD-complete for inverse-polynomial…
We determine the classical approximation constants $w_{3}(\zeta),w_{3}^{\ast}(\zeta),\lambda_{3}(\zeta)$ such as the uniform constants $\widehat{w}_{3}(\zeta),\widehat{w}_{3}^{\ast}(\zeta),\widehat{\lambda}_{3}(\zeta)$ associated to real…
The real anisotropic Littlewood's $4 / 3$ inequality is an extension of a famous result obtained in 1930 by J. E. Littlewood. It asserts that, for $a , b \in ( 0 , \infty )$, the following conditions are equivalent: $\bullet$ There is an…
A set of piecewise linear functions, called polylines, $P_1,\ldots,P_L$ each with at most $n$ vertices can be simplified into a polyline $M$ with $k$ vertices, such that the Fr\'echet distances $\epsilon_1,\ldots,\epsilon_L$ to each of…
Currently, the best upper bounds on the number of rational points on an absolutely irreducible, smooth, projective algebraic curve of genus g defined over a finite field F_q come either from Serre's refinement of the Weil bound if the genus…
In this paper, we define the edge zeta function of weighted complex. We also present the formula for the edge zeta function of the standard non-uniform complex…
We apply the Pade technique to find rational approximations to % \[h^{\pm}(q_1,q_2)=\sum_{k=1}^\infty\frac{\q_1^k}{1\pm \q_2^k}, 0<q_1,q_2<1, q_1\in\mathbb{Q}, q_2=1/p_2, p_2\in\mathbb{N}\setminus\{1\}.\] % A separate section is dedicated…
The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows: Let $D=\{x_1,x_2,\ldots x_d\}$ be a set of $d$ words defined on an alphabet…
In the paper "The best m-term approximation and greedy algorithms" (V. N. Temlyakov), an error bound for a near best m-term approximation of a function g in L^p([0,1]^d) is provided, using a basis L^p-equivalent to the Haar system, where p…
We study nonconstant rational solutions of \[ x'=A_3(t)x^{n_3}+A_2(t)x^{n_2}+A_1(t)x^{n_1}, \qquad 1<n_1<n_2<n_3, \] with $A_i\in\Bbbk[t]$, $\Bbbk\in\{\mathbb R,\mathbb C\}$. We prove that every such solution is of the form $x=1/p(t)$, and…
In this article we obtain new irrationality measures for values of functions which belong to a certain class of hypergeometric functions including shifted logarithmic functions, binomial functions and shifted exponential functions. We…
In this case study in ``fully automated enumeration'', we illustrate how to take full advantage of symbolic computation by developing (what we call) `symbolic-dynamical-programming' algorithms for computing many terms of `hard to compute…