Related papers: Effective Counting and Spiralling of Lattice Appro…

Let $q$ be a power of a prime $p$ and let $G$ be a completely reducible subgroup of $\mathrm{GL}(d,q)$. We prove that the number of composition factors of $G$ that have prime order $p$ is at most $(\varepsilon_q d-1)/(p-1)$, where…

In this work, we discuss completeness for the lattice orders of first and second order stochastic dominance. The main results state that, both, first and second order stochastic dominance induce Dedekind super complete lattices,…

Rips complexes are important structures for analyzing topological features of metric spaces. Unfortunately, generating these complexes is expensive because of a combinatorial explosion in the complex size. For $n$ points in $\mathbb{R}^d$,…

We prove that the error of the best nonlinear $L_p$-approximation by piecewise constants on convex partitions is $\mathcal{O}\big(N^{-\frac{2}{d+1}}\big)$, where $N$ the number of cells, for all functions in the Sobolev space…

Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and…

We consider structured approximation of measures in Wasserstein space $\mathrm{W}_p(\mathbb{R}^d)$ for $p\in[1,\infty)$ using general measure approximants compactly supported on Voronoi regions derived from a scaled Voronoi partition of…

We present expressions for the coefficients which arise in asymptotic expansions of multiple integrals of Laplace type (the first term of which is known as Laplace's approximation) in terms of asymptotic series of the functions in the…

Let $d$ be a real number, let $s$ be in a fixed compact set of the strip $1/2<\sigma<1$, and let $L(s, \chi)$ be the Dirichlet $L$-function. The hypothesis is that for any real number $d$ there exist 'many' real numbers $\tau$ such that the…

We perform a tree-level O(a) improvement of two-dimensional N=(2,2) supersymmetric Yang-Mills theory on the lattice, motivated by the fast convergence in numerical simulations. The improvement respects an exact supersymmetry Q which is…

A point (x1, x2) with coordinates in a subfield of R of transcendence degree one over Q, with 1, x1, x2 linearly independent over Q, may have a uniform exponent of approximation by elements of Q^2 that is strictly larger than the lower…

Matom\"aki proved that if $\alpha\in \mathbb{R}$ is irrational, then there are infinitely many primes $p$ such that $|\alpha-a/p|\le p^{-4/3+\varepsilon}$ for a suitable integer a. In this paper, we extend this result to all quadratic…

Many present lattice QCD approaches to calculate the parton distribution functions (PDFs) rely on a factorization formula or effective theory expansion of certain Euclidean matrix elements in boosted hadron states. In the quasi- and…

We give an integrability condition on a function $\psi$ guaranteeing that for almost all (or almost no) $x\in\mathbb{R}$, the system $|qx-p|\leq \psi(t)$, $|q|<t$ is solvable in $p\in \mathbb{Z}$, $q\in \mathbb{Z}\smallsetminus \{0\}$ for…

Lattice rules are among the most prominently studied quasi-Monte Carlo methods to approximate multivariate integrals. A rank-1 lattice rule to approximate an $s$-dimensional integral is fully specified by its generating vector $\mathbf{z}…

Let $\alpha_1,\alpha_2$ be non-zero algebraic numbers such that $\frac{\log \alpha_2}{\log\alpha_1}\notin\mathbb{Q}$ and let $\beta$ be a quadratic irrational number. In this article, we prove that the values of two relatively prime…

We explore the compact U(1) lattice gauge theory with staggered fermions and gauge field action -\sum_P [\beta \cos(\Theta_P) + \gamma \cos(2\Theta_P)], both for dynamical fermions and in the quenched approximation. (\Theta_P denotes the…

In the strong coupling and heavy quark mass regime, lattice QCD dimensionally reduces to effective theories of Polyakov loops depending on the parameters of the original Wilson action $\beta, \kappa$ and $N_\tau$. We apply coarse graining…

The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows: Let $D=\{x_1,x_2,\ldots x_d\}$ be a set of $d$ words defined on an alphabet…

Let $\mathbf{R}$ be the sample correlation matrix constructed from $\mathbf{X}\in \mathbb{R}^{p\times n}$, whose entries are independent and identically distributed random variables with mean zero and tail probability condition…

We determine the Lagrange function in Taylor polynomial approximation by solving an appropriate initial-value problem. Hence, we determine the remainder term which we then approximate by means of a natural cubic spline. This results in a…