Related papers: A Generalisation on Erd\H{o}s Distinct Subset Sums…
We propose two new alternative numerical schemes to solve the coupled Einstein-Euler equations in the Generalized Harmonic formulation. The first one is a finite difference (FD) Central Weighted Essentially Non-Oscillatory (CWENO) scheme on…
We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…
We use the Sum of Squares method to develop new efficient algorithms for learning well-separated mixtures of Gaussians and robust mean estimation, both in high dimensions, that substantially improve upon the statistical guarantees achieved…
In this article we study two fundamental problems on exponential sums via randomization of frequencies with stochastic processes. These are the Hardy-Littlewood majorant problem, and $L^{2n}(\mathbb{T}), \ n\in \mathbb{N}$ norms of…
We study the Erd\"os/Falconer distance problem in vector spaces over finite fields. Let ${\Bbb F}_q$ be a finite field with $q$ elements and take $E \subset {\Bbb F}^d_q$, $d \ge 2$. We develop a Fourier analytic machinery, analogous to…
The main purpose of this paper is to study the hybrid mean value problem involving generalized Dedekind sums, generalized Hardy sums and Kloosterman sums, and give some exact computational formulae for them by using the properties of Gauss…
We show that if k-SUM is hard, in the sense that the standard algorithm is essentially optimal, then a variant of the SETH called the Primal Treewidth SETH is true. Formally: if there is an $\varepsilon>0$ and an algorithm which solves SAT…
We introduce a framework within which a large class of joint equidistribution problems can be studied and resolved with effective error terms. This involves proving a higher dimensional and $\mu$-analogue of the Erd\"{o}s-Tur\'{a}n…
We consider a class of parameter-dependent optimal control problems of elliptic PDEs with constraints of general type on the control variable. Applying the concept of variational discretization, [4], together with techniques from the…
We obtain a new upper bound for $\sum_{h\le H}\Delta_k(N,h)$ for $1\le H\le N$, $k\in \N$, $k\ge3$, where $\Delta_k(N,h)$ is the (expected) error term in the asymptotic formula for $\sum_{N < n\le2N}d_k(n)d_k(n+h)$, and $d_k(n)$ is the…
The method of separation of variables is significant, it has been applied to physics, engineering , chemistry and other fields. It allows to reduce the diffculity of problems by separating the variables from partial differential equation…
First, we establish an abstract ergodic result on $\mR^d$. Classical ergodic results on $\mR^d$ require that the process is irreducible, we weaken it to some weak form of irreducibility in this article. The main method used in this article…
Regularization is a popular technique in machine learning for model estimation and avoiding overfitting. Prior studies have found that modern ordered regularization can be more effective in handling highly correlated, high-dimensional data…
We present algorithms for length-constrained maximum sum segment and maximum density segment problems, in particular, and the problem of finding length-constrained heaviest segments, in general, for a sequence of real numbers. Given a…
We examine a family of three-dimensional exponential sums with monomials and provide estimates which are in some instances sharper than those stemming from approaches entailing the use of existing bounds pertaining to analogous sums.
The subset sum problem, also referred as SSP, is a NP-Hard computational problem. SSP has its applications in broad domains like cryptography, number theory, operation research and complexity theory. The most famous algorithm for solving…
The identification of new rare signals in data, the detection of a sudden change in a trend, and the selection of competing models, are among the most challenging problems in statistical practice. These challenges can be tackled using a…
We propose an Extended Hybrid High-Order scheme for the Poisson problem with solution possessing weak singularities. Some general assumptions are stated on the nature of this singularity and the remaining part of the solution. The method is…
We study statistical properties of an NP-complete problem, the subset sum, using the methods and concepts of statistical mechanics. The problem is a generalization of the number partitioning problem, which is also an NP-complete problem and…
This paper considers the problem of estimating the variance of a sum of a triangular array of random vectors with heterogeneous means. When random vectors exhibit two-way cluster dependence or weak dependence, standard variance estimators…