惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

大猫的无限游戏
大猫的无限游戏
G
Google Developers Blog
WordPress大学
WordPress大学
F
Fortinet All Blogs
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
P
Proofpoint News Feed
博客园 - Franky
Last Week in AI
Last Week in AI
爱范儿
爱范儿
L
LangChain Blog
H
Help Net Security
有赞技术团队
有赞技术团队
N
Netflix TechBlog - Medium
小众软件
小众软件
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Stack Overflow Blog
Stack Overflow Blog
The GitHub Blog
The GitHub Blog
宝玉的分享
宝玉的分享
阮一峰的网络日志
阮一峰的网络日志
MyScale Blog
MyScale Blog
IT之家
IT之家
博客园_首页
人人都是产品经理
人人都是产品经理

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
On coefficients of powers of polynomials and their compos...
Gary L. Mullen, Amela Muratović-Ribić, Qiang Wang · 2015-03-26 · via cs.IT updates on arXiv.org

For any given polynomial $f$ over the finite field $\mathbb{F}_q$ with degree at most $q-1$, we associate it with a $q\times q$ matrix $A(f)=(a_{ik})$ consisting of coefficients of its powers $(f(x))^k=\sum_{i=0}^{q-1}a_{ik} x^i$ modulo $x^q -x$ for $k=0,1,\ldots,q-1$. This matrix has some interesting properties such as $A(g\circ f)=A(f)A(g)$ where $(g\circ f)(x) = g(f(x))$ is the composition of the polynomial $g$ with the polynomial $f$. In particular, $A(f^{(k)})=(A(f))^k$ for any $k$-th composition $f^{(k)}$ of $f$ with $k \geq 0$. As a consequence, we prove that the rank of $A(f)$ gives the cardinality of the value set of $f$. Moreover, if $f$ is a permutation polynomial then the matrix associated with its inverse $A(f^{(-1)})=A(f)^{-1}=PA(f)P$ where $P$ is an antidiagonal permutation matrix. As an application, we study the period of a nonlinear congruential pseduorandom sequence $\bar{a} = \{a_0, a_1, a_2, ... \}$ generated by $a_n = f^{(n)}(a_0)$ with initial value $a_0$, in terms of the order of the associated matrix. Finally we show that $A(f)$ is diagonalizable in some extension field of $\mathbb{F}_q$ when $f$ is a permutation polynomial over $\mathbb{F}_q$.