Characteristic functions for \MakeLowercase{(r, n)}-free and \MakeLowercase{(f, g)}-free elements
Himangshu Hazarika, Dhiren Kumar Basnet

TL;DR
This paper develops characteristic functions for identifying (r, n)-free and (f, g)-free elements in finite fields and modules, providing a unified approach to their algebraic properties and distributions.
Contribution
It introduces a new characteristic function framework for (r, n)-free and (f, g)-free elements in finite cyclic modules and polynomial value contexts.
Findings
Derived explicit characteristic functions for (r, n)-free elements.
Extended the concept to (f, g)-free elements via polynomial evaluations.
Provided formulas applicable to finite fields and modules.
Abstract
For a prime power , denotes the finite field of order , and for , denotes the extension field of degree . We establish a characteristic function for the set of -free elements of finite cyclic -module for the Euclidean domain . Furthermore, we explore -freeness through polynomial values and finally give an expression for the characteristic function for the set of -free elements.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Coding theory and cryptography
