PulseAugur
中
实时 08:00:29
English(EN) How many sorted projections determine n points in k dimensions?

数学论文:排序投影确定k维空间中的n个点

一篇新论文探讨了确定唯一识别k维空间中的一组点所需的排序投影数量的数学问题。研究人员已经确定了界限,表明总是需要多于 (k-1)log2(n) 个方向,而 (k-1)n+1 个方向则足够。该论文改进了这些界限,证明对于更高维度,特定的对数数量的方向是足够的,这改进了先前针对某些点集大小的线性界限。 AI

排序理由 这是一篇发表在arXiv上的关于数学问题的研究论文。[lever_c_demoted from research: ic=1 ai=0.1]

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →

数学论文:排序投影确定k维空间中的n个点

本文如何被排名

Signal score
3 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
这是一篇发表在arXiv上的关于数学问题的研究论文。[lever_c_demoted from research: ic=1 ai=0.1]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
Low
Off-topic or adjacent — cluster remains reachable but doesn't surface in AI-industry rankings.
Story freshness
Breaking (< 6h)
Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

完整方法见我们的编辑标准。

报道来源 [1]

  1. arXiv cs.LG TIER_1 English(EN) · Christopher Gorham Lester, Raymond Hau S{\o}rensen ·

    多少个排序投影确定了k维空间中的n个点?

    arXiv:2611.06470v1 Announce Type: cross Abstract: Let $d_1,\dots,d_m$ be directions in $\mathbb{R}^k$, where $k\ge 2$. A multiset $X$ of $n$ points of $\mathbb{R}^k$ projects to the $m$ multisets of numbers $\{\{x\cdot d_j : x\in X\}\}$, or equivalently to the $m$ sorted lists of…