Related papers: Faster computation of Witt vectors over polynomial…
Finding a computationally efficient algorithm for the inverse continuous wavelet transform is a fundamental topic in applications. In this paper, we show the convergence of the inverse wavelet transform.
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical…
We recall some basic computations in the Milnor-Witt K-theory of a field, following Morel. We then focus on the Witt K-theory of a field of characteristic two and give an elementary proof of the fact that it is isomorphic as a graded ring…
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…
Ritt-Wu's algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for…
We propose a polynomial time $f$-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over $\mathbb{F}_q$) for computing an isomorphism (if there is any) of a finite dimensional…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…
Fast Fourier transform algorithms are an arsenal of effective tools for solving various problems of analysis and high-speed processing of signals of various natures. Almost all of these algorithms are designed to process sequences of…
Given a function from $\mathbb{Z}_n$ to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over $\mathbb{Z}_n$ by constructing…
We give a direct construction of the ring spectrum of spherical Witt vectors of a perfect $\mathbb{F}_p$-algebra R as the completion of the spherical monoid algebra $\mathbb{S}[R]$ of the multiplicative monoid $(R,\cdot)$ at the ideal $I =…
For a not-necessarily commutative ring R we define an abelian group W(R;M) of Witt vectors with coefficients in an R-bimodule M. These groups generalize the usual big Witt vectors of commutative rings and we prove that they have analogous…
The finite element method is used to approximately solve boundary value problems for differential equations. The method discretises the parameter space and finds an approximate solution by solving a large system of linear equations. Here we…
The classic algorithm of Viterbi computes the most likely path in a Hidden Markov Model (HMM) that results in a given sequence of observations. It runs in time $O(Tn^2)$ given a sequence of $T$ observations from a HMM with $n$ states.…
A proof of convergence is given for a novel evolving surface finite element semi-discretization of Willmore flow of closed two-dimensional surfaces, and also of surface diffusion flow. The numerical method proposed and studied here…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
This paper presents an algorithm, Voted Kernel Regularization , that provides the flexibility of using potentially very complex kernel functions such as predictors based on much higher-degree polynomial kernels, while benefitting from…