Related papers: The best two-term underapproximation using numbers…
We propose and analyze a weighted greedy scheme for computing deterministic sample configurations in multidimensional space for performing least-squares polynomial approximations on $L^2$ spaces weighted by a probability density function.…
We obtained order estimations for the best uniform approximations by trigonometric polynomials and approximations by Fourier sums of classes of $2\pi$-periodic continuous functions, which $(\psi,\beta)$-derivatives $f_{\beta}^{\psi}$ belong…
The randomized extended Kaczmarz method, proposed by Zouzias and Freris (SIAM J. Matrix Anal. Appl. 34: 773-793, 2013), is appealing for solving least-squares problems. However, its randomly selecting rows and columns of A with probability…
Given a set of strings, the shortest common superstring problem is to find the shortest possible string that contains all the input strings. The problem is NP-hard, but a lot of work has gone into designing approximation algorithms for…
An interesting open problem in number theory asks whether it is possible to walk to infinity on primes, where each term in the sequence has one more digit than the previous. In this paper, we study its variation where we walk on the…
Horadam introduced a new generalized sequence of numbers, describing its key features and the special sub-sequences that are obtained depending on the choices of initial parameters. This sequence and its sub-sequences are known as the…
We extend some rate of convergence results of greedy quantization sequences already investigated in arXiv:1409.0732 [math.PR]. We show, for a more general class of distributions satisfying a certain control, that the quantization error of…
There are three long-known types of restricted integer compositions whose counts match the Fibonacci sequence:\ one from ancient India and two from 19th century England. We give proofs of these enumeration results using tiling arguments and…
Let $s$ be a finite sequence over a field of length $n$. It is well-known that if $s$ satisfies a linear recurrence of order $d$ with non-zero constant term, then the reverse of $s$ also satisfies a recurrence of order $d$ (with…
Given a set of $t$ words of length $n$ over a $k$-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least $\frac{n}{k}+cn^{1-1/(t-k-2)}$, for some $c>0$ depending on $k$ and $t$. This is…
We study the convergence rate of Sinkhorn's algorithm for solving entropy-regularized optimal transport problems when at least one of the probability measures, $\mu$, admits a density over $\mathbb{R}^d$. For a semi-concave cost function…
Consider two ordered positive real number arrays of equal size. The problem is to find such set of indices of given size that the ratio of the sums of the array elements with those indices is minimized. In this work, in order to mitigate…
Let $\textbf{T}(n,k)$ be the set of strings of length $n$ over the alphabet $\Sigma=\{1,2,\ldots,k\}$. A universal cycle for $\textbf{T}(n,k)$ can be constructed using a greedy algorithm: start with the string $k^n$, and continually append…
For any given $\epsilon>0$ we provide an algorithm for the Densest $k$-Subhypergraph Problem with an approximation ratio of at most $O(n^{\theta_m+2\epsilon})$ for $\theta_m=\frac{1}{2}m-\frac{1}{2}-\frac{1}{2m}$ and run time at most…
Based on the structure of Fibonacci sequence, we give a new proof for the irrationality exponents of the Fibonacci real numbers. Moreover, we obtain all the irrationality exponents of the real numbers corresponding to the differences of…
In the classic sequential testing problem, we are given a system with several components each of which fails with some independent probability. The goal is to identify whether or not some component has failed. When the test costs are…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
Let $ k \geq 2 $ and $ ( L_{n}^{(k)} )_{n \geq 2-k} $ be the $k-$generalized Lucas sequence with initial condition $ L_{2-k}^{(k)} = \cdots = L_{-1}^{(k)}=0 ,$ $ L_{0}^{(k,}=2,$ $ L_{1}^{(k)}=1$ and each term afterwards is the sum of the $…
In this paper we present two families of Fibonacci-Lucas identities, with the Sury's identity being the best known representative of one of the families. While these results can be proved by means of the basic identity relating Fibonacci…
In the Steiner Forest problem, we are given terminal pairs $\{s_i, t_i\}$, and need to find the cheapest subgraph which connects each of the terminal pairs together. In 1991, Agrawal, Klein, and Ravi, and Goemans and Williamson gave…