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

推荐订阅源

雷峰网
雷峰网
Y
Y Combinator Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
The Cloudflare Blog
博客园_首页
J
Java Code Geeks
A
About on SuperTechFans
人人都是产品经理
人人都是产品经理
量子位
C
Check Point Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
博客园 - 三生石上(FineUI控件)
L
LangChain Blog
N
Netflix TechBlog - Medium
Hugging Face - Blog
Hugging Face - Blog
B
Blog
美团技术团队
Microsoft Security Blog
Microsoft Security Blog
P
Proofpoint News Feed
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
宝玉的分享
宝玉的分享
罗磊的独立博客
MongoDB | Blog
MongoDB | Blog
Last Week in AI
Last Week in AI

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Weddle schemes
[Submitted on 23 Jun 2026] · 2026-06-25 · via math updates on arXiv.org

Title:Weddle schemes

View PDF

Abstract:The classical Weddle surface is the locus of vertices of quadric cones through six points in $\mathbb{P}^3$ in linear general position. Equivalently, it is the closure of the locus of centers of projection from which those six points map to six points on a plane conic. Motivated by this 1850 construction of T. Weddle, we introduce $d$-Weddle schemes for finite point sets $Z\subset \mathbb{P}^n$, defined by an analogous projection-to-degree-$d$ condition. Our main tool is Macaulay duality, which yields a natural multiplication map in an Artinian algebra defined by powers of linear forms. This viewpoint connects $d$-Weddle schemes to unexpected cones and interprets them as non-Lefschetz loci for these multiplication maps. Parallel to this, we give an analysis from the point of view of interpolation matrices, and we explain the connections between these approaches.
For a general set $Z\subset \mathbb{P}^n$ of $\binom{d+n}{n}$ points, we show that the $d$-Weddle scheme is a hypersurface and we compute its degree. We also study general sets whose cardinalities are "near" such a binomial coefficient, where the Weddle scheme has higher codimension. Returning to sets of six points (not always in linear general position), we discuss special configurations in which the appropriate Weddle scheme is reducible, or even nonreduced.

Submission history

From: Lucja Farnik [view email]
[v1] Tue, 23 Jun 2026 18:13:07 UTC (208 KB)