English
Related papers

Related papers: Rational degree is polynomially related to degree

200 papers

We prove a stronger version of a criterion of rationality given by Ionescu and Russo. We use this stronger version to define an invariant for rational varieties (we call it rationality degree), and we classify rational varieties for small…

Algebraic Geometry · Mathematics 2015-09-24 Davide Fusi

Let $F(x, y)$ be a binary form with integer coefficients, degree $n\geq 3$ and irreducible over the rationals. Suppose that only $s + 1$ of the $n + 1$ coefficients of $F$ are nonzero. We show that the Thue inequality $|F(x,y)|\leq m$ has…

Number Theory · Mathematics 2020-08-26 Paloma Bengoechea

We prove that a geometrically integral smooth 3-fold $X$ with nef anti-canonical class and negative Kodaira dimension over a finite field $\mathbb{F}_q$ of characteristic $p>5$ and cardinality $q=p^e > 19$ has a rational point.…

Algebraic Geometry · Mathematics 2025-02-04 Fabio Bernasconi , Stefano Filipazzi

For each integer $s\geq 1$, we present a family of curves that are $\mathbb{F}_q$-Frobenius nonclassical with respect to the linear system of plane curves of degree s. In the case $s = 2$, we give necessary and sufficient conditions for…

Algebraic Geometry · Mathematics 2014-10-01 Nazar Arakelian , Herivelto Borges

The multiplicity (resp. degree) of a function $f$ relative to a semianalytic subset $S$ of $\mathbb{R}^n$ is the greatest (resp. smallest) exponent among numbers $j$ such that the inequality $|f(x)|\leq C\|x\|^j$ holds on $S$ near $0$…

Algebraic Geometry · Mathematics 2019-10-14 Vincent Grandjean , Maria Michalska

The Schm\"udgen's Positivstellensatz gives a certificate to verify positivity of a strictly positive polynomial $f$ on a compact, basic, semi-algebraic set $\mathbf{K} \subset \mathbb{R}^n$. A Positivstellensatz of this type is called…

Optimization and Control · Mathematics 2024-12-19 Etienne de Klerk , Juan Vera Lizcano

We answer an open question in the theory of transducer degrees initially posed in [3], on the structure of polynomial transducer degrees, in particular the question of what degrees, if any, lie below the degree of $n^3$. Transducer degrees…

Formal Languages and Automata Theory · Computer Science 2021-11-15 Noah Kaufmann

We first recall the connection, going back to A. Thue, between rational approximation to algebraic numbers and integer solutions of some Diophantine equations. Next we recall the equivalence between several finiteness results on various…

Number Theory · Mathematics 2013-12-30 Claude Levesque , Michel Waldschmidt

We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).

Number Theory · Mathematics 2014-02-26 Yann Bugeaud , Andrej Dujella

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

Number Theory · Mathematics 2022-10-11 Jean Kieffer

We define the excess degree $\xi(P)$ of a $d$-polytope $P$ as $2f_1-df_0$, where $f_0$ and $f_1$ denote the number of vertices and edges, respectively. This parameter measures how much $P$ deviates from being simple. It turns out that the…

Combinatorics · Mathematics 2018-02-16 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

Let f be a G-function (in the sense of Siegel), and x be an algebraic number; assume that the value f(x) is a real number. As a special case of a more general result, we show that f(x) can be written as g(1), where g is a G-function with…

Number Theory · Mathematics 2011-06-23 Stéphane Fischler , Tanguy Rivoal

In this note, we give a short, simple and almost completely self contained proof of a classical result of Kaltofen [Kal86, Kal87, Kal89] which shows that if an $n$ variate degree $d$ polynomial $f$ can be computed by an arithmetic circuit…

Computational Complexity · Computer Science 2019-04-22 Chi-Ning Chou , Mrinal Kumar , Noam Solomon

We prove that the most natural low-degree test for polynomials over finite fields is ``robust'' in the high-error regime for linear-sized fields. Specifically we consider the ``local'' agreement of a function $f: \mathbb{F}_q^m \to…

Computational Complexity · Computer Science 2023-11-22 Prahladh Harsha , Mrinal Kumar , Ramprasad Saptharishi , Madhu Sudan

Let $k$ be a number field, $f(x)\in k[x]$ a polynomial over $k$ with $f(0)\neq 0$, and $\O_{k,S}^*$ the group of $S$-units of $k$, where $S$ is an appropriate finite set of places of $k$. In this note, we prove that outside of some natural…

Number Theory · Mathematics 2011-06-08 Aaron Levin , David McKinnon

We show that if $F(s)$ is a nondegenerate ordinary Dirichlet series with nonnegative coefficients and $F(k)$ is a rational number for all large enough positive integers $k$, then the denominators of those rational numbers are unbounded. In…

Number Theory · Mathematics 2014-04-11 Michael Coons , Daniel Sutherland

Given a polynomial system $\mathcal{F}$ over a finite field $k$ which is not necessarily of dimension zero, we consider the Weil descent $\mathcal{F}'$ of $\mathcal{F}$ over a subfield $k'$. We prove a theorem which relates the last fall…

Algebraic Geometry · Mathematics 2021-03-15 Ming-Deh Huang

Let X be the graph in the plane of a pfaffian function f (in the sense of Khovanskii). Suppose X is not algebraic. This note gives an upper bound for the number of rational points on X of height up to X. The bound is uniform in the order…

Number Theory · Mathematics 2007-05-23 Jonathan Pila

A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…

General Mathematics · Mathematics 2011-12-23 Joseph W. Norman

We study a problem of Jeong and Taniguchi asking to find all rational maps which are Ahlfors functions. We prove that the rational Ahlfors functions of degree two are characterized by having positive residues at their poles. We then show…

Complex Variables · Mathematics 2015-12-17 Maxime Fortier Bourque , Malik Younsi
‹ Prev 1 8 9 10 Next ›