Related papers: A unified framework for the computation of polynom…
Let $f_1,\dots,f_m$ be polynomials in $n$ variables with coefficients in a finite field $\mathbb{F}_q$. We estimate the number of points $\underline{x}$ in $\mathbb{F}_q^n$ such that each value $f_i(\underline{x})$ is a nonzero square in…
In order to solve the problem of non-ideal training sets (i.e., the less-complete or over-complete sets) and implement one-iteration learning, a novel efficient quantum perceptron algorithm based on unitary weights is proposed, where the…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
Multivariate polynomials arise in many different disciplines. Representing such a polynomial as a vector of univariate polynomials can offer useful insight, as well as more intuitive understanding. For this, techniques based on tensor…
Conditions on sure-success decidability of weights of Boolean functions are presented for a given number of generalized Grover iterations. It is shown that the decidability problem reduces to a system of algebraic equations of a single…
This paper deals with the determination of the S-curves in the theory of non-hermitian orthogonal polynomials with respect to exponential weights along suitable paths in the complex plane. It is known that the corresponding complex…
For a system of polynomial equations, whose coefficients depend on parameters, the Newton polyhedron of its discriminant is computed in terms of the Newton polyhedra of the coefficients. This leads to an explicit formula (involving mixed…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
In this paper, we establish an analogue of the Fundamental Theorem of Algebra for polynomial matrix equations, where both the coefficient matrices and the unknown matrix are $Q$-circulant matrices. This result generalizes Abramov's result…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…
While quantum computing provides an exponential advantage in solving system of linear equations, there is little work to solve system of nonlinear equations with quantum computing. We propose quantum Newton's method (QNM) for solving…
In the present paper, new classes of wavelet functions are presented in the framework of Clifford analysis. Firstly, some classes of orthogonal polynomials are provided based on 2-parameters weight functions. Such classes englobe the well…
Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…
Nonlinear equations are challenging to solve due to their inherently nonlinear nature. As analytical solutions typically do not exist, numerical methods have been developed to tackle their solutions. In this article, we give a quantum…
Orthogonal polynomial approximations form the foundation to a set of well-established methods for uncertainty quantification known as polynomial chaos. These approximations deliver models for emulating physical systems in a variety of…
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…
Asymptotic approximations of Jacobi polynomials are given in terms of elementary functions for large degree $n$ and parameters $\alpha$ and $\beta$. From these new results, asymptotic expansions of the zeros are derived and methods are…
In this paper, we consider the Gauss quadrature formulae corresponding to some modifications of anyone of the four Chebyshev weights, considered by Gautschi and Li in \cite{gauli}. As it is well known, in the case of analytic integrands,…
We revisit the problem of extending quadrature formulas for general weight functions, and provide a generalization of Patterson's method for the constant weight function. The method can be used to compute a nested sequence of quadrature…