학술
기타
On dynamical irreducible set of polynomials
arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.Abstract
In this article, a necessary and sufficient condition is proved for the dynamical irreducibility of a family of polynomials over a finite field.
Using this result, an explicit construction of a dynamically irreducible set of polynomials is given over the finite field $\mathbb{F}_{p^p}$ where $p$ is a prime.
Moreover, the existence of dynamically irreducible sets of size at least $p^2$ is also established over every finite field $\mathbb{F}_q$ where $q$ is a $p$ power.
Finally, a bound on the cardinality of the set is given that needs to be tested for the dynamical irreducibility of a set of polynomials.
이 뉴스, 어떠셨어요?
한 번의 탭으로 반응을 남겨요 · 로그인 불필요
관련 뉴스
관련 뉴스 제보는 로그인 후 가능합니다.
'research' 카테고리 뉴스
arXiv의 다른 기사
Evaluating SageMath-Augmented LLM Agents for Computational and Experimental Mathematics
arXiv CS.AI
The Harness Effect: How Orchestration Design Sets the Token Economics of Enterprise Agentic AI
arXiv CS.AI
Grounding Spatial Relations in a Compact World Model: Instruction Leakage and a Goal-Free Dynamics Fix
arXiv CS.AI