English
Related papers

Related papers: A polynomial analogue of Jacobsthal function

200 papers

A thorough analysis of values of the function $m\mapsto\mbox{sn}(K(m)u\mid m)$ for complex parameter $m$ and $u\in (0,1)$ is given. First, it is proved that the absolute value of this function never exceeds 1 if $m$ does not belong to the…

Classical Analysis and ODEs · Mathematics 2016-06-01 Petr Siegl , František Štampach

Let $f,g_1,\dots,g_m$ be polynomials of degree at most $d$ with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Assume that $f$ is non-negative on a basic semi-algebraic set $S$ defined by polynomial inequalities $g_j(x)\ge…

Optimization and Control · Mathematics 2022-11-17 Ngoc Hoang Anh Mai

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…

Number Theory · Mathematics 2015-09-07 Shuntaro Yamagishi

Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…

Numerical Analysis · Mathematics 2020-01-17 Andrea Bonito , Ronald DeVore , Diane Guignard , Peter Jantsch , Guergana Petrova

Hal\'asz's Theorem gives an upper bound for the mean value of a multiplicative function $f$. The bound is sharp for general such $f$, and, in particular, it implies that a multiplicative function with $|f(n)|\le 1$ has either mean value…

Number Theory · Mathematics 2019-02-20 Andrew Granville , Adam J Harper , K. Soundararajan

We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function $g$ and an additive function $f$, we examine the size of the quantity $E(f,g;x)=\# \{n\leq x:f(n)=g(n)\}$. We establish a lower…

Number Theory · Mathematics 2017-06-28 Theophilus Agama

We study generalized Poincar\'e inequalities. We prove that if a function satisfies a suitable inequality of Poincar\'e type, then the Hardy-Littlewood maximal function also obeys a meaningful estimate of similar form. As a by-product, we…

Classical Analysis and ODEs · Mathematics 2021-02-23 Olli Saari

This paper deals with an analog of the Mahler volume product related to the ${\cal J}$ transform acting in the class of geometric convex functions ${\rm{Cvx}}_0({\mathbb R}^n)$. We provide asymptotically sharp bounds for the quantity…

Functional Analysis · Mathematics 2019-10-24 Dan I. Florentin , Alexander Segal

For every $m\in\mathbb{N}$, we establish the convergence of the averaged distributions of the zeros of the $m$-th order derivatives $(f^n)^{(m)}$ of the iterated polynomials $f^n$ of a polynomial $f\in\mathbb{C}[z]$ of degree $>1$ towards…

Dynamical Systems · Mathematics 2024-01-10 Yûsuke Okuyama

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…

Number Theory · Mathematics 2018-03-30 William Sawin , Mark Shusterman , Michael Stoll

Let $f$ be a polynomial with coefficients in the ring $O_S$ of $S$-integers of a number field $K$, $b$ a non-zero $S$-integer, and $m$ an integer $\ge 2$. We consider the equation $( \star )$: $f(x) = b y^m$ in $x,y \in O_S$. Under the…

Number Theory · Mathematics 2023-10-17 Attila Bérczes , Yann Bugeaud , Kálmán Győry , Jorge Mello , Alina Ostafe , Min Sha

We present a deterministic algorithm which computes the multilinear factors of multivariate lacunary polynomials over number fields. Its complexity is polynomial in $\ell^n$ where $\ell$ is the lacunary size of the input polynomial and $n$…

Symbolic Computation · Computer Science 2020-04-22 Arkadev Chattopadhyay , Bruno Grenet , Pascal Koiran , Natacha Portier , Yann Strozecki

The diagonal of a multivariate power series F is the univariate power series Diag(F) generated by the diagonal terms of F. Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and…

Symbolic Computation · Computer Science 2015-10-16 Alin Bostan , Louis Dumont , Bruno Salvy

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

Let $F(X)= \prod_{i=1}^k(a_iX+b_i)$ be a polynomial with $a_i, b_i$ being integers. Suppose the discriminant of $F$ is non-zero and $F$ is admissible. Given any natural number $N$, let $S(F,N)$ denotes those integers less than or equal to…

Number Theory · Mathematics 2014-04-01 Gyan Prakash

We study an analogue of a classical arithmetic problem over the ring of polynomials. We prove that $m = 5$ is the minimal number such that the sums of any two distinct polynomials in a set of $m$ polynomials over $\F_2[x]$ cannot all be of…

Number Theory · Mathematics 2026-02-16 Luis H. Gallardo

Let K be a field of characteristic p>0, and let q be a power of p. We determine all polynomials f in K[t]\K[t^p] of degree q(q-1)/2 such that the Galois group of f(t)-u over K(u) has a transitive normal subgroup isomorphic to PSL_2(q),…

Algebraic Geometry · Mathematics 2013-10-08 Robert M. Guralnick , Michael E. Zieve

We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…

Algebraic Geometry · Mathematics 2023-07-19 Andreas Gross , Trevor Gunn

Let $X\subset\mathbb{R}^n$ be a convex closed and semialgebraic set and let $f$ be a polynomial positive on $X$. We prove that there exists an exponent $N\geq 1$, such that for any $\xi\in\mathbb{R}^n$ the function…

Algebraic Geometry · Mathematics 2018-12-13 Krzysztof Kurdyka , Katarzyna Kuta , Stanisław Spodzieja

A \emph{quasi-polynomial} is a function defined of the form $q(k) = c_d(k) k^d + c_{d-1}(k) k^{d-1} + ... + c_0(k)$, where $c_0, c_1, ..., c_d$ are periodic functions in $k \in \Z$. Prominent examples of quasi-polynomials appear in…

Combinatorics · Mathematics 2008-03-03 Matthias Beck , Steven Sam , Kevin Woods
‹ Prev 1 8 9 10 Next ›