Related papers: Computing jumping numbers in higher dimensions
We study the numerical integration problem for functions with infinitely many variables. The function spaces of integrands we consider are weighted reproducing kernel Hilbert spaces with norms related to the ANOVA decomposition of the…
We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…
We develop a general theory of jump operators, which is intended to provide an abstraction of the notion of "limit-computability" on represented spaces. Jump operators also provide a framework with a strong categorical flavor for…
We study the error arising in the numerical approximation of FBSDEs and related PIDEs by means of a deep learning-based method. Our results focus on decoupled FBSDEs with jumps and extend the seminal work of HAn and Long (2020) analyzing…
We revisit the problem of computing the spreading and covering numbers. We show a connection between some of the spreading numbers and the number of non-negative integer 2x2 matrices whose entries sum to d, and we construct an algorithm to…
We introduce and explore a new concept of evasive subspace with respect to a collection of subspaces sharing a common dimension, most notably partial spreads. We show that this concept generalises known notions of subspace scatteredness and…
An effective method of computing division polynomials in terms of Mumford coordinates is presented. As an example, division polynomials for $3$- and $4$-torsion divisors on a genus two curve are obtained explicitly in terms of Mumford…
We study the ramification divisors of projections of a smooth projective variety onto a linear subspace of the same dimension. We prove that the ramification divisors vary in a maximal dimensional family for a large class of varieties.…
In this paper, we study properties of Weil height functions associated with numerically trivial divisors. It helps us to define the fractional limit of $h_E$ with respect to $h_D$ on $U$, with $D$ ample: \[ \Flim_D(E,U) :=…
In the Python world, NumPy arrays are the standard representation for numerical data. Here, we show how these arrays enable efficient implementation of numerical computations in a high-level language. Overall, three techniques are applied…
We present a numerical approach for computing attractive-repulsive power law equilibrium measures in arbitrary dimension. We prove new recurrence relationships for radial Jacobi polynomials on $d$-dimensional ball domains, providing a…
The numbers of $\mathbb{F}_q$-points of nonsingular hypersurfaces of a fixed degree in an odd-dimensional projective space are investigated, and an upper bound for them is given. Also we give the complete list of nonsingular hypersurfaces…
In this paper, we give an algorithm for detecting non-trivial 3-APs in multiplicative subgroups of $\mathbb{F}_p^\times$ that is substantially more efficient than the naive approach. It follows that certain Var der Waerden-like numbers can…
In this paper, we propose and study a fast multilevel dimension iteration (MDI) algorithm for computing arbitrary $d$-dimensional integrals based on tensor product approximations. It reduces the computational complexity (in terms of the CPU…
We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.
Based on the partition of parameter space, two algorithms for computing the rational univariate representation of zero-dimensional ideals with parameters are presented in the paper. Unlike the rational univariate representation of…
Let $X$ be a smooth projective variety. The Iitaka dimension of a divisor $D$ is an important invariant, but it does not only depend on the numerical class of $D$. However, there are several definitions of ``numerical Iitaka dimension'',…
This paper is an enhancement of the previous note "Explicit computations of Zariski decompositions on P_Z^1". In this paper, we observe several properties of a certain kind of an arithmetic divisor D on the n-dimensional projective space…
We develop a novel, general and computationally efficient framework, called Divide and Conquer Dynamic Programming (DCDP), for localizing change points in time series data with high-dimensional features. DCDP deploys a class of greedy…
The generalized winding number is an essential part of the geometry processing toolkit, allowing to quantify how much a given point is inside a surface, even when the surface has boundaries and noise. We propose a new universal method to…