Search

For rational functions , where is a polynomial of degree at the most and , with we use simple but elegant techniques to strengthen generalizations of certain results which extend some widely known polynomial inequalities of Erdős-Lax and Turán to rational functions . In return these reinforced results, in the limiting case, lead to the corresponding refinements of the said polynomial inequalities. As an illustration and as an application of our results, we obtain some new improvements of the Erdős-Lax and Turán type inequalities for polynomials. These improved results take into account the size of the constant term and the leading coefficient of the given polynomial. As a further factor of consideration, during the course of this paper we will demonstrate how some recently obtained results could have been proved without invoking the results of Dubinin [Distortion theorems for polynomials on the circle, Sb. Math. 191(12) (2000) 1797–1807]. [ABSTRACT FROM AUTHOR]

This paper finds new quasi-polynomials over Z for the number p k (n) of partitions of n with parts at most k. Methods throughout are elementary. We derive a small number of polynomials (e.g., one for k = 3 , two for k = 4 or 5, six for k = 6 ) that, after addition of appropriate constant terms, take the value p k (n) . For example, for 0 ≤ r < 6 and for all q ≥ 0 , p 3 (6 q + r) = p 3 (r) + π 0 (q , r) , a polynomial of total degree 2 in q and r. In general there are M ⌊ k / 2 ⌋ = lcm { 1 , 2 , ... , ⌊ k / 2 ⌋ } such polynomials. In two variables q and s, they take the form ∑ a i , j q i s j with a i , j ∈ Z , which we call the proper form for an integer-valued polynomial. They constitute a quasi-polynomial of period M ⌊ k / 2 ⌋ for the sequence (p k (n) - p k (r)) with n ≡ r (mod M k) . For each k the terms of highest total degree are the same in all the polynomials and have coefficients dependent only on k. A second theorem, combining partial fractions and the above approach, finds hybrid polynomials over Q for p k (n) that are easier to determine than those above. We compare our results to those of Cayley, MacMahon, and Arkin, whose classical results, as recast here, stand up well. We also discuss recent results of Munagi and conclude that circulators in some form are inevitable. At k = 6 we find serious errors in Sylvester's calculation of his "waves." Sylvester JJ (Q J Pure Appl Math 1:141–152, 1855). The results are generalized to the (not very different) problem called "making change," where significant improvements to existing approaches are found. We find an infinitude of new congruences for p k (n) for k = 3 , 4 , and one new one for k = 5 . Reduced modulo m the periodic sequence (p k (n)) is investigated for periodicity and zeros: we find, from scratch, a simple proof of a known result in a special case. [ABSTRACT FROM AUTHOR]

In this paper, we consider a constructive proof of the termination of the normal form (NF) algorithm for multivariate polynomials, as well as the related concept of admissible ordering < on monomials. In classical mathematics, the well-quasiorder property of relation < is derived from Dickson's lemma, and this is sufficient to justify the termination of the NF algorithm. In provable programming based on constructive type theory (Coq and Agda), a somewhat stronger condition (in constructive mathematics) of the well-foundedness of the ordering (in its constructive version) is required. We propose a constructive proof of this theorem (T) for < , which is based on a known method that we refer to here as the "pattern method." This theorem on the well-foundedness of an arbitrary admissible ordering is also important in itself, independently of the NF algorithm. We are not aware of any other works on constructive proof of this theorem. However, it turns out that it follows, not very difficultly, from the results achieved by other researchers in 2003. We program this proof in the Agda language in the form of our library AdmissiblePPO-wellFounded of provable computational algebra programs. This development also uses the theorem to prove termination of the NF algorithm for polynomials. Thus, the library also contains a set of provable programs for polynomial algebra, which is significantly larger than that needed to prove Theorem T. [ABSTRACT FROM AUTHOR]

The aim of this paper is to fill in the gaps in the formulation and the proof of a theorem contained in the paper by K.Ozeki (Aequ Math 25:247–252, 1982) published in this journal. We also give a short proof of this theorem and use it to obtain certain information about the factorization of polynomials of the form f (x) - f (y) . [ABSTRACT FROM AUTHOR]

We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of unit-trace n × n PSD matrices, denoted by D, using at most N number of k × k PSD constraints?" In this paper, we prove lower bounds on N to achieve a good approximation of D by considering two constructions of an approximating set. First, we consider the unit-trace n × n symmetric matrices that are PSD when restricted to a fixed set of k-dimensional subspaces in R n . We prove that if this set is a good approximation of D, then the number of subspaces must be at least exponentially large in n for any k = o (n) . Second, we show that any set S that approximates D within a constant approximation ratio must have superpolynomial S + k -extension complexity. To be more precise, if S is a constant factor approximation of D, then S must have S + k -extension complexity at least exp (C · min { n , n / k }) where C is some absolute constant. In addition, we show that any set S such that D ⊆ S and the Gaussian width of S is at most a constant times larger than the Gaussian width of D must have S + k -extension complexity at least exp (C · min { n 1 / 3 , n / k }) . These results imply that the cone of n × n PSD matrices cannot be approximated by a polynomial number of k × k PSD constraints for any k = o (n / log 2 n) . These results generalize the recent work of Fawzi (Math Oper Res 46(4):1479–1489, 2021) on the hardness of polyhedral approximations of S + n , which corresponds to the special case with k = 1 . [ABSTRACT FROM AUTHOR]

