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

推荐订阅源

T
The Blog of Author Tim Ferriss
I
InfoQ
H
Hackread – Cybersecurity News, Data Breaches, AI and More
aimingoo的专栏
aimingoo的专栏
小众软件
小众软件
有赞技术团队
有赞技术团队
J
Java Code Geeks
Apple Machine Learning Research
Apple Machine Learning Research
大猫的无限游戏
大猫的无限游戏
Engineering at Meta
Engineering at Meta
B
Blog RSS Feed
博客园_首页
Y
Y Combinator Blog
V
Visual Studio Blog
Google DeepMind News
Google DeepMind News
M
MIT News - Artificial intelligence
雷峰网
雷峰网
博客园 - 司徒正美
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
H
Help Net Security
P
Proofpoint News Feed
B
Blog
云风的 BLOG
云风的 BLOG
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报

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 many-to-one mappings over finite fields
[Submitted on 8 Aug 2024 (v1), last revised 8 Aug 2026 (this ver · 2024-08-08 · via cs.IT updates on arXiv.org

View PDF HTML (experimental)

Abstract:We introduce the definition of $m$-to-$1$ mappings between two finite sets, which unifies and generalizes the definitions of $2$-to-$1$ and $n$-to-$1$ mappings in recent literature. We also characterize these $m$-to-$1$ mappings in terms of the generalized local criterion and thus provide three generic constructions of $m$-to-$1$ mappings, which unify and generalize the previous known constructions. Using these constructions, the problem whether $x^r h(x^s)$ is $m$-to-$1$ on the multiplicative group $\mathbb{F}_{q}^{*}$ is converted into that whether an associated polynomial $x^{r_1} h(x)^{s_1}$ is $m_2$-to-$1$ on the order~$\ell$ subgroup~$U_{\ell}$ of $\mathbb{F}_{q}^{*}$, where $m_2 = m / (r, s)$ and $\ell = (q-1) / s$. Furthermore, the $m_2$-to-$1$ property of $x^{r_1} h(x)^{s_1}$ on $U_{\ell}$ is studied in detail in four different cases. In addition, a recursive construction of $m$-to-$1$ mappings from $m$-to-$1$ mappings is proposed.

Submission history

From: Yanbin Zheng [view email]
[v1] Thu, 8 Aug 2024 05:05:42 UTC (91 KB)
[v2] Sat, 8 Aug 2026 15:26:02 UTC (74 KB)