Related papers: Algorithm for computing local Bernstein-Sato ideal…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
We present a scalable algorithm for the individually fair ($p$, $k$)-clustering problem introduced by Jung et al. and Mahabadi et al. Given $n$ points $P$ in a metric space, let $\delta(x)$ for $x\in P$ be the radius of the smallest ball…
A stochastic-gradient-based interior-point algorithm for minimizing a continuously differentiable objective function (that may be nonconvex) subject to bound constraints is presented, analyzed, and demonstrated through experimental results.…
For a nonzero ideal I of C[x_1,...,x_n], with 0 in supp I, a generalization of a conjecture of Igusa - Denef - Loeser predicts that every pole of its topological zeta function is a root of its Bernstein-Sato polynomial. However, typically…
Bernstein's inequality is a central result in the theory of $D$-modules on smooth varieties. While Bernstein's inequality fails for rings of differential operators on general singularities, recent work of \`{A}lvarez Montaner, Hern\'andez,…
Let $\Delta$ be a stable simplicial complex on $n$ vertexes. Over an arbitrary base field $K$, the symmetric algebraic shifted complex $\Delta^s$ of $\Delta$ is defined. It is proved that the Betti numbers of the Stanley-Reisner ideals in…
We consider the quantum complexity of computing Schatten $p$-norms and related quantities, and find that the problem of estimating these quantities is closely related to the one clean qubit model of computation. We show that the problem of…
We study local optima of the Hamiltonian of the Sherrington-Kirkpatrick model. We compute the exponent of the expected number of local optima and determine the "typical" value of the Hamiltonian.
The k Nearest Neighbors (kNN) method has received much attention in the past decades, where some theoretical bounds on its performance were identified and where practical optimizations were proposed for making it work fairly well in high…
We describe all Mathieu-Zhao spaces of $k[x_1,\cdots,x_n]$ ($k$ is an algebraically closed field of characteristic zero) which contains an ideal of finite codimension. Furthermore we give an algorithm to decide if a subspace of the form…
We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation…
The $F$-signature of a local ring of prime characteristic is a numerical invariant that detects many interesting properties. For example, this invariant detects (non)singularity and strong $F$-regularity. However, it is very difficult to…
We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…
We compute the constant of approximation for an arbitrary rational point on an arbitrary smooth cubic hypersurface $X$ over a number field $k$, provided that there is a $k$-rational line somewhere on $X$. In the process, we verify the Coba…
We develop qubit Hamiltonian single parameter estimation techniques using a Bayesian approach. The algorithms considered are restricted to projective measurements in a fixed basis, and are derived under the assumption that the qubit…
A common practice in obtaining a semiparametric efficient estimate is through iteratively maximizing the (penalized) log-likelihood w.r.t. its Euclidean parameter and functional nuisance parameter via Newton-Raphson algorithm. The purpose…
In this paper we consider the problem of computing all possible order ideals and also sets connected to 1, and the corresponding border bases, for the vanishing ideal of a given finite set of points. In this context two different approaches…
Given a set of n points in the plane, each point having a positive weight, and an integer k>0, we present an optimal O(n \log n)-time deterministic algorithm to compute a step function with k steps that minimizes the maximum weighted…
In computer aided geometric design a polynomial is usually represented in Bernstein form. This paper presents a family of compensated algorithms to accurately evaluate a polynomial in Bernstein form with floating point coefficients. The…
In this paper, we introduce a novel approach to multi-modal optimization by enhancing the recently developed kinetic-based optimization (KBO) method with genetic dynamics (GKBO). The proposed method targets objective functions with multiple…