Related papers: A numerical algorithm for computing the zeros of p…
We compute a complete set of isomorphism classes of cubic fourfolds over $\mathbb{F}_2$. Using this, we are able to compile statistics about various invariants of cubic fourfolds, including their counts of points, lines, and planes; all…
An effective algorithm is presented for solving the Beltrami equation fzbar = mu fz in a planar disk. The algorithm involves no evaluation of singular integrals. The strategy, working in concentric rings, is to construct a piecewise linear…
We propose polynomial-time algorithms for finding nontrivial zeros of quadratic forms with four variables over rational function fields of characteristic 2. We apply these results to find prescribed quadratic subfields of quaternion…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
We extend the Faulhaber formula to the whole complex plane, obtaining an expression that fully resembles the Euler-Maclaurin summation formula, only it's exact. Thereafter, an expression for the generalized harmonic progressions valid in…
We study algebraic algorithms for expressing the number of non-negative integer solutions to a unimodular system of linear equations as a function of the right hand side. Our methods include Todd classes of toric varieties via Gr\"obner…
The purpose of this work is to introduce a strategy for determining the nodes and weights of a low-cardinality positive cubature formula nearly exact for polynomials of a given degree over spherical polygons. In the numerical section we…
Many statistical problems and applications require repeated computation of order statistics, such as the median, but most statistical and programming environments do not offer in their main distribution linear selection algorithms. We…
As an attempt to bridge between numerical analysis and algebraic geometry, this paper formulates the multiplicity for the general nonlinear system at an isolated zero, presents an algorithm for computing the multiplicity structure, proposes…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form…
The quantum query models is one of the most important models in quantum computing. Several well-known quantum algorithms are captured by this model, including the Deutsch-Jozsa algorithm, the Simon algorithm, the Grover algorithm and…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…
We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the $N$th coefficient of an algebraic series uses differential equations and has…
In this paper, we investigate the power of nearly purely operational techniques in the study of umbral calculus. We present a concise reconstruction of the theory based on a systematic use of linear operators, with particular attention to…
This paper presents a high-order accurate numerical quadrature algorithm for evaluating integrals over curved surfaces and regions defined implicitly via a level set of a given function restricted to a hyperrectangle. The domain is divided…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
An approximation Ansatz for the operator solution, $U(z',z)$, of a hyperbolic first-order pseudodifferential equation, $\d_z + a(z,x,D_x)$ with $\Re (a) \geq 0$, is constructed as the composition of global Fourier integral operators with…
We discuss the distribution of partition function zeros for the grand-canonical ensemble of the zeta-urn model, where tuning a single parameter can give a first or any higher order condensation transition. We compute the locus of zeros for…
This paper aims at an accurate and efficient computation of effective quantities, e.g., the homogenized coefficients for approximating the solutions to partial differential equations with oscillatory coefficients. Typical multiscale methods…