English
Related papers

Related papers: Decidability of polynomial equations over function…

200 papers

For a field $E$ of characteristic different from $2$ and cohomological $2$-dimension one, quadratic forms over the rational function field $E(X)$ are studied. A characterisation in terms of polynomials in $E[X]$ is obtained for having that…

Commutative Algebra · Mathematics 2021-07-16 Karim Johannes Becher , Parul Gupta

We use a function field analogue of a method of Selberg to derive an asymptotic formula for the number of (square-free) monic polynomials in $\mathbb{F}_q[X]$ of degree $n$ with precisely $k$ irreducible factors, in the limit as $n$ tends…

Number Theory · Mathematics 2020-01-08 Ardavan Afshar , Sam Porritt

We study the question of algebraic rank or transcendence degree preserving homomorphisms over finite fields. This concept was first introduced by Beecken, Mittmann and Saxena (2013), and exploited by them, and Agrawal, Saha, Saptharishi and…

Computational Complexity · Computer Science 2022-12-14 Prerona Chatterjee , Ramprasad Saptharishi

The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…

Symbolic Computation · Computer Science 2011-11-08 Guillaume Chèze

In this paper we obtain new quantitative forms of Hilbert's Irreducibility Theorem. In particular, we show that if $f(X, T_1, \ldots, T_s)$ is an irreducible polynomial with integer coefficients, having Galois group $G$ over the function…

Number Theory · Mathematics 2016-02-02 Abel Castillo , Rainer Dietmann

Whether the satisfiability of any formula F of propositional calculus can be determined in polynomial time is an open question. I propose a simple procedure based on some real world mechanisms to tackle this problem. The main result is the…

Logic in Computer Science · Computer Science 2010-01-20 Bernd R. Schuh

While the natural model-theoretic ranks available in differentially closed fields (of characteristic zero), namely Lascar and Morley rank, are known not to be definable in families of differential varieties; in this note we show that the…

Commutative Algebra · Mathematics 2018-06-07 James Freitag , Omar Leon Sanchez , Wei Li

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

Commutative Algebra · Mathematics 2016-01-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

Commutative Algebra · Mathematics 2016-12-07 Anuj Jakhar , Neeraj Sangwan

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

Number Theory · Mathematics 2021-09-23 Lucile Devin , Xianchang Meng

Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…

Algebraic Geometry · Mathematics 2021-04-06 Zbigniew Jelonek , Michał Lasoń

We prove the real non-attractive fixed point conjecture for complex polynomial and rational harmonic functions. A harmonic function $f=h+\overline{g}$ is polynomial (rational) if both $h$ and $g$ are polynomials (rational functions) of…

Complex Variables · Mathematics 2025-07-25 Mohd Vaseem

We characterize all linear operators on finite or infinite-dimensional spaces of univariate real polynomials preserving the sets of elliptic, positive, and non-negative polynomials, respectively. This is done by means of Fischer-Fock…

Classical Analysis and ODEs · Mathematics 2009-02-04 Julius Borcea

We study the problem of representing multivariate polynomials with rational coefficients, which are nonnegative and strictly positive on finite semialgebraic sets, using rational sums of squares. We focus on the case of finite semialgebraic…

Algebraic Geometry · Mathematics 2025-12-16 Lorenzo Baldi , Teresa Krick , Bernard Mourrain

Let $F$ be a finite field of $char F > 3$ and $sl_{2}(F)$ be the Lie algebra of traceless $2\times 2$ matrices over $F$. In this paper, we find a basis for the $\mathbb{Z}_{2}$-graded identities of $sl_{2}(F)$.

Rings and Algebras · Mathematics 2017-02-17 Luís Felipe Gonçalves Fonseca

We show that any positive characteristic tame Hahn field $\mathbb{F}((t^\Gamma))$ containing $t$ is decidable in $\mathcal{L}_t$, the language of valued fields with a constant symbol for $t$, if $\mathbb{F}$ and $\Gamma$ are decidable. In…

Logic · Mathematics 2023-12-29 Victor Lisinski

Consider a polynomial optimization problem. Adding polynomial equations generated by the Fritz John conditions to the constraint set does not change the optimal value. As proved in [arXiv:2205.04254 (2022)], the objective polynomial has…

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

We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…

Combinatorics · Mathematics 2018-06-15 Gregory J. Clark , Joshua N. Cooper

Let $n$ be a positive integer and $f_n(x)= 1+x+\frac{x^2}{2!}+\cdots + \frac{x^n}{n!}$ denote the $n$-th Taylor polynomial of the exponential function. Let $K = \mathbf{Q}(\theta)$ be an algebraic number field where $\theta$ is a root of…

Number Theory · Mathematics 2023-10-19 Anuj Jakhar , Srinivas Kotyada

We extend the famous diophantine Frobenius problem to the case of polynomials over a field $k$. Similar to the classical problem, we show that the $n=2$ case of the Frobenius problem for polynomials is easy to solve. In addition, we…

Number Theory · Mathematics 2014-09-16 Ricardo Conceição , Rodrigo Gondim , Miguel Rodriguez
‹ Prev 1 8 9 10 Next ›