Related papers: Approximate expressions for mathematical constants…
This paper introduces an efficient algorithm for computing the best approximation of a given matrix onto the intersection of linear equalities, inequalities and the doubly nonnegative cone (the cone of all positive semidefinite matrices…
In a recent work on Euler-type formulae for even Dirichlet beta values, i.e. $\beta{(2n)}$, I have derived an exact closed-form expression for a class of zeta series. From this result, I have conjectured closed-form summations for two…
The author gives the full list of his conjectures on series for powers of $\pi$ and other important constants scattered in some of his public papers or his private diaries. The list contains 234 reasonable conjectural series. On the list…
We investigate subspace codes whose codewords are subspaces of ${\rm PG}(4,q)$ having non-constant dimension. In particular, examples of optimal mixed-dimension subspace codes are provided, showing that ${\cal A}_q(5,3) = 2(q^3+1)$.
New expressions and bounds for Catalan's and Apery's constants, derived from the half hyperbolic secant distribution, are presented. These constants are obtained by using expressions for the Lorenz curve, the Gini and Theil indices,…
In this paper, we consider the entire solutions of nonlinear difference equation $$f^3+q(z)\Delta f=p_1 e^{\alpha_1 z}+ p_2 e^{\alpha_2 z} $$ where $q$ is a polynomial, and $p_1, p_2, \alpha_1, \alpha_2$ are nonzero constants with…
We consider nested sums involving the Pochhammer symbol at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi,$ $\log(2)$ or zeta values. In order to perform these simplifications, we view the series as…
We study the best approximation problem: \[ \displaystyle \min_{\alpha\in \mathbb R^m}\max_{1\leq i\leq n}\left|y_i -\sum_{j=1}^m \alpha_j \Gamma_j ({\bf x}_i) \right|. \] Here: $\Gamma:=\left\{\Gamma_1,...,\Gamma_m\right\}$ is a list of…
This study deals with certain harmonic zeta functions, one of them occurs in the study of the multiplication property of the harmonic Hurwitz zeta function. The values at the negative even integers are found and Laurent expansions at poles…
We find an asymptotic formula for the number of rational points near planar curves. More precisely, if $f:\mathbb{R}\rightarrow\mathbb{R}$ is a sufficiently smooth function defined on the interval $[\eta,\xi]$, then the number of rational…
Let $p$ be a prime greater than $3$ and let $a$ be a rational p-adic integer. In this paper we try to determine $\sum_{k=1}^{[p/3]}\binom{3k}ka^k\pmod p$, and real the connection between cubic congruences and the sum…
This paper investigates two inexact Levenberg-Marquardt (LM) methods for solving systems of nonlinear equations. Both approaches compute approximate search directions by solving the LM linear system inexactly, subject to specific…
The existence of infinitely many consecutive prime triples $p_n$, $ p_{n+1}$, and $p_{n+2}$ as $n \to \infty$, is sufficient to prove that the Catalan constant $\beta(2)=0.9159655941\ldots $ is an irrational number. This note provides the…
The Boolean product $R = P \cdot Q$ of two $\{ 0, 1\} \; m \times m \; $ matrices is $$R(j,k) = 1 \; \mathrm{\ IF\ for\ some\ } \; t \; \,P(j, t) = Q(t, k) = 1\; \; \mathrm{ELSE\ } \, R(j, k) = 0. $$ The near-optimal design reduces the…
We use a recently developed method to determine approximate expression for tritronqu\'{e}e solution for P-1: $y^{\prime \prime} + 6 y^2 - x=0$ in a domain $D$ with rigorous bounds. In particular we rigorously confirm the location of the…
Principal component analysis (PCA) requires the computation of a low-rank approximation to a matrix containing the data being analyzed. In many applications of PCA, the best possible accuracy of any rank-deficient approximation is at most a…
This thesis investigates the extent to which the optimal value of a constraint satisfaction problem (CSP) can be approximated by some sentence of fixed point logic with counting (FPC). It is known that, assuming $\mathsf{P} \neq…
We present an algorithm for searching regular expression matches in compressed text. The algorithm reports the number of matching lines in the uncompressed text in time linear in the size of its compressed version. We define efficient data…
We introduce a lazy approach to the explanation-based approximation of probabilistic logic programs. It uses only the most significant part of the program when searching for explanations. The result is a fast and anytime approximate…
We introduce a deficiency-based representation and approximation framework for values of the Riemann zeta function. The method is based on comparing two nonlinear accumulation mechanisms: global transformation of a base partial sum and…