Related papers: Symmetric Subresultants and Applications
This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…
An element [\Phi] of the Grassmannian of n-dimensional subspaces of the Hardy space H^2, extended over the field C(x_1,..., x_n), may be associated to any polynomial basis {\phi} for C(x). The Pl\"ucker coordinates…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…
The paper contains a systematic theory of the one-dimensional Double Hecke algebra, including applications to the difference Fourier transform, Macdonald's polynomials, Gaussian sums at roots of unity, and Verlinde algebras. The main result…
We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
In recent years there has been a growing interest in the fractional Fourier transform driven by its large number of applications. The literature in this field follows two main routes. On the one hand, the areas where the ordinary Fourier…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
We construct linear operators factorizing the three bases of symmetric polynomials: monomial symmetric functions m(x), elementary symmetric polynomials E(x), and Schur functions s(x), into products of univariate polynomials.
We study an action of the skew divided difference operators on the Schubert polynomials and give an explicit formula for structural constants for the Schubert polynomials in terms of certain weighted paths in the Bruhat order on the…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
In this paper, we use Schur elements to derive semisimplicity criteria for (super)symmetric superalgebras. We obtain a closed formula for the Schur elements of cyclotomic Hecke-Clifford superalgebras $\mathcal{H}^{f}_{\mathbb{K}}$. As…
Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…
Some near-optimal polynomial root-finders of 2024-25, based on subdivision iterations, approximate all complex roots of a polynomial or all roots in a fixed Region of Interest in the complex plane. The iterations can be applied to a black…
We describe the discrete Fourier transform (DFT) for a cyclic group when $p|N$ by factoring $x^N-1$ over finite fields and constructing the Fourier transform and its inverse using B\'{e}zout's identity for polynomials. For the symmetric…
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and product operations on these systems (disjoint union and direct product, respectively) giving a…