Related papers: A resultant for Hensel's Lemma

Let $f_1,...,f_s \in \mathbb{K}[x_1,...,x_m]$ be a system of polynomials generating a zero-dimensional ideal $\I$, where $\mathbb{K}$ is an arbitrary algebraically closed field. Assume that the factor algebra $\A=\mathbb{K}[x_1,...,x_m]/\I$…

Henselian elements are roots of polynomials which satisfy the conditions of Hensel's Lemma. In this paper we prove that for a finite field extension $(F|L,v)$, if $F$ is contained in the absolute inertia field of $L$, then the valuation…

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…

Let $R$ be a commutative ring and let $n \geq 1.$ We study $\Gamma(s)$, the generating function and Ann$(s)$, the ideal of characteristic polynomials of $s$, an $n$--dimensional sequence over $R$. We express $f(X_1,\ldots,X_n) \cdot…

We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

For a (not necessarily locally convex) topological vector space $\mathcal{X}$ of holomorphic functions in one complex variable, we show that the shift invariant subspace generated by a set of polynomials is $\mathcal{X}$ if and only if…

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…

We prove a robust generalization of a Sylvester-Gallai type theorem for quadratic polynomials, generalizing the result in [S'20]. More precisely, given a parameter $0 < \delta \leq 1$ and a finite collection $\mathcal{F}$ of irreducible and…

In this paper we derive generalizations of different properties of monic polynomial families of binomial type, i.e. families of monic polynomials, for which the binomial theorem holds $$ p_n(\alpha+\beta)=\sum_{k=0}^n…

We study the Hankel determinant generated by a Gaussian weight with Fisher-Hartwig singularities of root type at $t_j$, $j=1,\cdots ,N$. It characterizes a type of average characteristic polynomial of matrices from Gaussian unitary…

In this paper we deal with the noteworthy Sylvester's determinantal identity and some of its generalizations. We report the formulae due to Yakovlev, to Gasca, Lopez--Carmona, Ramirez, to Beckermann, Gasca, M\"uhlbach, and to Mulders in a…

In a recent paper Richards and Zheng compute the determinant of a matrix whose entries are given by beta-type integrals, thereby generalising an earlier result by Dixon and Varchenko. They then use their result to obtain a generalisation of…

Let $R$ be a finite non-commutative ring with $1\ne 0$. By a polynomial function on $R$, we mean a function $F\colon R\longrightarrow R$ induced by a polynomial $f=\sum\limits_{i=0}^{n}a_ix^i\in R[x]$ via right substitution of the variable…

We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…

Resultant $R_{r_1, ..., r_n}$ defines a condition of solvability for a system of $n$ homogeneous polynomials of degrees $r_1, ..., r_n$ in $n$ variables, just in the same way as determinant does for a system of linear equations. Because of…

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…

We present a Mathematica package which finds a basis of master integrals for the Feynman integral reduction. In this basis the dependence on the dimensional regularization in the denominators factorizes in kinematic independent polynomials.

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.

In this paper, we study the relationship between iterated resultant and multivariate discriminant. We show that, for generic form $f(X_n)$ with even degree $d$, if the polynomial is squarefreed after each iteration, the multivariate…

We prove, without recourse to the Extended Riemann Hypothesis, that the projection modulo $p$ of any prefixed polynomial with integer coefficients can be completely factored in deterministic polynomial time if $p-1$ has a $(\ln…