中文
相关论文

相关论文: Finiteness for Arithmetic Fewnomial Systems

200 篇论文

We consider positive solutions to parametrized systems of generalized polynomial equations (with real exponents and positive parameters). By a fundamental result obtained in parallel work, polynomial systems are determined by geometric…

代数几何 · 数学 2024-10-07 Stefan Müller , Georg Regensburger

We give conditions on a finite set of series of rational numbers to ensure that they are algebraically independent. Specialising our results to polynomials of lower degree, we also obtain new results on irrationality and $mathbb{Q}$-linear…

数论 · 数学 2025-02-27 Jaroslav Hancl , Mathias L. Laursen , Simon Kristensen

We give a global version of Le-Ramanujam mu-constant theorem for polynomials. Let f_t, (t in [0,1]), be a family of polynomials of n complex variables with isolated singularities, whose coefficients are polynomials in t. We consider the…

代数几何 · 数学 2007-05-23 Arnaud Bodin

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

数论 · 数学 2025-06-23 Luca Bastioni , Giacomo Micheli , Shujun Zhao

We opt to study the convergence of maximal real roots of certain Fibonacci-type polynomials given by $G_n=x^kG_{n-1}+G_{n-2}$. The special cases $k=1$ and $k=2$ are found in [4] and [7], respectively.

数论 · 数学 2008-12-16 Tewodros Amdeberhan

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

符号计算 · 计算机科学 2025-02-10 Nicolas Faroß , Thomas Sturm

Let $A_g$ be an abelian variety of dimension $g$ and $p$-rank $\lambda \leq 1$ over an algebraically closed field of characteristic $p>0$. We compute the number of homomorphisms from $\pi_1^{\text{\'et}}(A_g,a)$ to $GL_n(\mathbb F_q)$,…

代数几何 · 数学 2018-06-22 Brett Frankel

An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…

离散数学 · 计算机科学 2022-03-08 Ron Yosef , Matan Mizrachi , Ohr Kadrawi

An independent set in a graph is a set of pairwise non-adjacent vertices. Let $\alpha(G)$ denote the cardinality of a maximum independent set in the graph $G = (V, E)$. Gutman and Harary defined the independence polynomial of $G$ \[ I(G;x)…

组合数学 · 数学 2022-01-04 Ohr Kadrawi , Vadim E. Levit , Ron Yosef , Matan Mizrachi

Let G be a simple, simply connected algebraic group defined over an algebraically closed field k of positive characteristic p. Let \sigma:G->G be a strict endomorphism (i. e., the subgroup G(\sigma) of \sigma-fixed points is finite). Also,…

Let $f\in\mathbb{Z}[X]$ be quadratic or cubic polynomial. We prove that there exists an integer $G_f\geq 2$ such that for every integer $k\geq G_f$ one can find infinitely many integers $n\geq 0$ with the property that none of…

数论 · 数学 2017-08-24 Carlo Sanna , Márton Szikszai

We show that, apart from some obvious exceptions, the number of trinomials vanishing at given complex numbers is bounded by an absolute constant. When the numbers are algebraic, we also bound effectively the degrees and the heights of these…

数论 · 数学 2019-08-29 Yuri Bilu , Florian Luca

We consider the finite set of isogeny classes of $g$-dimensional abelian varieties defined over the finite field $\mathbb{F}_q$ with endomorphism algebra being a field. We prove that the class within this set whose varieties have maximal…

数论 · 数学 2021-12-24 Elena Berardini , Alejandro J. Giangreco Maidana

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

数论 · 数学 2020-11-24 Yuri Bilu , Florian Luca

Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…

数论 · 数学 2019-08-06 Lucas Reis

In these notes we study the $k$-generalized Fibonacci sequences - $(F_n^{(k)})_{n\in \Z}$ - with positive and negative indices. Denote $T_k(x)$ its characteristic polynomial. Our most interesting finding is that if $k$ is even then the…

数论 · 数学 2020-08-26 Attila Pethő

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Given a finite root system $\Phi$, we show that there is an integer $c=c(\Phi)$ such that $\dim\Ext_G^1(L,L')<c$, for any reductive algebraic group $G$ with root system $\Phi$ and any irreducible rational $G$-modules $L,L'$. There also is…

群论 · 数学 2010-02-23 Brian Parshall , Leonard Scott

The finite n-th polylogarithm li_n(z) in Z/p[z] is defined as the sum on k from 1 to p-1 of z^k/k^n. We state and prove the following theorem. Let Li_k:C_p to C_p be the p-adic polylogarithms defined by Coleman. Then a certain linear…

数论 · 数学 2007-05-23 Amnon Besser

Let $\mathbb{F}_q$ be the finite field of $q$ elements. In this paper we obtain bounds on the following counting problem: given a polynomial $f(x)\in \mathbb{F}_q[x]$ of degree $k+m$ and a non-negative integer $r$, count the number of…

数论 · 数学 2019-07-31 Jiyou Li , Daqing Wan