Related papers: Symmetric Subresultants and Applications
We study the factorization of Schubert polynomials into elementary symmetric polynomials. We conjecture that this occurs when the permutation corresponding to the Schubert polynomial does not contain the patterns $1432$, $1423$, $4132$, and…
We show that tautological integrals on Hilbert schemes of points can be written in terms of universal polynomials in Chern numbers. The results hold in all dimensions, though they strengthen known results even for surfaces by allowing…
We consider the problem of optimizing a multivariate quadratic function where each decision variable is constrained to be a complex $m$'th root of unity. Such problems have applications in signal processing, MIMO detection, and the…
An attempt is described to extend the notion of Schur functions from Young diagrams to plane partitions. The suggestion is to use the recursion in the partition size, which is easily generalized and deformed. This opens a possibility to…
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…
We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. This provides a universal method for…
The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…
By considering type B analogs of permutations and tableaux, we extend abstract dual equivalence to type B in two directions. In one direction, we define involutions on signed permutations and shifted tableaux that give a weak dual…
In this paper we propose a new approach to least squares approximation problems. This approach is based on partitioning and Schur function. The nature of this approach is combinatorial, while most existing approaches are based on algebra…
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various…
In this paper we present two different variants of method for symmetric matrix inversion, based on modified Gaussian elimination. Both methods avoid computation of square roots and have a reduced machine time's spending. Further, both of…
Given an arbitrary monic polynomial $f$ over a field $F$ of characteristic 0, we use companion matrices to construct a polynomial $M_f\in F[X]$ of minimum degree such that for each root $\alpha$ of $f$ in the algebraic closure of $F$,…
Schur modules give the irreducible polynomial representations of the general linear group $\mathrm{GL}_t$. Viewing the symmetric group $\mathfrak{S}_t$ as a subgroup of $\mathrm{GL}_t$, we may restrict Schur modules to $\mathfrak{S}_t$ and…
We introduce an algebra $\mathcal H$ consisting of difference-reflection operators and multiplication operators that can be considered as a $q=1$ analogue of Sahi's double affine Hecke algebra related to the affine root system of type…
We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…
We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such a technique consists in a specific scaling similarity transformation that reduces…
The class of Schoenberg transformations, embedding Euclidean distances into higher dimensional Euclidean spaces, is presented, and derived from theorems on positive definite and conditionally negative definite matrices. Original results on…
The determinantal identities of Hamel and Goulden have recently been shown to apply to a tableau-based ninth variation of skew Schur functions. Here we extend this approach and its results to the analogous tableau-based ninth variation of…
In 2007 Sami Assaf introduced dual equivalence graphs as a method for demonstrating that a quasisymmetric function is Schur positive. The method involves the creation of a graph whose vertices are weighted by Ira Gessel's fundamental…
We summarize the known useful and interesting results and formulas we have discovered so far in this collaborative article summarizing results from two related articles by Merca and Schmidt arriving at related so-termed Lambert series…