Related papers: Bit-size estimates for triangular sets in positive…
We examine doing probabilistic descent over manifolds implicitly defined by a set of polynomials with rational coefficients. The system of polynomials is assumed to be triangularized. An application of Whitney's embedding theorem allows us…
Motivated by investigations of the tridiagonal pairs of linear transformations, we introduce the augmented tridiagonal algebra ${\mathcal T}_q$. This is an infinite-dimensional associative ${\mathbb C}$-algebra with 1. We classify the…
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 establish a generic formula for the generalised q-dimensions of measures supported by almost self-affine sets, for all q>1. These q-dimensions may exhibit phase transitions as q varies. We first consider general measures and then…
We describe the images of multilinear polynomials of arbitrary degree evaluated on the $3\times 3$ upper triangular matrix algebra over an infinite field.
We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…
Interpolation error estimates in terms of geometric quality measures are established for harmonic coordinates on polytopes in two and three dimensions. First we derive interpolation error estimates over convex polygons that depend on the…
Positivity in $\ast$-algebras can be defined either algebraically, by quadratic modules, or analytically, by $\ast$-representations. By the induction procedure for $\ast$-representations we can lift the analytical notion of positivity from…
In this paper we focus on the unconstrained binary quadratic optimization model, maximize x^t Qx, x binary, and consider the problem of identifying optimal solutions that are robust with respect to perturbations in the Q matrix.. We are…
Using modular forms we determine formulas for the number of representations of a positive integer by diagonal octonary quadratic forms with coefficients $1$, $2$, $3$ or $6$.
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every $i\geq 0$, $\Ppoly$ has $i$th order scaled $\pthree$-strong dimension 0. We also show that $\Ppoly^\io$ has…
We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…
Binary quantization (BQ) compresses high-dimensional embeddings into one or two bits per coordinate, enabling nearest neighbor search at extreme speed. Yet a striking puzzle persists: BQ achieves competitive recall on contrastive embeddings…
We rederive the finite size scaling formula for the apparent critical temperature by using Mean Field Theory for the Ising Model above the upper critical dimension. We have also performed numerical simulations in five dimensions and our…
We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…
The choice of a point set, to be used in numerical integration, determines, to a large extent, the error estimate of the integral. Point sets can be characterized by their discrepancy, which is a measure of its non-uniformity. Point sets…
Suppose that we wish to estimate a vector $\mathbf{x}$ from a set of binary paired comparisons of the form "$\mathbf{x}$ is closer to $\mathbf{p}$ than to $\mathbf{q}$" for various choices of vectors $\mathbf{p}$ and $\mathbf{q}$. The…
This paper concerns the intermediate dimensions, a spectrum of dimensions that interpolate between the Hausdorff and box dimensions. Potential theoretic methods are used to produce dimension bounds for images of sets under H\"older maps and…
We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…
We present numerical upscaling techniques for a class of linear second-order self-adjoint elliptic partial differential operators (or their high-resolution finite element discretization). As prototypes for the application of our theory we…