相关论文: Some refinements for translation invariant quadrat…

We characterise partition regularity for linear equations over the Piatetski-Shapiro numbers $\lfloor n^c \rfloor$ when $1 < c < c^\dag(s)$, where $s \geqslant 3$ is the number of variables. Here $c^\dag(3) = 12/11$ and $c^\dag(4) = 7/6$,…

For quantitative seismic imaging, iterative least-squares reverse time migration is the recommended approach. The existence of an inverse of the forward modelling operator would considerably reduce the number of required iterations. In the…

Approximations for an unknown density $g$ in terms of a reference density $f_\nu$ and its associated orthonormal polynomials are discussed. The main application is the approximation of the density $f$ of a sum $S$ of lognormals which may…

We propose an inequality between the longitudinally polarized density and the transversity of a quark in a nucleon. This inequality, whose validity is limited to very small scales, is based on considerations about Lorentz transformations…

We consolidate what is currently known about packing densities of 4-point permutations and in the process improve the lower bounds for the packing densities of 1324 and 1342. We also provide rigorous upper bounds for the packing densities…

We consider the Gaussian kernel density estimator with bandwidth $\beta^{-\frac12}$ of $n$ iid Gaussian samples. Using the Kac-Rice formula and an Edgeworth expansion, we prove that the expected number of modes on the real line scales as…

This paper deals with the problem of density estimation. We aim at building an estimate of an unknown density as a linear combination of functions of a dictionary. Inspired by Cand\`es and Tao's approach, we propose an $\ell_1$-minimization…

We consider the 1-dimensional cubic Szeg\H{o} equation with data distributed according to the Gaussian measure with inverse covariance operator $(1-\partial_x^2)^\frac s2$, where $s>\frac12$. We show that, for $s>1$, this measure is…

We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…

When using boundary integral equation methods, we represent solutions of a linear partial differential equation as layer potentials. It is well-known that the approximation of layer potentials using quadrature rules suffer from poor…

Extends previous work on a quintic-solving algorithm to equations of the eighth-degree.

We study density of rational languages under shift invariant probability measures on spaces of two-sided infinite words, which generalizes the classical notion of density studied in formal languages and automata theory. The density for a…

A fundamental problem in object recognition is the development of image representations that are invariant to common transformations such as translation, rotation, and small deformations. There are multiple hypotheses regarding the source…

We report a robust constrain on the possible variation of fine-structure constant, alpha = e^2/(hbar*c), obtained using O III 4959,5007, nebular emission lines from QSOs. We find Delta-alpha/alpha=-(2.1 +/- 1.6) x 10^(-5) based on a well…

A fundamental task in quantum information science is to measure nonlinear functionals of quantum states, such as $\mathrm{Tr}(\rho^k O)$. Intuitively, one expects that computing a $k$-th order quantity generally requires $O(k)$ copies of…

In this paper, we will provide a method to compute the density of tautologies among the set of well-formed formulae consisting of $m$ variables, the negation symbol and the implication symbol; which has a possibility to be applied for other…

We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…

We study multivariate integration of functions that are invariant under permutations (of subsets) of their arguments. We find an upper bound for the $n$th minimal worst case error and show that under certain conditions, it can be bounded…

We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…

We give an algorithm to compute $N$ steps of a convolution quadrature approximation to a continuous temporal convolution using only $O(N \log N)$ multiplications and $O(\log N)$ active memory. The method does not require evaluations of the…