The classical result of L. Székelyhidi states that (under some assumptions) every solution of a general linear equation must be a polynomial function. It is known that Székelyhidi's result may be generalized to equations where some occurrences of the unknown functions are multiplied by a linear combination of the variables. In this paper we study the equations where two such combinations appear. The simplest nontrivial example of such a case is given by the equation F (x + y) - F (x) - F (y) = y f (x) + x f (y) considered by Fechner and Gselmann (Publ Math Debrecen 80(1–2):143–154, 2012). In the present paper we prove several results concerning the systematic approach to the generalizations of this equation. [ABSTRACT FROM AUTHOR]

We examine the family of all (at most) three-point symmetric quadratures on [ - 1 , 1 ] which are exact on polynomials of order 3 to find all possible inequalities between them in the class of 3-convex functions. Next we optimise them by using convex combinations of the quadratures considered. We find the optimal quadrature and use it to construct the adaptive method of approximate integration. An effective method to estimate the error of this method is also given. It needs a considerably fewer number of subdivisions of the interval of integration than the classical adaptive methods as well as the method developed by the second-named author in his recent paper (Wa̧sowicz in Aequ Math 94(5):887–898, 2020). [ABSTRACT FROM AUTHOR]

We propose a doubly nonnegative (DNN) relaxation for polynomial optimization problems (POPs) with binary and box constraints. This work is an extension of the work by Kim, Kojima and Toh in 2016 from quadratic optimization problems to POPs. The dense and sparse DNN relaxations are reduced to a simple conic optimization problem (COP) to which an accelerated bisection and projection (BP) algorithm is applied. The COP involves a single equality constraint in a matrix variable which is restricted to the intersection of the positive semidefinite cone and a polyhedral cone representing the algebraic properties of binary and box constraints as well as the sparsity structure of the objective polynomial. Our DNN relaxation serves as a variant of the Lasserre moment-SOS hierarchy of relaxations for binary and box constrained POPs when the size of the cones is gradually increased to compute tighter lower bounds for their optimal values. A significant part of the paper is devoted to deriving and analyzing a class of polyhedral cones to strengthen the DNN relaxation, and the design of efficient computation of the metric projections onto these cones in the accelerated BP algorithm. Numerical results on various POPs are available in Ito et al. (ACM Trans Math Softw 45, Article 34, 2019). [ABSTRACT FROM AUTHOR]

The aim of this paper is to prove that Markov's theorem on variation of zeros of orthogonal polynomials on the real line (Markoff in Math Ann 27:177–182, 1886) remains essentially valid in the case of paraorthogonal polynomials on the unit circle. [ABSTRACT FROM AUTHOR]

In the theory of orthogonal polynomials, as well as in its intersection with harmonic analysis, it is an important problem to decide whether a given orthogonal polynomial sequence (P n (x)) n ∈ N 0 satisfies nonnegative linearization of products, i.e., the product of any two P m (x) , P n (x) is a conical combination of the polynomials P | m - n | (x) , ... , P m + n (x) . Since the coefficients in the arising expansions are often of cumbersome structure or not explicitly available, such considerations are generally very nontrivial. Gasper (Can J Math 22:582–593, 1970) was able to determine the set V of all pairs (α , β) ∈ (- 1 , ∞) 2 for which the corresponding Jacobi polynomials (R n (α , β) (x)) n ∈ N 0 , normalized by R n (α , β) (1) ≡ 1 , satisfy nonnegative linearization of products. Szwarc (Inzell Lectures on Orthogonal Polynomials, Adv. Theory Spec. Funct. Orthogonal Polynomials, vol 2, Nova Sci. Publ., Hauppauge, NY pp 103–139, 2005) asked to solve the analogous problem for the generalized Chebyshev polynomials (T n (α , β) (x)) n ∈ N 0 , which are the quadratic transformations of the Jacobi polynomials and orthogonal w.r.t. the measure (1 - x 2) α | x | 2 β + 1 χ (- 1 , 1) (x) d x . In this paper, we give the solution and show that (T n (α , β) (x)) n ∈ N 0 satisfies nonnegative linearization of products if and only if (α , β) ∈ V , so the generalized Chebyshev polynomials share this property with the Jacobi polynomials. Moreover, we reconsider the Jacobi polynomials themselves, simplify Gasper's original proof and characterize strict positivity of the linearization coefficients. Our results can also be regarded as sharpenings of Gasper's one. [ABSTRACT FROM AUTHOR]