相关论文: Quasi-Optimal Arithmetic for Quaternion Polynomial…

We utilize the same technique as in [arXiv:2205.04254 (2022)] to provide some representations of polynomials non-negative on a basic semi-algebraic set, defined by polynomial inequalities, under more general conditions. Based on each…

A result of P\'olya states that every sequence of quadrature formulas $Q_n(f)$ with $n$ nodes and positive numbers converges to the integral $I(f)$ of a continuous function $f$ provided $Q_n(f)=I(f)$ for a space of algebraic polynomials of…

Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient…

Fast multidimensional convolution can be performed naively in quadratic time and can often be performed more efficiently via the Fourier transform; however, when the dimensionality is large, these algorithms become more challenging. A…

Spectral polynomial approximation of smooth functions allows real-time manipulation of and computation with them, as in the Chebfun system. Extension of the technique to two-dimensional and three-dimensional functions on hyperrectangles has…

We introduce the notion of "quasi-symmetric" polynomials, which is a generalization of the notion of symmetry, and is particularly suited to the setting of polynomial rings over finite fields. The properties of this new class of functions…

Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…

Let $L$ be the language of rings. We provide an axiomatization of the $L$-theories of quaternions and octonions and characterize their models: they coincide, up to isomorphism, with quaternion and octonion algebras over a real closed field,…

The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem.…

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…

We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…

Multi-task learning (MTL) has emerged as a pivotal paradigm in machine learning by leveraging shared structures across multiple related tasks. Despite its empirical success, the development of likelihood-based efficiently solvable…

The Fast Reciprocal Square Root Algorithm is a well-established approximation technique consisting of two stages: first, a coarse approximation is obtained by manipulating the bit pattern of the floating point argument using integer…

Matrix quasi exactly solvable operators are considered and new conditions are determined to test whether a matrix differential operator possesses one or several finite dimensional invariant vector spaces. New examples of $2\times 2$-matrix…

We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive semi-definite Hamiltonians, our method has expected running-time that is almost linear in $(M/(\epsilon_{\rm…

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

This paper considers permutation polynomials over the finite field $F_{q^2}$ in even characteristic by utilizing low-degree permutation rational functions over $F_q$. As a result, we obtain two classes of permutation binomials and six…

Classes of set functions along with a choice of ground set are a bedrock to determine and develop corresponding variants of greedy algorithms to obtain efficient solutions for combinatorial optimization problems. The class of approximate…

We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…

We propose a geometric explanation for the observation that generic quadratic polynomials over split quaternions may have up to six different factorizations while generic polynomials over Hamiltonian quaternions only have two. Split…