相关论文: The Resultant of Developed Systems of Laurent Poly…

We give rational expressions for the subresultants of n+1 generic polynomials f_1,..., f_{n+1} in n variables as a function of the coordinates of the common roots of f_1,..., f_n and their evaluation in f_{n+1}. We present a simple…

We present a Poisson formula for sparse resultants and a formula for the product of the roots of a family of Laurent polynomials, which are valid for arbitrary families of supports. To obtain these formulae, we show that the sparse…

We define the $\textit{Divisor Divisibility Sequence}$ associated to a Laurent polynomial $f\in\mathbb{Z}[X_1^{\pm1},\ldots,X_N^{\pm1}]$ to be the sequence $W_n(f)=\prod f(\zeta_1,\ldots,\zeta_N)$, where $\zeta_1,\ldots,\zeta_N$ range over…

Let $f_n$ be a random polynomial of degree $n$, whose coefficients are independent and identically distributed random variables with mean-zero and variance one. Let $\Delta(f_n)$ denote the discriminant of $f_n$, that is $\Delta(f_n) =…

Let $f(z) = \sum_{k=0}^\infty d_k z^k$, $d_k\in\mathbb{C}\backslash\{ 0 \}$, $d_0=1$, be a power series with a non-zero radius of convergence $\rho$: $0 <\rho \leq +\infty$. Denote by $f_n(z)$ the n-th partial sum of $f$, and $R_{2n}(z) =…

Resultants are important special functions used in description of non-linear phenomena. 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$…

For a system of Laurent polynomials f_1,..., f_n \in C[x_1^{\pm1},..., x_n^{\pm1}] whose coefficients are not too big with respect to its directional resultants, we show that the solutions in the algebraic n-th dimensional complex torus of…

Let $X$ be the family of hypersurfaces in the odd-dimensional torus ${\mathbb T}^{2n+1}$ defined by a Laurent polynomial $f$ with fixed exponents and variable coefficients. We show that if $n\Delta$, the dilation of the Newton polytope…

We discuss a product formula for $F$-polynomials in cluster algebras, and provide two proofs. One proof is inductive and uses only the mutation rule for $F$-polynomials. The other is based on the Fock-Goncharov decomposition of mutations.…

We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these…

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…

We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

In this paper, we present a probabilistic extension of the Fubini polynomials and numbers associated with a random variable satisfying some appropriate moment conditions. We obtain the exponential generating function and an integral…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

We consider the generating function $\Phi^{(N)}$ for the reciprocals $N$-th power of factorials. We show a connection of product formulas for such series with the periods for certain families of algebraic hypersurfaces. For these families…

Let $I_n(x)=\prod_{i=1}^n \left( 1+x^{F_{i+1}}\right)$, where $F_{i+1}$ denotes a Fibonacci number. Let $v_r(n)$ denote the sum of the $r$th powers of the coefficients of $I_n(x)$. Our prototypical result is that $\sum_{n\geq 0} v_2(n)x^n=…

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

In this paper we develop an algorithm for obtaining some new linear relations among the Lauricella $F_D$ functions. Relations we obtain, generalize those hinted in the work of B. C. Carlson. The coefficients of these relations are contained…

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…