Related papers: Macdonald polynomials at t = 0 through twisted mul…
This work records the details of the Ram-Yip formula for nonsymmetric Macdonald-Koornwinder polynomials for the double affine Hecke algebras of not-necessarily-reduced affine root systems. It is shown that the t=0 equal-parameter…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
We extend the family non-symmetric Macdonald polynomials and define general-basement Macdonald polynomials. We show that these also satisfy a triangularity property with respect to the monomials bases and behave well under the…
We construct type A partially-symmetric Macdonald polynomials $P_{(\lambda \mid \gamma)}$, where $\lambda \in \mathbb{Z}_{\geq 0}^{n-k}$ is a partition and $\gamma \in \mathbb{Z}_{\geq 0}^k$ is a composition. These are polynomials which are…
We apply the bi-moment determinant method to compute a representation of the matrix product algebra -- a quadratic algebra satisfied by the operators $\mathbf{d}$ and $\mathbf{e}$ -- for the five parameter ($\alpha$, $\beta$, $\gamma$,…
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…
The dipole subtraction method for calculating next-to-leading order corrections in QCD was originally only formulated for massless partons. In this paper we extend its definition to include massive partons, namely quarks, squarks and…
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…
We describe a general technique that yields the first {\em Statistical Query lower bounds} for a range of fundamental high-dimensional learning problems involving Gaussian distributions. Our main results are for the problems of (1) learning…
In this paper we give Monk rules for Macdonald polynomials which are analogous to the Monk rules for Schubert polynomials. These formulas are similar to the formulas given by Baratta (2008), but our method of derivation is to use…
Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a…
Quasi-Monte Carlo (QMC) integration of output functionals of solutions of the diffusion problem with a log-normal random coefficient is considered. The random coefficient is assumed to be given by an exponential of a Gaussian random field…
In lattice quantum field theory studies, parameters defining the lattice theory must be tuned toward criticality to access continuum physics. Commonly used Markov chain Monte Carlo (MCMC) methods suffer from critical slowing down in this…
We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…
In this note we study the number of quantum queries required to identify an unknown multilinear polynomial of degree d in n variables over a finite field F_q. Any bounded-error classical algorithm for this task requires Omega(n^d) queries…
Coulomb collisions in particle simulations for weakly coupled plasmas are modeled by the Landau-Fokker-Planck equation, which is typically solved by Monte-Carlo (MC) methods. One of the main disadvantages of MC is the timestep accuracy…
We definitively establish that the theory of symmetric Macdonald polynomials aligns with quantum and affine Schubert calculus using a discovery that distinguished weak chains can be identified by chains in the strong (Bruhat) order poset on…
It is well known that quantum, randomized and deterministic (sequential) query complexities are polynomially related for total boolean functions. We find that significantly larger separations between the parallel generalizations of these…
We introduce difference operators on the space of symmetric functions which are a natural generalization of the $(q,t)$-Macdonald operators. In the $t\to\infty$ limit, they satisfy the $A_{N-1}$ quantum $Q$-system. We identify the elements…
We introduce a two-parameter deformation of the classical Poisson distribution from the viewpoint of noncommutative probability theory, by defining a $(q,t)$-Poisson type operator (random variable) on the $(q,t)$-Fock space \cite{Bl12} (See…