Related papers: Finding simultaneous Diophantine approximations wi…

This paper studies the cosine as basis function for the approximation of univariate and continuous functions without memory. This work studies a supervised learning to obtain the approximation coefficients, instead of using the Discrete…

Solutions to a linear Diophantine system, or lattice points in a rational convex polytope, are important concepts in algebraic combinatorics and computational geometry. The enumeration problem is fundamental and has been well studied,…

The article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with…

It is shown that the computational efficiency of the discrete least-squares (DLS) approximation of solutions of stochastic elliptic PDEs is improved by incorporating a reduced-basis method into the DLS framework. The goal is to recover the…

We generalize the monotone local search approach of Fomin, Gaspers, Lokshtanov and Saurabh [J. ACM 2019], by establishing a connection between parameterized approximation and exponential-time approximation algorithms for monotone subset…

This work studies the linear approximation of high-dimensional dynamical systems using low-rank dynamic mode decomposition (DMD). Searching this approximation in a data-driven approach is formalised as attempting to solve a low-rank…

We consider a unique continuation problem where the Dirichlet trace of the solution is known to have finite dimension. We prove Lipschitz stability of the unique continuation problem and design a finite element method that exploits the…

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

For shape optimization problems, governed by elliptic equations with Dirichlet boundary condition and random coefficients, we utilize a penalization technique to get the approximate problem. We consider that uncertainties exists in the…

We consider approximation of diameter of a set $S$ of $n$ points in dimension $m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the…

We prove a version of the Khinchine--Groshev theorem for Diophantine approximation of matrices subject to a congruence condition. The proof relies on an extension of the Dani correspondence to the quotient by a congruence subgroup. This…

We show that affine coordinate subspaces of dimension at least two in Euclidean space are of Khintchine type for divergence. For affine coordinate subspaces of dimension one, we prove a result which depends on the dual Diophantine type of…

Diophantine equations can often be reduced to various types of classical Thue equations. These equations usually have only very small solutions, on the other hand to compute all solutions (i.e. to prove the non-existence of large solutions)…

The metrical theory of the product of consecutive partial quotients is associated with the uniform Diophantine approximation, specifically to the improvements to Dirichlet's theorem. Achieving some variant forms of metrical theory in…

In this paper we present a new approach to prove effective results in Diophantine approximation. We then use it to prove an effective theorem on the simultaneous approximation of two algebraic numbers satisfying an algebraic equation with…

The paper is devoted to the problem of estimating the constant of the best Diophantine approximations. The estimates of lower bound $ C_n $ for $ n = 5 $ and $ n = 6 $ was improved. The first chapter gives an overview of the history of…

In a ground-breaking work \cite{BY}, Beresnevich and Yang recently proved Khintchine's theorem in simultaneous Diophantine approximation for nondegenerate manifolds resolving a long-standing problem in the theory of Diophantine…

This paper presents a novel method for polynomial approximation (Hermite approximation) using the fusion of value and derivative information. Therefore, the least-squares error in both domains is simultaneously minimized. A covariance…

This paper presents a new approach to statistical similarity assessment based on sequence alignment. The algorithm performs mutual matching of two random sequences by successively searching for common elements and by applying sequence…

We give a polynomial-time constant-factor approximation algorithm for maximum independent set for (axis-aligned) rectangles in the plane. Using a polynomial-time algorithm, the best approximation factor previously known is $O(\log\log n)$.…