Related papers: Computing jumping numbers in higher dimensions

In this article, we try to explain and unify standard divisibility tests found in various books. We then look at recurring decimals, and list a few of their properties. We show how to compute the number of digits in the recurring part of…

We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which is for larger models by far more efficient than directly computing Groebner bases or the interpolation method proposed in the first…

In this article, we propose a new numerical approach to high-dimensional partial differential equations (PDEs) arising in the valuation of exotic derivative securities. The proposed method is extended from Reisinger and Wittum (2007) and…

We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…

We compute many new classes of effective divisors in $\overline{\mathcal{M}}_{g,n}$ coming from the strata of abelian differentials and efficiently reproduce many known results obtained by alternate methods. Our method utilises maps between…

This paper presents an extension and an elaboration of the theory of differential similarity, which was originally proposed in arXiv:1401.2411 [cs.LG]. The goal is to develop an algorithm for clustering and coding that combines a geometric…

In this paper we present a version of the general polynomial involutive algorithm for computing Janet bases specialized to toric ideals. The relevant data structures are Janet trees which provide a very fast search for a Janet divisor. We…

If we know that some kind of sequence always converges, we can ask how quickly and how uniformly it converges. Many convergent sequences converge non-uniformly and, relatedly, have no computable rate of convergence. However proof-theoretic…

The gradient scheme framework is based on a small number of properties and encompasses a large number of numerical methods for diffusion models. We recall these properties and develop some new generic tools associated with the gradient…

We find upper and lower bounds on the number of rational points that are $\psi$-approximations of some $n$-dimensional $p$-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle…

Inside the symmetric product of a very general curve, we consider the codimension-one subvarieties of symmetric tuples of points imposing exceptional secant conditions on linear series on the curve of fixed degree and dimension. We compute…

We define a generalization of the winding number of a piecewise $C^1$ cycle in the complex plane which has a geometric meaning also for points which lie on the cycle. The computation of this winding number relies on the Cauchy principal…

The paper proposes artificial intelligence technique called hill climbing to find numerical solutions of Diophantine Equations. Such equations are important as they have many applications in fields like public key cryptography, integer…

We present a new dimension reduction method called the global active subspace method. The method uses expected values of finite differences of the underlying function to identify the important directions, and builds a surrogate model using…

We show that a generic real projective $n$-dimensional hypersurface of odd degree $d$, such that $4(n-2)=\binom{d+3}3$, contains "many" real 3-planes, namely, in the logarithmic scale their number has the same rate of growth, $d^3\log d$,…

We solve the problem of computing characteristic numbers of rational space curves with a cusp, where there may or may not be a condition on the node. The solution is given in the form of effective recursions. We give explicit formulas when…

Differentiation is a cornerstone of computing and data analysis in every discipline of science and engineering. Indeed, most fundamental physics laws are expressed as relationships between derivatives in space and time. However, derivatives…

We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations…

A method is developed here for building differentiable three-dimensional manifolds on multicube structures. This method constructs a sequence of reference metrics that determine differentiable structures on the cubic regions that serve as…

Let C be a curve over a complete valued field with infinite residue field whose skeleton is a chain of loops with generic edge lengths. We prove that any divisor on the chain of loops that is rational over the value group lifts to a divisor…