Related papers: Exponential node clustering at singularities for r…

This paper studies the problem of clustering in the two-component Gaussian mixture model where the centers are separated by $2\Delta$ for some $\Delta>0$. We characterize the exact phase transition threshold, given by $$ \bar{\Delta}_n^{2}…

Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…

We give necessary and sufficient conditions for the convergence with geometric rate of the common denominators of simultaneous rational interpolants with a bounded number of poles. The conditions are expressed in terms of intrinsic…

In this article we establish exponential moment bounds, moment bounds in fractional order smoothness spaces, a uniform H\"older continuity in time, and strong convergence rates for a class of fully discrete exponential Euler-type numerical…

A new algorithm for the efficient numerical approximation of weakly singular integrals over convex polytopes is introduced. Such integrals appear in the Galerkin discretizations of integral equations and nonlocal partial differential…

Modern computer architectures support low-precision arithmetic, which present opportunities for the adoption of mixed-precision algorithms to achieve high computational throughput and reduce energy consumption. As a growing number of…

Here we construct the conformal mappings with the help of continuous fractions approximations. These approximations converge to the algebraic roots $\sqrt[N]{z}$ for $N \in \mathbb{N}$ and $z$ from the right half-plane of the complex plane.…

In this paper, we introduce a multiscale framework based on adaptive edge basis functions to solve second-order linear elliptic PDEs with rough coefficients. One of the main results is that we prove the proposed multiscale method achieves…

In these proceedings, we discuss the recent approach of Ref. [1] for the construction of compact Ans\"atze for scattering amplitudes. The method builds powerful constraints on the analytic structure of the rational functions in amplitudes…

On the basis of the explicit formulae for the action of the unitary group of exponentials corresponding to almost solvable extensions of a given closed symmetric operator with equal deficiency indices, we derive a new representation for the…

It was recently shown that almost all solutions in the symmetric binary perceptron are isolated, even at low constraint densities, suggesting that finding typical solutions is hard. In contrast, some algorithms have been shown empirically…

Motivated by a use case in theoretical hadron physics, we revisit an application of a pole-sum fit to dressing functions of a confined quark propagator. More precisely, we investigate approaches to determine the number and positions of the…

We study the problem of tiling and packing in vector spaces over finite fields, its connections with zeroes of classical exponential sums, and with the Jacobian conjecture

We study clustering methods for binary data, first defining aggregation criteria that measure the compactness of clusters. Five new and original methods are introduced, using neighborhoods and population behavior combinatorial optimization…

We show that for a family of randomly kicked Hamiton-Jacobi equations on the torus, almost surely, the solution of an initial value problem converges exponentially fast to the unique stationary solution. Combined with the results in…

We show that if an exponential sum with multiplicative coefficients is large then the associated multiplicative function is "pretentious". This leads to applications in the circle method, and a natural interpretation of the local-global…

We study the rate of convergence for the largest eigenvalue distributions in the Gaussian unitary and orthogonal ensembles to their Tracy-Widom limits. We show that one can achieve an $O(N^{-2/3})$ rate with particular choices of the…

A local convergence rate is established for a Gauss orthogonal collocation method applied to optimal control problems with control constraints. If the Hamiltonian possesses a strong convexity property, then the theory yields convergence for…

Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies…

In this paper, we have developed a unitary variant of a double exponential coupled cluster theory, which is capable of mimicking the effects of connected excitations of arbitrarily high rank, using only rank-one and rank-two parametrization…