中文
相关论文

相关论文: Polynomials with a common composite

200 篇论文

Let ${\frak K}$ be a class of combinatorial objects invariant with respect to a given regular cyclic group. It is proved that the isomorphism of any two objects $X,Y\in{\frak K}$ can be tested in polynomial time in sizes of $X$ and $Y$.

组合数学 · 数学 2021-07-06 Mikhail Muzychuk , Ilia Ponomarenko

We consider differential rings of the form (K[x; y];D), where K is an algebraically closed field of characteristic zero and D : K[x; y] \to K[x; y] is a K-derivation. We study the Automorphism Group of such a ring and give criteria for…

交换代数 · 数学 2019-10-28 I. Pan , R. Baltazar

In 2014, Juul, Kurlberg, Madhu and Tucker asked the following: given $K$ a number field and $f$ a rational function with coefficients in $K$, if $f_\mathfrak{p}$ denotes the reduction of $f$ modulo a prime ideal $\mathfrak{p}$ in the ring…

数论 · 数学 2026-03-24 Santiago Radi

Let $G$ be a finite group and let $k$ be a sufficiently large finite field. Let $R(G)$ denote the character ring of $G$ (i.e. the Grothendieck ring of the category of ${\mathbb{C}}G$-modules). We study the structure and the representations…

表示论 · 数学 2008-07-07 Cédric Bonnafé

We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…

量子物理 · 物理学 2010-03-19 Daniel M. Kane , Samuel A. Kutin

Let K be a field of positive characteristic. When V is a linear variety in K^n and G is a finitely generated subgroup of K^*, we show how to compute the intersection of V and G^n effectively using heights. We calculate all the estimates…

数论 · 数学 2014-02-26 Harm Derksen , David Masser

Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…

代数几何 · 数学 2022-04-26 Stefan Barańczuk

For a random polynomial with standard normal coefficients, two cases of the K-level crossings have been considered by Farahmand. When the coefficients are independent, Farahmand was able to derive an asymptotic value for the expected number…

概率论 · 数学 2009-12-22 Jeffrey Matayoshi

We discuss, in a non-Archimedean setting, the distribution of the coefficients of $L$-polynomials of curves of genus $g$ over $\mathbb{F}_q$. Among other results, this allows us to prove that the $\mathbb{Q}$-vector space spanned by such…

数论 · 数学 2025-07-25 Francesco Ballini , Davide Lombardo , Matteo Verzobio

Three intersection theorems are proved. First, we determine the size of the largest set system, where the system of the pairwise unions is l-intersecting. Then we investigate set systems where the union of any s sets intersect the union of…

组合数学 · 数学 2014-03-04 Gyula O. H. Katona , Dániel T. Nagy

Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of…

组合数学 · 数学 2014-08-28 Béla Bollobás , Alex Scott

A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…

交换代数 · 数学 2009-07-02 Joachim von zur Gathen

Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…

环与代数 · 数学 2007-05-23 A. P. Petravchuk , O. G. Iena

Let $f$ be a polynomial in the free algebra over a field $K$, and let $A$ be a $K$-algebra. We denote by $\S_A(f)$, $\A_A(f)$ and $\I_A(f)$, respectively, the `verbal' subspace, subalgebra, and ideal, in $A$, generated by the set of all…

环与代数 · 数学 2018-12-21 Eric Jespers , David Riley , Mayada Shahada

To each quadratic number field $K$ and each quadratic polynomial $f$ with $K$-coefficients, one can associate a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, and whose edges reflect the…

数论 · 数学 2021-08-12 John R. Doyle , Xander Faber , David Krumm

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

We study a relation between roots of characteristic polynomials and intersection points of line arrangements. Using these results, we obtain a lot of applications for line arrangements. Namely, we give (i) a generalized addition theorem for…

组合数学 · 数学 2014-04-17 Takuro Abe

Let k be a field of characteristic not 2, let q be a quadratic space over k and let f be an irreducible polynomial with coefficients in k. In 1969, Milnor raised the following question : how can we decide whether q has an isometry with…

数论 · 数学 2013-09-11 Eva Bayer-Fluckiger

We give a new proof of the result that if f and g are transcendental entire functions, then the composite function f(g) has infinitely many fixed points. The method yields a number of generalization of this result. In particular, it extends…

复变函数 · 数学 2007-05-23 Walter Bergweiler

We examine when the composition of two entire functions f and g is even, and extend some of our results to cyclic compositions in general. We prove some theorems for the cases when f or g is a polynomial. Two of the key theorems we use are…

复变函数 · 数学 2007-05-23 Alan L. Horwitz