English
Related papers

Related papers: A resultant for Hensel's Lemma

200 papers

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Combinatorics · Mathematics 2008-01-19 Milan Janjic

Let $X\subset\mathbb{R}^n$ be a convex closed and semialgebraic set and let $f$ be a polynomial positive on $X$. We prove that there exists an exponent $N\geq 1$, such that for any $\xi\in\mathbb{R}^n$ the function…

Algebraic Geometry · Mathematics 2018-12-13 Krzysztof Kurdyka , Katarzyna Kuta , Stanisław Spodzieja

It is well known that the multiplier ideal $\multr{I}$ of an ideal $I$ determines in a straightforward way the multiplier ideal $\multr{f}$ of a sufficiently general element $f$ of $I$. We give an explicit condition on a polynomial $f \in…

Algebraic Geometry · Mathematics 2007-05-23 Jason Howald

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

Commutative Algebra · Mathematics 2008-06-10 Luis F. Caceres , Jose A. Velez-Marulanda

We prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of the complex plane and D an effective divisor supported on the boundary of…

Algebraic Geometry · Mathematics 2009-04-14 Martin Weimann

In this paper, we provide the degree distribution of irreducible factors of the composed polynomial $f(L(x))$ over $\mathbb F_q$, where $f(x)\in \mathbb F_q[x]$ is irreducible and $L(x)\in \mathbb F_q[x]$ is a linearized polynomial. We…

Number Theory · Mathematics 2018-09-07 Lucas Reis

Let $R$ be a commutative unital ring. A well-known factorization problem is whether any matrix in $\mathrm{SL}_n(R)$ is a product of elementary matrices with entries in $R$. To solve the problem, we use two approaches based on the notion of…

Commutative Algebra · Mathematics 2019-02-12 Evgueni Doubtsov , Frank Kutzschebauch

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh

We provide a complete description of the ideal that serves as the resultant ideal for n univariate polynomials of degree d. We in particular describe a set of generators of this resultant ideal arising as maximal minors of a set of…

Commutative Algebra · Mathematics 2025-01-14 Austin Conner , Mateusz Michalek , Michael Schindler , Balazs Szendroi

The relationship between a polynomial's zeros and factors is well known. If a is a zero of f(x) then (x-a) is a factor of f(x). In this paper, we generalize this idea to polynomials of two variables and with real coefficients. We consider…

Algebraic Geometry · Mathematics 2012-10-22 Micki Balaich , Mihail Cocos

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

Classical Analysis and ODEs · Mathematics 2008-08-14 Steve Fisk

We extend Polyak's theorem on the convexity of joint numerical range from three to any number of quadratic forms on condition that they can be generated by three quadratic forms with a positive definite linear combination. Our new result…

Optimization and Control · Mathematics 2021-08-20 Mengmeng Song , Yong Xia

Let $p$ be a prime number, $K$ be the henselization of the rational functions over the finite field $\mathbb{F}_p$ and $R$ be the ring of additive polynomials over K. We show that the field of Laurent series over $\mathbb{F}_p$ is decidable…

Logic · Mathematics 2018-10-10 Gönenç Onay

Determinantal polynomials play a crucial role in semidefinite programming problems. Helton-Vinnikov proved that real zero (RZ) bivariate polynomials are determinantal. However, it leads to a challenging problem to compute such a…

Optimization and Control · Mathematics 2019-02-01 Papri Dey

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

Rings and Algebras · Mathematics 2022-02-21 Johanna Lercher , Daniel F. Scharler , Hans-Peter Schröcker , Johannes Siegele

Given a non-zero polynomial $f$ in a polynomial ring $R$ with coefficients in a finite field of prime characteristic $p$, we present an algorithm to compute a differential operator $\delta$ which raises $1/f$ to its $p$th power. For some…

Commutative Algebra · Mathematics 2018-05-18 Alberto F. Boix , Alessandro De Stefani , Davide Vanzo

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

We present two results, the first on the distribution of the roots of a polynomial over the ring of integers modulo $n$ and the second on the distribution of the roots of the Sylvester resultant of two multivariate polynomials. The second…

Combinatorics · Mathematics 2016-09-29 Michael Monagan , Baris Tuncer

I explain a direct approach to differentiation and integration. Instead of relying on the general notions of real numbers, limits and continuity, we treat functions as the primary objects of our theory, and view differentiation as division…

History and Overview · Mathematics 2009-05-25 Michael Livshits

Let $K$ be an algebraically closed field of characteristic zero and let $f \in K[x]$. The $m$-th {\it cyclic resultant} of $f$ is \[r_m = \text{Res}(f,x^m-1).\] A generic monic polynomial is determined by its full sequence of cyclic…

Algebraic Geometry · Mathematics 2007-05-23 Christopher J. Hillar , Lionel Levine
‹ Prev 1 4 5 6 7 8 10 Next ›