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

推荐订阅源

博客园_首页
Microsoft Azure Blog
Microsoft Azure Blog
aimingoo的专栏
aimingoo的专栏
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
阮一峰的网络日志
阮一峰的网络日志
Martin Fowler
Martin Fowler
B
Blog
The GitHub Blog
The GitHub Blog
T
Tailwind CSS Blog
Stack Overflow Blog
Stack Overflow Blog
L
LangChain Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
D
DataBreaches.Net
月光博客
月光博客
人人都是产品经理
人人都是产品经理
IT之家
IT之家
GbyAI
GbyAI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
WordPress大学
WordPress大学
博客园 - Franky
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
The Cloudflare Blog
C
Check Point Blog
罗磊的独立博客

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Additive structures imply more distances in $\mathbb{F}_q^d$
Daewoong Cheong, Gennian Ge, Doowon Koh, Thang Pham, Dung The Tr · 2025-10-30 · via math.CO updates on arXiv.org

For a set $E \subseteq \mathbb{F}_q^d$, the distance set is defined as $Δ(E) := \{\|\mathbf{x} - \mathbf{y}\| : \mathbf{x}, \mathbf{y} \in E\}$, where $\|\cdot\|$ denotes the standard quadratic form. We investigate the Erdős--Falconer distance problem within the flexible class of $(u, s)$--Salem sets introduced by Jonathan M. Fraser, with emphasis on the even case $u = 4$. By exploiting the exact identity between $\|\widehat{E}\|_4$ and the fourth additive energy $Λ_4(E)$, we prove that quantitative gains in $Λ_4(E)$ force the existence of many distances. In particular, for a $(4, s)$--Salem set $E\subset \mathbb{F}_q^d$ with $d \geq 2$, if \[ |E|\gg q^{\min\left\{\frac{d+2}{4s+1}, \frac{d+4}{8s}\right\}}, \] then $E$ determines a positive proportion of all distances. This strictly improves Fraser's threshold of $\frac{d}{4s}$ and the Iosevich-Rudnev bound of $q^{\frac{d+1}{2}}$ in certain parameter ranges. As applications, we obtain improved thresholds for multiplicative subgroups and sets on arbitrary varieties, and establish a sharp incidence bound for Salem sets that is of independent interest in incidence geometry. Moreover, our methods give sharp lower bounds for the number of distinct distances determined by two different sets. We also propose a unified conjecture for $(4, s)$--Salem sets that reconciles known bounds and pinpoints the odd-dimensional sphere regime: in odd dimensions $d \geq 3$, the often-cited $\frac{d-1}{2}$ threshold does not follow without additional structures. This provides a clear picture of the spherical distance conjecture.