English
Related papers

Related papers: The maximum modulus set of a polynomial

200 papers

There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…

Geometric Topology · Mathematics 2021-04-16 Michael Dougherty , Jon McCammond

We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…

Computational Complexity · Computer Science 2011-02-01 Yann Strozecki

Many famous integer sequences including the Catalan numbers and the Motzkin numbers can be expressed in the form $ConstantTermOf\left[P(x)^nQ(x)\right]$ for Laurent polynomials $Q$, and symmetric Laurent trinomials $P$. In this paper we…

Combinatorics · Mathematics 2024-03-04 Nadav Kohen

We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…

Number Theory · Mathematics 2025-11-12 Przemysław Koprowski

We construct maximal $\Lambda(p)$-subsets on a large class of curved manifolds, in an optimal range of Lebesgue exponents $p$. Our arguments combine restriction estimates and decoupling with old and new probabilistic estimates.

Classical Analysis and ODEs · Mathematics 2024-11-08 Ciprian Demeter , Hongki Jung , Donggeun Ryou

A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We…

Bounds for $\max\{m,\tilde{m}\}$ subject to $m,\tilde{m} \in \mathbb{Z}\cap[1,p)$, $p$ prime, $z$ indivisible by $p$, $m\tilde{m}\equiv z\bmod p$ and $m$ belonging to some fixed Beatty sequence $\{ \lfloor n\alpha+\beta \rfloor :…

Number Theory · Mathematics 2023-06-05 Marc Technau

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

History and Overview · Mathematics 2022-02-03 Devendra Prasad

Let $\mathcal{M}(\mathbb{R}^n)$ be the class of functions $p:\mathbb{R}^n\to[1,\infty]$ bounded away from one and infinity and such that the Hardy-Littlewood maximal function is bounded on the variable Lebesgue space…

Classical Analysis and ODEs · Mathematics 2011-10-04 Alexei Yu. Karlovich , Ilya M. Spitkovsky

We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if…

Optimization and Control · Mathematics 2022-11-17 Jon Lee , Joseph Paat , Ingo Stallknecht , Luze Xu

We prove that for each fixed $m \ge 2$, there are only finitely many disjoint covering systems with minimum modulus at least $3$ in which precisely one modulus is repeated, namely the largest modulus, and it occurs exactly $m$ times.

Number Theory · Mathematics 2026-03-30 Yu Hashimoto

We find a new lower bound for the maximal number of zeros to harmonic polynomials, $p(z)+\overline{q(z)}$, when ${\rm deg}\, p = n$ and ${\rm deg}\, q = n-2$.

Complex Variables · Mathematics 2015-12-14 Seung-Yeop Lee , Andres Saez

In the first part of this paper we give a precise description of all the minimal decompositions of any bi-homogeneous polynomial $p$ (i.e. a partially symmetric tensor of $S^{d_1}V_1\otimes S^{d_2}V_2$ where $V_1,V_2$ are two complex,…

Algebraic Geometry · Mathematics 2016-06-14 Edoardo Ballico , Alessandra Bernardi

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

Number Theory · Mathematics 2014-01-28 Igor E. Shparlinski

We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…

Combinatorics · Mathematics 2014-03-06 William Kuszmaul

In this paper, we obtain some estimations of the saddle order which is the sole topological invariant of the non-integrable resonant saddles of planar polynomial vector fields of arbitrary degree $n$. Firstly, we prove that, for any given…

Classical Analysis and ODEs · Mathematics 2019-03-18 Guangfeng Dong , Changjian Liu , Jiazhong Yang

We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials $\Phi_N$ for any $N\geq1$. These polynomials vanish at pairs of $j$-invariants of elliptic curves linked by cyclic isogenies of degree…

Number Theory · Mathematics 2023-10-06 Florian Breuer , Fabien Pazuki

Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…

Number Theory · Mathematics 2023-08-28 Christian Elsholtz , Benjamin Klahn , Marc Technau

Let $p$ be a large prime, and let $k\ll \log p$. A new proof of the existence of any pattern of $k$ consecutive quadratic residues and quadratic nonresidues is introduced in this note. Further, an application to the least quadratic…

General Mathematics · Mathematics 2020-12-29 N. A. Carella

Let $G$ be a finite group and let $p$ be a prime. In this paper, we study the structure of finite groups with a large number of $p$-regular conjugacy classes or, equivalently, a large number of irreducible $p$-modular representations. We…

Group Theory · Mathematics 2023-12-19 Christopher A. Schroeder