English
Related papers

Related papers: Polynomials with a common composite

200 papers

Kaplansky asked about the possible images of a polynomial $f$ in several noncommuting variables. In this paper we consider the case of $f$ a Lie polynomial. We describe all the possible images of $f$ in $M_2(K)$ and provide an example of…

Algebraic Geometry · Mathematics 2017-12-05 Alexei Kanel-Belov , Sergey Malev , Louis Rowen

Let $k$ be a perfect field of characteristic $\neq 2$. We prove that the Schmidt rank (also known as strength) of a quartic polynomial $f$ over $k$ is bounded above in terms of only the Schmidt rank of $f$ over $\overline{k}$, an algebraic…

Algebraic Geometry · Mathematics 2021-10-22 David Kazhdan , Alexander Polishchuk

Consider the polynomial ring in countably infinitely many variables over a field of characteristic zero, together with its natural action of the infinite general linear group G. We study the algebraic and homological properties of finitely…

Commutative Algebra · Mathematics 2015-12-08 Steven V Sam , Andrew Snowden

In this article we shall study some basic properties of posynomial rings with particular emphasis on rings ${\rm Pos}(K,\mathbb{Q})[\bar x]$, and ${\rm Pos}(K,\mathbb{Z})[\bar x]$. The latter ring is the well known ring of Laurent…

Commutative Algebra · Mathematics 2007-05-23 Zarko Mijajlovic , Milos Milosevic , Aleksandar Perovic

Consider the polynomial $f(x,y)=xy^k+C$ for $k\geq 2$ and any nonzero integer constant $C$. We derive an asymptotic formula for the $k$-free values of $f(x,y)$ when $x, y\leq H$. We also prove a similar result for the $k$-free values of…

Number Theory · Mathematics 2015-10-21 Kostadinka Lapkova

In this paper we initiate a study on Gauss factorials of polynomials over finite fields, which are the analogues of Gauss factorials of positive integers.

Number Theory · Mathematics 2017-04-19 Xiumei Li , Min Sha

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…

Commutative Algebra · Mathematics 2007-05-23 Eduardo Cattani , Alicia Dickenstein

Let S=K[x_1,...,x_n] be a polynomial ring over a field K and I a homogeneous ideal in S generated by a regular sequence f_1,f_2,...,f_k of homogeneous forms of degree d. We study a generalization of a result of Conca, Herzog, Trung, and…

Commutative Algebra · Mathematics 2013-08-01 Neeraj Kumar

Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in $\MA$ having no arithmetic circuits of size O(n^k) over the complex field (allowing any complex constant). We also build…

Computational Complexity · Computer Science 2013-04-23 Hervé Fournier , Sylvain Perifel , Rémi de Verclos

For $G = \mathrm{GL}_2, \mathrm{SL}_2, \mathrm{PGL}_2$ we compute the intersection E-polynomials and the intersection Poincar\'e polynomials of the $G$-character variety of a compact Riemann surface $C$ and of the moduli space of $G$-Higgs…

Algebraic Geometry · Mathematics 2021-01-13 Mirko Mauri

The graph crossing number problem, cr(G)<=k, asks for a drawing of a graph G in the plane with at most k edge crossings. Although this problem is in general notoriously difficult, it is fixed- parameter tractable for the parameter k…

Computational Complexity · Computer Science 2016-02-19 Petr Hliněný , Marek Derňár

We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p in R and q in B, we consider the disk through p and q with the smallest diameter. We prove that for any R and B…

Computational Geometry · Computer Science 2019-02-25 Clemens Huemer , Pablo Pérez-Lantero , Carlos Seara , Rodrigo I. Silveira

A graph $G$ is well-covered if all its maximal stable sets have the same size, denoted by alpha(G) (M. D. Plummer, 1970). If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$…

Combinatorics · Mathematics 2007-05-23 Vadim E. Levit , Eugen Mandrescu

Regarding polynomial functions on a subset $S$ of a non-commutative ring $R$, that is, functions induced by polynomials in $R[x]$ (whose variable commutes with the coefficients), we show connections between, on one hand, sets $S$ such that…

Rings and Algebras · Mathematics 2018-09-26 Sophie Frisch

We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…

Combinatorics · Mathematics 2016-09-06 Daniel E. Loeb

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

Rings and Algebras · Mathematics 2011-12-22 Gábor Ivanyos , Lajos Rónyai , Josef Schicho

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

Classical Analysis and ODEs · Mathematics 2024-04-15 Mikhail Chernyavsky , Andrei Lebedev , Yurii Trubnikov

Let $V$ be a valuation ring of a global field $K$. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $V$, that is, an element of $\text{Int}(V) = \{ f \in K[X] \mid…

Number Theory · Mathematics 2023-08-25 Victor Fadinger , Sophie Frisch , Daniel Windisch

An intersective polynomial is a monic polynomial in one variable with rational integer coefficients, with no rational root and having a root modulo $m$ for all positive integers $m$. Let $G$ be a finite noncyclic group and let $r(G)$ be the…

Group Theory · Mathematics 2015-07-31 D. Bubboloni , J. Sonn

Two families $\mathcal{F}$ and $\mathcal{G}$ are called cross-intersecting if for every $F\in \mathcal{F}$ and $G\in \mathcal{G}$, the intersection $F\cap G$ is non-empty. It is significant to determine the maximum sum of sizes of…

Combinatorics · Mathematics 2025-05-26 Yongjiang Wu , Lihua Feng , Yongtao Li
‹ Prev 1 8 9 10 Next ›