English
Related papers

Related papers: Quotient polynomials with positive coefficients

200 papers

Schubert coefficients $c_{u,v}^w$ are structure constants describing multiplication of Schubert polynomials. Deciding positivity of Schubert coefficients is a major open problem in Algebraic Combinatorics. We prove a positive rule for this…

Combinatorics · Mathematics 2024-12-30 Igor Pak , Colleen Robichaux

Quantum signal processing is a framework for implementing polynomial functions on quantum computers. To implement a given polynomial $P$, one must first construct a corresponding complementary polynomial $Q$. Existing approaches to this…

Quantum Physics · Physics 2025-06-16 Bjorn K. Berntson , Christoph Sünderhauf

It is an open question whether the fractional parts of nonlinear polynomials at integers have the same fine-scale statistics as a Poisson point process. Most results towards an affirmative answer have so far been restricted to almost sure…

Number Theory · Mathematics 2019-02-20 Jens Marklof , Nadav Yesha

If the coefficients of polynomials are selected by some random process, the zeros of the resulting polynomials are in some sense random. In this paper the author rephrases the above in more precise language, and calculates the joint…

Probability · Mathematics 2012-11-26 Kerry M. Soileau

We establish an analogue of the Goldbach conjecture for Laurent polynomials with positive integer coefficients.

Number Theory · Mathematics 2023-12-05 Sophia Liao , Harold Polo

We consider systems of ordinary differential equations with quadratic homogeneous right hand side. We give a new simple proof of a result already obtained in [8,10] which gives the necessary conditions for the existence of polynomial first…

Dynamical Systems · Mathematics 2009-10-31 Alexei Tsygvintsev

We obtain divisibility conditions on the multiplicative orders of elements of the form $\zeta + \zeta^{-1}$ in a finite field by exploiting a link to the arithmetic of real quadratic fields.

Number Theory · Mathematics 2020-06-19 Florian Breuer

We calculate the zeros of an exponential polynomial of some variables by a classical algorithm and quantum algorithms which are based on the method of van Dam and Shparlinski, they treated the case of two variables, and compare with the…

Quantum Physics · Physics 2009-08-13 Yoshitaka Sasaki

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

Optimization and Control · Mathematics 2017-01-03 Jesús A. De Loera , Raymond Hemmecke , Matthias Köppe , Robert Weismantel

We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of R^k, assuming that P is positive on the simplex. This bound depends only on the number…

Algebraic Geometry · Mathematics 2009-06-25 Gabriela Jeronimo , Daniel Perrucci

We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…

Quantum Physics · Physics 2021-12-16 Farid Shahandeh

We estimate the number of primes represented by a general quadratic polynomial with discriminant $\Delta$, assuming that the corresponding real character is exceptional.

Number Theory · Mathematics 2020-11-12 Fernando Chamizo , Jorge Jiménez Urroz

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

Number Theory · Mathematics 2019-01-25 Fabián Arias , Jerson Borja , Luis Rubio

We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…

Optimization and Control · Mathematics 2021-10-05 Alexander Barvinok , Mark Rudelson

Let $f$, $p$, and $q$ be Laurent polynomials with integer coefficients in one or several variables, and suppose that $f$ divides $p+q$. We establish sufficient conditions to guarantee that $f$ individually divides $p$ and $q$. These…

Dynamical Systems · Mathematics 2024-04-16 Douglas Lind , Klaus Schmidt

Goulden-Rattan polynomials give the exact value of the subdominant part of the normalized characters of the symmetric groups in terms of certain quantities ($C_i$) which describe the macroscopic shape of the Young diagram. The…

Combinatorics · Mathematics 2022-06-01 Mikołaj Marciniak

Systems of orthogonal polynomials whose recurrence coefficients tend to infinity are considered. A summability condition is imposed on the coefficients and the consequences for the measure of orthogonality are discussed. Also discussed are…

Classical Analysis and ODEs · Mathematics 2014-08-28 A. I. Aptekarev , J. S. Geronimo

This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation…

Number Theory · Mathematics 2007-05-23 Shujun Li

In this paper we study the conditions, under which the quaternionic Riccati equations have periodic solutions. The obtained result we compare with one recently obtained important one.

Classical Analysis and ODEs · Mathematics 2022-06-06 G. A. Grigorian

We present quasi-diagonal preconditioners for piecewise polynomial discretizations of pseudodifferential operators of order minus two in any space dimension. Here, quasi-diagonal means diagonal up to a sparse transformation. Considering…

Numerical Analysis · Mathematics 2018-06-22 Thomas Führer , Norbert Heuer
‹ Prev 1 8 9 10 Next ›