Related papers: Restricted version of the infinitesimal Hilbert 16…
If $R=k[x_1,\ldots,x_n]/I$ is a graded artinian algebra, then the length of $k[x_1,\ldots,x_n]/I^s$ becomes a polynomial in $s$ of degree $n$ for large $s$. If we write this polynomial as $\sum_{i=0}^n(-1)^ie_i{s+n-i-1\choose n-i}$, then…
We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…
In this paper, we consider the infinite-dimensional integration problem on weighted reproducing kernel Hilbert spaces with norms induced by an underlying function space decomposition of ANOVA-type. The weights model the relative importance…
An exact, number-conserving solution to the generalized, orbit-dependent pairing problem is derived by introducing an infinite-dimensional algebra. A method for obtaining eigenvalues and eigenvectors of the corresponding Hamiltonian is also…
Let $H$ be a real Hilbert space. In this short note, using some of the properties of bounded linear operators with closed range defined on $H$, certain bounds for a specific convex subset of the solution set of infinite linear…
Several recent papers construct auxiliary polynomials to bound the Weil height of certain classes of algebraic numbers from below. Following these techniques, the author gave a general method for introducing auxiliary polynomials to…
Let $R=k[x_1,..., x_r]$ be the polynomial ring in $r$ variables over an infinite field $k$, and let $M$ be the maximal ideal of $R$. Here a \emph{level algebra} will be a graded Artinian quotient $A$ of $R$ having socle $Soc(A)=0:M$ in a…
We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…
Let S be an abelian semigroup, written additively. Let A be a finite subset of S. We denote the cardinality of A by |A|. For any positive integer h, the sumset hA is the set of all sums of h not necessarily distinct elements of A. We define…
The graded Betti numbers of the minimal free resolution (and also therefore the Hilbert function) of the ideal of a fat point subscheme Z of P^2 are determined whenever Z is supported at any 6 or fewer distinct points. All results hold over…
We define modular equations in the setting of PEL Shimura varieties as equations describing Hecke correspondences, and prove upper bounds on their degrees and heights. This extends known results about elliptic modular polynomials, and…
This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.
The problem of finding a maximum $2$-matching without short cycles has received significant attention due to its relevance to the Hamilton cycle problem. This problem is generalized to finding a maximum $t$-matching which excludes specified…
While the P vs NP problem is mainly approached form the point of view of discrete mathematics, this paper proposes reformulations into the field of abstract algebra, geometry, fourier analysis and of continuous global optimization - which…
It has been conjectured for some time that, for any integer n\ge 2, any real number \epsilon >0 and any transcendental real number \xi, there would exist infinitely many algebraic integers \alpha of degree at most n with the property that…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…
We consider a general linear parabolic problem with extended time boundary conditions (including initial value problems and periodic ones), and approximate it by the implicit Euler scheme in time and the Gradient Discretisation method in…
In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…
In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of…