English
Related papers

Related papers: Inequalities for rational functions with prescribe…

200 papers

New classes of generalized Nevanlinna functions, which under multiplication with an arbitrary fixed symmetric rational function remain generalized Nevanlinna functions, are introduced. Characterizations for these classes of functions are…

Functional Analysis · Mathematics 2013-12-30 S. Hassi , H. L. Wietsma

Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…

Numerical Analysis · Mathematics 2025-10-03 James Chok , Geoffrey M. Vasil

We extend Polyak's theorem on the convexity of joint numerical range from three to any number of quadratic forms on condition that they can be generated by three quadratic forms with a positive definite linear combination. Our new result…

Optimization and Control · Mathematics 2021-08-20 Mengmeng Song , Yong Xia

We propose a formula for finding the horizontal, oblique or curvilinear asymptote of any rational polynomial function of any positive degree, as a sum of matrix determinants formed directly from the coefficients of the terms in the given…

General Mathematics · Mathematics 2021-04-14 Lam Mason , Asterios Skodras

We generalize several classical theorems in extremal combinatorics by replacing a global constraint with an inequality which holds for all objects in a given class. In particular we obtain generalizations of Tur\'an's theorem, the…

Combinatorics · Mathematics 2022-05-30 David Malec , Casey Tompkins

The main result of this paper supports a conjecture by C. P\'erez and E. Rela about a very recent result of theirs on self-improving theory. Also, we extend the conclusions of their theorem to the range $p<1$. As an application of our…

Classical Analysis and ODEs · Mathematics 2019-07-30 Javier C. Martínez-Perales

We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…

Combinatorics · Mathematics 2014-02-26 Boris Bukh , Jacob Tsimerman

We obtain an improvement and broad generalisation of a result of N. Ailon and Z. Rudnick (2004) on common zeros of shifted powers of polynomials. Our approach is based on reducing this question to a more general question of counting…

Number Theory · Mathematics 2018-05-18 Fedor Pakovich , Igor E. Shparlinski

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

Numerical Analysis · Mathematics 2025-06-27 Kingsley Yeon , Steven B. Damelin

We demonstrate that solving the classical problems mentioned in the title on quadrature domains when the given boundary data is rational is as simple as the method of partial fractions. A by-product of our considerations will be a simple…

Complex Variables · Mathematics 2013-11-27 Steven R. Bell

Originally, Tur\'{a}n's inequality states that if $(P_n(x))_{n\in\mathbb{N}_0}$ is the sequence of Legendre polynomials, then $\Delta_n(x):=P_n^2(x)-P_{n+1}(x)P_{n-1}(x)\geq0$ for all $n\in\mathbb{N}$ and $x\in[-1,1]$. Gasper specified the…

Classical Analysis and ODEs · Mathematics 2026-05-07 Stefan Kahler

Proving super-polynomial lower bounds on the size of proofs of unsatisfiability of Boolean formulas using resolution over parities is an outstanding problem that has received a lot of attention after its introduction by Raz and Tzamaret…

Computational Complexity · Computer Science 2024-02-26 Sreejata Kishor Bhattacharya , Arkadev Chattopadhyay , Pavel Dvořák

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.…

Number Theory · Mathematics 2025-01-10 Olivier Ramaré

Conical zeta values associated with rational convex polyhedral cones generalise multiple zeta values. We renormalise conical zeta values at poles by means of a generalisation of Connes and Kreimer's Algebraic Birkhoff Factorisation. This…

Mathematical Physics · Physics 2017-12-19 Li Guo , Sylvie Paycha , Bin Zhang

The motivation of this paper is the development of an optimisation method for solving optimisation problems appearing in Chebyshev rational and generalised rational approximation problems, where the approximations are constructed as ratios…

Optimization and Control · Mathematics 2020-11-06 R. Díaz Millán , Nadezda Sukhorukova , Julien Ugon

In this paper we deal with composite rational functions having zeros and poles forming consecutive elements of an arithmetic progression. We also correct a result published earlier related to composite rational functions having a fixed…

Number Theory · Mathematics 2017-03-16 Szabolcs Tengely

We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…

Classical Analysis and ODEs · Mathematics 2016-02-17 Yurii Kolomoitsev , Tetiana Lomako , Jürgen Prestin

In this article we obtain new irrationality measures for values of functions which belong to a certain class of hypergeometric functions including shifted logarithmic functions, binomial functions and shifted exponential functions. We…

Number Theory · Mathematics 2023-10-12 Makoto Kawashima , Anthony Poëls

We provide new upper bounds for sums of certain arithmetic functions in many variables at polynomial arguments and, exploiting recent progress on the mean-value of the Erd\H os-Hooley $\Delta$-function, we derive lower bounds for the…

Number Theory · Mathematics 2026-01-14 Régis de la Bretèche , Gérald Tenenbaum

The main theme of this dissertation is the study of the lattice points in a rational convex polyhedron and their encoding in terms of Barvinok's short rational functions. The first part of this thesis looks into theoretical applications of…

Combinatorics · Mathematics 2007-06-13 Ruriko Yoshida