Anshul Adve

activity

20172021

collaborators

4 papers

math.CA2023

Density criteria for Fourier uniqueness phenomena in $R^{d}$

Anshul Adve

We show that if a closed discrete subset $A \subseteq R^{d}$ is denser than a certain critical threshold, then $A$ is a Fourier uniqueness set, while if $A$ is sparser, then…

math.CO2021

An efficient algorithm for deciding vanishing of Schubert polynomial coefficients

Anshul Adve, Colleen Robichaux, Alexander Yong

Schubert polynomials form a basis of all polynomials and appear in the study of cohomology rings of flag manifolds. The vanishing problem for Schubert polynomials asks if a coeffic…

math.CO2018

Computational complexity, Newton polytopes, and Schubert polynomials

Anshul Adve, Colleen Robichaux, Alexander Yong

The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneo…

math.CO2017

Symmetric group representations and Z

Anshul Adve, Alexander Yong

We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluatio…

Density criteria for Fourier uniqueness phenomena in Rd

An efficient algorithm for deciding vanishing of Schubert polynomial coefficients

Computational complexity, Newton polytopes, and Schubert polynomials

Symmetric group representations and Z

Density criteria for Fourier uniqueness phenomena in $R^{d}$