相关论文: Multigraded Fujita Approximation

In this paper we consider the following stochastic partial differential equation (SPDE) in the whole space: $du (t, x) = [a^{i j} (t, x) D_{i j} u(t, x) + f(u, t, x)]\, dt + \sum_{k = 1}^m g^k (u(t, x)) dw^k (t).$ We prove the convergence…

The direct and inverse theorems are established for the best approximation in the weighted $L^p$ space on the unit sphere of $\RR^{d+1}$, in which the weight functions are invariant under finite reflection groups. The theorems are stated…

The diffusion approximation (DA) is widely used in the analysis of stochastic population dynamics, from population genetics to ecology and evolution. DA is an uncontrolled approximation that assumes the smoothness of the calculated quantity…

We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…

We associate convex bodies to a wide class of graded G-algebras where G is a connected reductive group. These convex bodies give information about the Hilbert function as well as multiplicities of irreducible representations appearing in…

Theorems of Khintchine, Groshev, Jarn\'ik, and Besicovitch in Diophantine approximation are fundamental results on the metric properties of $\Psi$-well approximable sets. These foundational results have since been generalised to the…

We investigate \emph{magnitude} as a new unary and strictly Pareto-compliant quality indicator for finite approximation sets to the Pareto front in multiobjective optimization. Magnitude originates in enriched category theory and metric…

We establish, for a generically big Hermitian line bundle, the convergence of truncated Harder-Narasimhan polygons and the uniform continuity of the limit. As applications, we prove a conjecture of Moriwaki asserting that the arithmetic…

We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…

We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…

We consider a mixed dimensional elliptic partial differential equation posed in a bulk domain with a large number of embedded interfaces. In particular, we study well-posedness of the problem and regularity of the solution. We also propose…

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

We review Fujiwara's scheme, a sixth order weak approximation scheme for the numerical approximation of SDEs, and embed it into a general method to construct weak approximation schemes of order $ 2m $ for $ m \in \mathbf{N} $. Those schemes…

The vector space of all polynomial functions of degree $k$ on a box of dimension $n$ is of dimension ${n \choose k}$. A consequence of this fact is that a function can be approximated on vertices of the box using other vertices to higher…

It is shown that for finding rational approximates to m'th root of any integer to any accuracy one only needs the ability to count and to distinguish between m different classes of objects. To every integer N can be associated a…

Affine su(3) and su(4) fusion multiplicities are characterised as discretised volumes of certain convex polytopes. The volumes are measured explicitly, resulting in multiple sum formulas. These are the first polytope-volume formulas for…

Given a large set $U$ where each item $a\in U$ has weight $w(a)$, we want to estimate the total weight $W=\sum_{a\in U} w(a)$ to within factor of $1\pm\varepsilon$ with some constant probability $>1/2$. Since $n=|U|$ is large, we want to do…

We unconditionally prove that it is NP-hard to compute a constant multiplicative approximation to the QUANTUM MAX-CUT problem on an unweighted graph of constant bounded degree. The proof works in two stages: first we demonstrate a generic…

We give a new proof of an approximate functional equation, due to J. R. Wilton, for a trigonometric sum involving the divisor function. This allows us to improve on Wilton's error term and to give an explicit formula for an unspecified…

We introduce the weighted greatest common divisor of a tuple of integers and explore some of it basic properties. Furthermore, for a set of heights $\mathfrak w=(q_0, \ldots , q_n)$, we use the concept of the weighted greatest common…