Related papers: Computing jumping numbers in higher dimensions
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
We prove that the $F$-jumping numbers of the test ideal $\tau(X; \Delta, \ba^t)$ are discrete and rational under the assumptions that $X$ is a normal and $F$-finite variety over a field of positive characteristic $p$, $K_X+\Delta$ is…
A descent $k$ of a permutation $\pi=\pi_{1}\pi_{2}\dots\pi_{n}$ is called a big descent if $\pi_{k}>\pi_{k+1}+1$; denote the number of big descents of $\pi$ by $\operatorname{bdes}(\pi)$. We study the distribution of the…
Skyline computation aims at looking for the set of tuples that are not worse than any other tuples in all dimensions from a multidimensional database. In this paper, we present SDI (Skyline on Dimension Index), a dimension indexing…
A formula for the jumping numbers of a curve unibranch at a singular point is established. The jumping numbers are expressed in terms of the Enriques diagram of the log resolution of the singularity, or equivalently in terms of the…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
Generalized winding numbers provide a robust measure of point insidedness for 3D surfaces - whether open, self-intersecting, or non-manifold - and are central to numerous geometry processing tasks. However, existing methods trade off…
Iannucci considered the positive divisors of a natural number $n$ that do not exceed the square root of $n$ and found all numbers whose such divisors are in arithmetic progression. Continuing the work, we define large divisors to be…
On a weighted projective surface $\mathbb{P}(a,b,c)$ with $\min(a,b,c)\leq 4$, we compute lower bounds for the {\em effective threshold} of an ample divisor, in other words, the highest multiplicity a section of the divisor can have at a…
An $n$-cap in $k$-dimensional projective space is a set of $n$ points so that no three lie on a line. In this note, we provide an algorithm to count the number of $n$-caps in $\mathbb{P}^3(\mathbb{F}_q)$, which follows from our recent paper…
High-dimensional parabolic partial integro-differential equations (PIDEs) appear in many applications in insurance and finance. Existing numerical methods suffer from the curse of dimensionality or provide solutions only for a given…
In this paper we study smooth projective rational surfaces, defined over an algebraically closed field of any characteristic, with pseudo-effective anticanonical divisor. We provide a necessary and sufficient condition in order for any nef…
In this work, we develop a new iterative method for computing the digits of $\pi$ by argument reduction of the tangent function. This method combines a modified version of the iterative formula for $\pi$ with squared convergence that we…
An algorithm for computing /pi(N) is presented.It is shown that using a symmetry of natural numbers we can easily compute /pi(N).This method relies on the fact that counting the number of odd composites not exceeding N suffices to calculate…
We associate with any finite subset of a metric space an infinite sequence of scale invariant numbers $\rho_1,\rho_2,\dots$ derived from a variant of differential entropy called the genial entropy. As statistics for point processes, these…
In this paper the jump formulas for the double layer potential and other singular integrals are proved for arbitrary rectifiable sets, by defining suitable non-tangential limits. The arguments are quite straightforward and only require some…
We introduce the use of $p$-descent techniques for elliptic surfaces over a perfect field of characteristic not $2$ or $3$. Under mild hypotheses, we obtain an upper bound for the rank of a non-constant elliptic surface. When $p=2$, this…
We consider the problem of detecting jumps in an otherwise smoothly evolving trend whilst the covariance and higher-order structures of the system can experience both smooth and abrupt changes over time. The number of jump points is allowed…
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…
Scientists and engineers rely on accurate mathematical models to quantify the objects of their studies, which are often high-dimensional. Unfortunately, high-dimensional models are inherently difficult, i.e. when observations are sparse or…