Related papers: Covering shrinking polynomials by quasi progressio…

We study a variant of the majorization relation. In particular we consider inequalities involving some Schur-concave symmetric polynomials related to the multinomial expansion. We also discuss how these topics were motivated by conjectures…

The Rogers-Szeg\"o polynomials are natural q-analogues of Newton binomials. In general they have no closed expression. We consider some exceptional cases which are products of a factor with a closed formula and another one with nice values…

Let $\mathcal{C}=(\mathcal{C},\mathbb{E},\mathfrak{s})$ be an extriangulated category with a proper class $\xi$ of $\mathbb{E}$-triangles. In this paper, we introduce and study quasi-resolving subcategories in $\mathcal{C}$. More precisely,…

The moment-sum-of-squares (moment-SOS) hierarchy is one of the most celebrated and widely applied methods for approximating the minimum of an n-variate polynomial over a feasible region defined by polynomial (in)equalities. A key feature of…

Let $S$ be a subset of $\{1,\ldots,N\}$ avoiding the nontrivial progressions $x, x+y^2-1, x+ 2(y^2-1)$. We prove that $|S|\ll N/\log_m{N}$, where $\log_m $ is the $m$-fold iterated logarithm and $m\in\mathbf{N}$ is an absolute constant.…

Let $\mu(t) = \sum_{\tau\in S} \alpha_\tau \delta(t-\tau)$ denote an $|S|$-atomic measure defined on $[0,1]$, satisfying $\min_{\tau\neq \tau'}|\tau - \tau'|\geq |S|\cdot n^{-1}$. Let $\eta(\theta) = \sum_{\tau\in S} a_\tau D_n(\theta -…

The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that…

A polynomial that is nonnegative need not be a sum of squares of polynomials. This classical gap, identified by Hilbert in 1888, lies at the heart of why the global optimization of multivariate quartic polynomials is NP-hard. Yet we show…

A set of functions is introduced which generalizes the famous Schur polynomials and their connection to Grasmannian manifolds. These functions are shown to provide a new method of constructing solutions to the KP hierarchy of nonlinear…

We extend the best known bound on the largest subset of {1,2,...,N} with no square differences to the largest possible class of quadratic polynomials.

Define a natural number $n$ as a \textit{square-full} integer if for every prime $p$ such that $p|n$, we have $p^2|n$. In this paper, we establish an upper bound on the variance of square-full integers in short intervals of an expected…

In this paper we extend some results obtained by Artamonov and Sabitov for quantum polynomials to skew quantum polynomials and quasi-commutative bijective skew PBW extensions. Moreover, we find a counterexample to the conjecture proposed in…

The volume conjecture and its generalizations say that the colored Jones polynomial corresponding to the N-dimensional irreducible representation of sl(2;C) of a (hyperbolic) knot evaluated at exp(c/N) grows exponentially with respect to N…

We show that the existence of exceptional polynomials leads to the presence of non-trivial supersymmetry. The existence of these polynomials reveals several distinct isospectral potentials for the Schr\"odinger equation. All Schr\"odinger…

The goal of the paper is two-fold. At first, we attempt to give a survey of some recent applications of symmetric polynomials and divided differences to intersection theory. We discuss: polynomials universally supported on degeneracy loci;…

We study infinite series expansions for the Riemann xi function $\Xi(t)$ in three specific families of orthogonal polynomials: (1) the Hermite polynomials; (2) the symmetric Meixner-Pollaczek polynomials $P_n^{(3/4)}(x;\pi/2)$; and (3) the…

We prove that the set of large values of the trigonometric polynomial over a subset of density of the primes has some additive structure, similarly to what happens for subsets of densities in $\mathbb{Z}/{N}\mathbb{Z}$ but in a weaker form.…

We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…

We study the computational complexity of approximating the 2->q norm of linear operators (defined as ||A||_{2->q} = sup_v ||Av||_q/||v||_2), as well as connections between this question and issues arising in quantum information theory and…

We introduce the quasi-key basis of the polynomial ring. We prove this basis contains the quasi-Schur polynomials of of Haglund, Luoto, Mason and van Willigenburg and that stable limits of quasi-key polynomials are quasi-Schur functions,…