English
Related papers

Related papers: Additive Complexity and the Roots of Polynomials O…

200 papers

For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without…

Number Theory · Mathematics 2022-09-09 Joachim König , Danny Neftin

Let $f(x)=(x^{k}+c)^{m}-ax^{n}\in\mathbb{Z}[x]$ be an irreducible polynomial over $\mathbb{Q}$, where $k,m,n\in\mathbb{N}$ with $km>n$, and let $K=\mathbb{Q}(\theta)$, where $\theta$ is a root of $f(x)$. We investigate the arithmetic…

Number Theory · Mathematics 2026-02-24 Rupam Barman , Anuj Jakhar , Ravi Kalwaniya , Prabhakar Yadav

In this brief note, we consider p-adic unit roots or poles of L-functions of exponential sums defined over finite fields. In particular, we look at the number of unit roots or poles, and a congruence relation on the units. This raises a…

Number Theory · Mathematics 2015-01-16 C. Douglas Haessig

Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa arises naturally when controlling linear differential equations. As a function of the polynomial coefficients, the abscissa is H{\"o}lder…

Optimization and Control · Mathematics 2015-07-31 Roxana Heß , Didier Henrion , Jean-Bernard Lasserre , Tien Son Pham

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

Algebraic Geometry · Mathematics 2007-05-23 J. Maurice Rojas

It is well known that sin(a\pi/b), cos(a\pi/b), etc., are only rational numbers for a few select integers a and b. We show that this is equivalent to the fact that only for d = 1,2,3,4, and 6 is the primitive dth root of unity of degree 2…

History and Overview · Mathematics 2009-09-01 Gregory P. Dresden

We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…

Classical Analysis and ODEs · Mathematics 2021-01-12 Codruţ Grosu , Corina Grosu

We show that if $A$ is a finite set of non-negative integers then the number of zeros of the function \[ f_A(\theta) = \sum_{a \in A} \cos(a\theta), \] in $[0,2\pi]$, is at least $(\log \log \log |A|)^{1/2-\varepsilon}$. This gives the…

Classical Analysis and ODEs · Mathematics 2019-02-07 Julian Sahasrabudhe

Given an integer $t\ge 1$, a rational number $g$ and a prime $p\equiv 1({\rm mod} t)$ we say that $g$ is a near-primitive root of index $t$ if $\nu_p(g)=0$, and $g$ is of order $(p-1)/t$ modulo $p$. In the case $g$ is not minus a square we…

Number Theory · Mathematics 2020-08-27 Pieter Moree

The concept of a skew root of a skew polynomial is used to introduce notions of algebraic closedness for $\sigma$-fields, that is, a field equipped with an endomorphism. It is shown that every $\sigma$-field can be embedded in algebraically…

Rings and Algebras · Mathematics 2025-11-11 Masood Aryapoor

Let $x \geq 1$ be a large number, let $f(x) \in \mathbb{Z}[x]$ be a prime polynomial of degree $\text{deg}(f)=m$, and let $u\ne \pm 1, v^2$ be a fixed integer. Assuming the Bateman-Horn conjecture, an asymptotic counting function for the…

General Mathematics · Mathematics 2017-06-20 N. A. Carella

In 2021, Marco Besier and the first author introduced the concept of rationalizability of square roots to simplify arguments of Feynman integrals. In this work, we generalize the definition of rationalizability to field extensions. We then…

Commutative Algebra · Mathematics 2022-05-16 Dino Festi , Andreas Hochenegger

We compute the precise leading asymptotics of the variance of the number of real roots for a large class of random polynomials, where the random coefficients have polynomial growth. Our results apply to many classical ensembles, including…

Probability · Mathematics 2025-08-01 Yen Q. Do , Nhan D. V. Nguyen

In this note, we extend the result of \cite{PoulyG16} about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in…

Computational Complexity · Computer Science 2016-08-02 Amaury Pouly

We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…

Symbolic Computation · Computer Science 2010-11-12 Angelos Mantzaflaris , Bernard Mourrain , Elias P. P. Tsigaridas

Bernstein-Sato polynomial of a hypersurface is an important object with numerous applications. It is known, that it is complicated to obtain it computationally, as a number of open questions and challenges indicate. In this paper we propose…

Algebraic Geometry · Mathematics 2010-03-22 Viktor Levandovskyy , Jorge Martín-Morales

We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…

Complex Variables · Mathematics 2021-06-14 Kirill Lazebnik , Nikolai G. Makarov , Sabyasachi Mukherjee

This paper is concerned with certifying that a given point is near an exact root of an overdetermined or singular polynomial system with rational coefficients. The difficulty lies in the fact that consistency of overdetermined systems is…

Symbolic Computation · Computer Science 2014-08-13 Tulay Ayyildiz Akoglu , Jonathan D. Hauenstein , Agnes Szanto

We show that a real homogeneous polynomial f(x,y) with distinct roots and degree d greater or equal than 3 has d real roots if and only if for any (a,b) not equal to (0,0) the polynomial af_x+bf_y has d-1 real roots. This answers to a…

Algebraic Geometry · Mathematics 2010-06-29 Antonio Causa , Riccardo Re

We call the \emph{$p$-fundamental string} of a complex simple Lie algebra to the sequence of irreducible representations having highest weights of the form $k\omega_1+\omega_p$ for $k\geq0$, where $\omega_j$ denotes the $j$-th fundamental…

Representation Theory · Mathematics 2017-12-01 Emilio A. Lauret , Fiorela Rossi Bertone
‹ Prev 1 8 9 10 Next ›