English
Related papers

Related papers: A Gel'fond type criterion in degree two

200 papers

Let $B$ be a bilinear form on pairs of points in the complex plane, of the form $B(p,q) = p^TMq$, for an invertible $2\times2$ complex matrix $M$. We prove that any finite set $S$ contained in an irreducible algebraic curve $C$ of degree…

Metric Geometry · Mathematics 2015-02-24 Claudiu Valculescu , Frank de Zeeuw

We derive an asymptotic formula which counts the number of abelian extensions of prime degrees over rational function fields. Specifically, let $\ell$ be a rational prime and $K$ a rational function field $\Bbb F_q(t)$ with $\ell \nmid q$.…

Number Theory · Mathematics 2015-09-07 Chih-Yun Chuang , Yen-Liang Kuan

We prove a complex polynomial of degree $n$ has at most $\lceil n/2 \rceil$ attractive fixed points lying on a line. We also consider the general case.

Numerical Analysis · Computer Science 2016-06-09 Terence Coelho , Bahman Kalantari

We present a short elementary proof of the well-known criterion for a cubic polynomial to have three real roots. The proof is based on Fermat's approach to calculus for polynomials. This approach illustrates the idea of a derivative…

History and Overview · Mathematics 2026-01-08 A. Skopenkov

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

Number Theory · Mathematics 2022-10-04 Artūras Dubickas , Min Sha

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

Logic in Computer Science · Computer Science 2023-05-23 Donghyun Lim , Martin Ziegler

Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

We determine the density of monic integer polynomials of given degree $n>1$ that have squarefree discriminant; in particular, we prove for the first time that the lower density of such polynomials is positive. Similarly, we prove that the…

Number Theory · Mathematics 2022-01-04 Manjul Bhargava , Arul Shankar , Xiaoheng Wang

In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…

Combinatorics · Mathematics 2015-06-10 Robert R. Lewis

Let F be a homogeneous real polynomial of even degree in any number of variables. We consider the problem of giving explicit conditions on the coefficients so that F is positive definite or positive semi-definite. In this note we produce a…

Algebraic Geometry · Mathematics 2007-05-23 Fernando Cukierman

Let F be a finite field of characteristic 2 and h be the element x^3+y^3+xyz of F[[x,y,z]]. In an earlier paper we made a precise conjecture as to the values of the colengths of the ideals (x^q,y^q,z^q,h^j) for q a power of 2. We also…

Commutative Algebra · Mathematics 2009-07-16 Paul Monsky

In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quadratic polynomials. Specifically, we prove that if…

Computational Geometry · Computer Science 2022-02-11 Shir Peleg , Amir Shpilka

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

Number Theory · Mathematics 2015-05-13 Damien Roy

We give an optimal necessary and sufficient condition for the quotient polynomial and remainder in the division algorithm to have positive coefficients.

Classical Analysis and ODEs · Mathematics 2013-08-15 Mark B. Villarino

The problem of expressing a multivariate polynomial as the determinant of a monic (definite) symmetric or Hermitian linear matrix polynomial (LMP) has drawn a huge amount of attention due to its connection with optimization problems. In…

Optimization and Control · Mathematics 2017-01-12 Papri Dey , Harish K. Pillai

We obtain general criteria for giving a lower bound on the degree of numbers of the form $\prod_{n=1}^\infty \left(1+\frac{b_n}{\alpha_n}\right)$ or of the form $\prod_{m=1}^\infty \left(1+ \sum_{n=1}^\infty…

Number Theory · Mathematics 2025-02-06 Simon Kristensen , Mathias Løkkegaard Laursen

For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…

Number Theory · Mathematics 2021-06-21 Olli Järviniemi

Let $V$ be the set of real common solutions to $F = (f_1, \ldots, f_s)$ in $\mathbb{R}[x_1, \ldots, x_n]$ and $D$ be the maximum total degree of the $f_i$'s. We design an algorithm which on input $F$ computes the dimension of $V$. Letting…

Symbolic Computation · Computer Science 2021-06-15 Piere Lairez , Mohab Safey El Din

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…

Commutative Algebra · Mathematics 2020-10-23 Jürgen Herzog , Takayuki Hibi , Somayeh Moradi

It is proven that for any representation over a field of characteristic 0 of the non-abelian semidirect product of a cyclic group of prime order p and the group of order 3 the corresponding algebra of polynomial invariants is generated by…

Representation Theory · Mathematics 2012-05-29 K. Cziszter