相关论文: Symmetric Subresultants and Applications

We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d-dimensional quantum systems is a transform between a standard computational basis…

Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…

We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…

An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an $\mathbb{F}_2$-linear subspace of the field. We view these transforms as performing a change of basis from…

We present new estimates for sums of the divisor function, and other similar arithmetic functions, in short intervals over function fields. (When the intervals are long, one obtains a good estimate from the Riemann hypothesis.) We obtain an…

We use dual equivalence to give a short, combinatorial proof that Stanley symmetric functions are Schur positive. We introduce weak dual equivalence, and use it to give a short, combinatorial proof that Schubert polynomials are key…

We consider the expansion of the square of a complete homogeneous function $h_\lambda$, or of an elementary symmetric function $e_\lambda$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_\lambda]$…

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

We introduce the multiple zeta functions with structures similar to those of symmetric functions such as Schur $P$-, Schur $Q$-, symplectic and orthogonal functions in the representation theory. We first consider their basic properties such…

Gelfand-Tsetlin polytopes are classical objects in algebraic combinatorics arising in the representation theory of $\mathfrak{gl}_n(\mathbb{C})$. The integer point transform of the Gelfand-Tsetlin polytope $\mathrm{GT}(\lambda)$ projects to…

We isolate and generalize a technique implicit in many quantum algorithms, including Shor's algorithms for factoring and discrete log. In particular, we show that the distribution sampled after a Fourier transform over ${\mathbb Z}_p$ can…

Schur Polynomials are families of symmetric polynomials that have been classically studied in Combinatorics and Algebra alike. They play a central role in the study of Symmetric functions, in Representation theory [Sta99], in Schubert…

We show the equivalence of the Pieri formula for flag manifolds and certain identities among the structure constants, giving new proofs of both the Pieri formula and of these identities. A key step is the association of a symmetric function…

The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…

We consider an operator of Bernstein for symmetric functions, and give an explicit formula for its action on an arbitrary Schur function. This formula is given in a remarkably simple form when written in terms of some notation based on the…

This article presents a new method for calculating square roots in GF(p) by exponentiating in GF(p^3) or equivalently modulo irreducible cubic polynomials. This algorithm is in some ways similar to the Cipolla-Lehmer algorithm which is…

In this paper, we introduce a family of symmetric polynomials by specializing the factorial Schur polynomials. These polynomials represent the weighted Schubert classes of the cohomology of the weighted Grassmannian introduced by…

we start the study of Schur analysis in the quaternionic setting using the theory of slice hyperholomorphic functions. The novelty of our approach is that slice hyperholomorphic functions allows to write realizations in terms of a suitable…

Computing the Pfaffian of a skew-symmetric matrix is a problem that arises in various fields of physics. Both computing the Pfaffian and a related problem, computing the canonical form of a skew-symmetric matrix under unitary congruence,…

Recently, the butterfly approximation scheme and hierarchical approximations have been proposed for the efficient computation of integral transforms with oscillatory and with asymptotically smooth kernels. Combining both approaches, we…