Related papers: Covering shrinking polynomials by quasi progressio…
Let P_nk(x) denote the sum of the lowest k+1 terms in the expansion of (1+x)^n. We investigate the irreducibility of P_nk(x) and more general univariate polynomials related to it. Polynomials P_nk(x) naturally arise in Schubert calculus,…
Motivated by questions of Mulmuley and Stanley we investigate quasi-polynomials arising in formulas for plethysm. We demonstrate, on the examples of $S^3(S^k)$ and $S^k(S^3)$, that these need not be counting functions of inhomogeneous…
We study a class of combinatorial scheduling problems characterized by a particular type of constraint often associated with electrical power or gas energy. This constraint appears in several practical applications and is expressed as a sum…
We introduce a new basis for quasisymmetric functions, which arise from a specialization of nonsymmetric Macdonald polynomials to standard bases, also known as Demazure atoms. Our new basis is called the basis of quasisymmetric Schur…
In this paper we study universal quadratic polynomials which arise as sums of polygonal numbers. Specifically, we determine an asymptotic upper bound (as a function of $m$) on the size of the set $S_m\subset\mathbb{N}$ such that if a sum of…
Shor's factoring algorithm guarantees a success probability of at least one half for any fixed modulus N = pq with distinct primes p and q. We show that this guarantee does not extend to the asymptotic regime. As N -> infinity, the…
Let $S_n^{(2)}$ denote the iterated partial sums. That is, $S_n^{(2)}=S_1+S_2+ ... +S_n$, where $S_i=X_1+X_2+ ... s+X_i$. Assuming $X_1, X_2,....,X_n$ are integrable, zero-mean, i.i.d. random variables, we show that the persistence…
We construct approximate solutions to the time--dependent Schr\"odinger equation $i \hbar (\partial \psi)/(\partial t) = - (\hbar^2)/2 \Delta \psi + V \psi$ for small values of $\hbar$. If $V$ satisfies appropriate analyticity and growth…
In these short notes, we will show the following. Let F_q be a finite field and let E/\F_q be an elliptic curve. Let S_r be the rth summation/Semaev polynomial for E. Under an assumption, we show that it is NP-complete to check if S_r…
The aim of this note is to extend recent results of Yajima-Zhang \cite{Y-Z1, Y-Z2} on the 1/2- smoothing effect for Schr\"odinger equation with potential growing at infinity faster than quadratically.
We introduce two new bases of the ring of polynomials and study their relations to known bases. The first basis is the quasiLascoux basis, which is simultaneously both a $K$-theoretic deformation of the quasikey basis and also a lift of the…
We consider two quasi-exactly solvable problems in one dimension for which the Schr\"odinger equation can be converted to Heun's equation. We show that in neither case the Bender-Dunne polynomials form an orthogonal set. Using the…
A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…
By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…
This paper uses the theory of dual equivalence graphs to give explicit Schur expansions for several families of symmetric functions. We begin by giving a combinatorial definition of the modified Macdonald polynomials and modified…
In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for testing zeroness of $\Sigma^{[3]}\Pi\Sigma\Pi^{[2]}$…
We prove a conjecture of Liu and Wang on the q-log-convexity of the polynomial sequence $\{\sum_{k=0}^n{n\choose k}^2q^k\}_{n\geq 0}$. By using Pieri's rule and the Jacobi-Trudi identity for Schur functions, we obtain an expansion of a sum…
Quasi-Yamanouchi tableaux connect the two most studied types of tableaux. They are a subset of semistandard Young tableaux that are also a refinement on standard Young tableaux, and they can be used to improve the fundamental quasisymmetric…
We prove upper bounds for the error term of the distribution of squarefree numbers up to $X$ in arithmetic progressions modulo $q$ making progress towards two well-known conjectures concerning this distribution and improving upon earlier…
About twenty years ago the measure of smoothness $\omega ^r_\phi (f,t)$ was introduced and related to the rate of polynomial approximation. In this article we survey developments about this and related concepts since that time.