Related papers: Computation of Differential Chow Forms for Prime D…
Scientific studies often require the precise calculation of derivatives. In many cases an analytical calculation is not feasible and one resorts to evaluating derivatives numerically. These are error-prone, especially for higher-order…
The primary purpose of this paper is give a classification scheme for the nonzero primes of a Pr\"ufer domain based on five properties. A prime $P$ of a Pr\"ufer domain $R$ could be sharp or not sharp, antesharp or not, divisorial or not,…
We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…
Causal discovery from observational data is a fundamental task in artificial intelligence, with far-reaching implications for decision-making, predictions, and interventions. Despite significant advances, existing methods can be broadly…
We describe an algorithm that computes possible corners of hypothetical counterexamples to the Jacobian Conjecture up to a given bound. Using this algorithm we compute the possible families corresponding to $\gcd(deg(P),deg(Q))\le 35$, and…
We study the problem of performing counting queries at different levels in hierarchical structures while preserving individuals' privacy. Motivated by applications, we propose a new error measure for this problem by considering a…
The kernel polynomial method based on Jacobi polynomials $P_n^{\alpha,\beta}(x)$ is proposed. The optimal-resolution positivity-preserving kernels and the corresponding damping factors are obtained. The results provide a generalization of…
Let $G$ be a finite group of odd order. We show that if $\chi$ is an irreducible primitive character of $G$ then for all primes $p$ dividing the order of $G$ there is a conjugacy class such that the $p-$part of $\chi(1)$ divides the size of…
The problem of algebraic dependence of solutions to (non-linear) first order autonomous equations over an algebraically closed field of characteristic zero is given a `complete' answer, obtained independently of model theoretic results on…
In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…
We compute and study two determinantal representations of the discriminant of a cubic quaternary form. The first representation is the Chow form of the $2$-uple embedding of $\mathbb{P}^3$ and is computed as the Pfaffian of the Chow form of…
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…
Most nonlinear partial differential equation (PDE) solvers require the Jacobian matrix associated to the differential operator. In PETSc, this is typically achieved by either an analytic derivation or numerical approximation method such as…
The paradigm of differentiable programming has significantly enhanced the scope of machine learning via the judicious use of gradient-based optimization. However, standard differentiable programming methods (such as autodiff) typically…
When $k$ is a field, the classical Jacobian criterion computes the singular locus of an equidimensional, finitely generated $k$-algebra as the closed subset of an ideal generated by appropriate minors of the so-called Jacobian matrix.…
We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…
Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…
We give an algorithm to compute inhomogeneous differential equations for definite integrals with parameters. The algorithm is based on the integration algorithm for $D$-modules by Oaku. Main tool in the algorithm is the Gr\"obner basis…
A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction.…
Given a separated scheme $X$ of finite type over a finite field, its higher Chow groups $CH_{-1}(X, 1)$ and $CH_{-2}(X, 3)$ are computed explicitly.