Critical spectral weights on triangulated disk

We solve the common-positive-weight support problem at the local spectral threshold 1/2 for relative triangulated disks with interior degrees at most five and an empty or connected degree-five core. We characterize feasibility by a finite decomposition into three elementary pieces and a condition on the original boundary marking. The proof passes from spectral equality to a positive conjugate rectangle, then uses geometric reductions to obtain a serial presentation. The empty-face inequality holds for some common positive weights exactly when such a presentation has only old join endpoints. Whenever this condition holds, our construction yields weights with a positive definite empty-face matrix. Positive Schur responses establish sufficiency, and a uniform face-counting obstruction proves necessity. This gives a finite combinatorial criterion for critical spectral feasibility together with a constructive choice of common weights.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24199
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Critical spectral weights on triangulated disk

朱恩强
arXiv (Cornell University)
Advanced Combinatorial Mathematics
preprint

Critical spectral weights on triangulated disk

朱恩强
preprint en

Abstract

We solve the common-positive-weight support problem at the local spectral threshold 1/2 for relative triangulated disks with interior degrees at most five and an empty or connected degree-five core. We characterize feasibility by a finite decomposition into three elementary pieces and a condition on the original boundary marking. The proof passes from spectral equality to a positive conjugate rectangle, then uses geometric reductions to obtain a serial presentation. The empty-face inequality holds for some common positive weights exactly when such a presentation has only old join endpoints. Whenever this condition holds, our construction yields weights with a positive definite empty-face matrix. Positive Schur responses establish sufficiency, and a uniform face-counting obstruction proves necessity. This gives a finite combinatorial criterion for critical spectral feasibility together with a constructive choice of common weights.

arXiv (Cornell University)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon