Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 70 tok/s
Gemini 2.5 Pro 45 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 102 tok/s Pro
Kimi K2 212 tok/s Pro
GPT OSS 120B 466 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

On some resultants formulas of Schur type (2204.11052v1)

Published 23 Apr 2022 in math.NT

Abstract: Let $(r_{A,n}(x)){n \in \mathbb{N}}$ be a sequence of polynomials with coefficients from a field $K$ satisfying the recurrence relation $r{A,n}(x)= \sum_{|\alpha|\leq m} t_{\alpha,n}(x)\textbf{r}{A,n}\alpha(x)$ of order $d+1 \in \mathbb{N}{+}$, where $t_{\alpha,n} \in K[x]$, $m \in \mathbb{N}{+}$ are fixed, $\alpha \in \mathbb{N}{d+1}$, $|\alpha| = \alpha_0 + \ldots+\alpha_d$ and $\textbf{r}{A,n}\alpha(x)=r_{A,n-1}{\alpha_0}(x)r_{A,n-2}{\alpha_1}(x)\cdots r_{A,n-d-1}{\alpha_d}(x).$ We show that under mild assumptions on the initial polynomials $r_{A,0}, \ldots, r_{A,d}$ and the coefficients $t_{\alpha,n}$, we can give the expression for the resultant $\text{Res}(r_{A,n}, r_{A,n-1})$. Our results generalize recent result of Ulas concerning the case $m=1$ and $d=1$.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube