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

推荐订阅源

aimingoo的专栏
aimingoo的专栏
Engineering at Meta
Engineering at Meta
有赞技术团队
有赞技术团队
博客园_首页
Apple Machine Learning Research
Apple Machine Learning Research
Vercel News
Vercel News
G
Google Developers Blog
Blog — PlanetScale
Blog — PlanetScale
IT之家
IT之家
MongoDB | Blog
MongoDB | Blog
Y
Y Combinator Blog
B
Blog
The GitHub Blog
The GitHub Blog
M
MIT News - Artificial intelligence
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Stack Overflow Blog
Stack Overflow Blog
C
Check Point Blog
Microsoft Azure Blog
Microsoft Azure Blog
D
DataBreaches.Net
I
InfoQ
Recent Announcements
Recent Announcements
阮一峰的网络日志
阮一峰的网络日志
腾讯CDC
H
Help Net Security

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}}$
Two conjectures in spectral hypergraph theory
Ya-Nan Zheng · 2026-01-08 · via math.CO updates on arXiv.org

Let $\mathcal{A}$ be a $k$-th order $n$-dimensional tensor, and we denote by ${\rm am}(λ, \mathcal{A})$ the algebraic multiplicity of the eigenvalue $λ$ of $\mathcal{A}$. The projective eigenvariety $\mathbb{V}_λ(\mathcal{A})$ is defined as the set of eigenvectors of $\mathcal{A}$ associated with $λ$, considered in the complex projective space. For a connected uniform hypergraph $H$, let $\mathcal{A}(H)$ and $\mathcal{L}(H)$ denote its adjacency tensor and Laplacian tensor, respectively. Let $ρ$ be the spectral radius of $\mathcal{A}(H)$, for which it is known that $|\mathbb{V}_ρ(\mathcal{A}(H))| = |\mathbb{V}_{0}(\mathcal{L}(H))|$. Recently, Fan [arXiv:2410.20830v2, 2024] conjectured that ${\rm am}(ρ, \mathcal{A}(H)) = |\mathbb{V}_ρ(\mathcal{A}(H))|$ and ${\rm am}(0, \mathcal{L}(H)) = {\rm am}(ρ, \mathcal{A}(H))$. In this paper, we prove these two conjectures, and thereby establish $$ {\rm am}(ρ, \mathcal{A}(H)) = |\mathbb{V}_ρ(\mathcal{A}(H))| = |\mathbb{V}_{0}(\mathcal{L}(H))| = {\rm am}(0, \mathcal{L}(H)). $$ As shown by Fan et al., $|\mathbb{V}_ρ(\mathcal{A}(H))|$ and $|\mathbb{V}_{0}(\mathcal{L}(H))|$ can be computed via the Smith normal form of the incidence matrix of $H$ over $\mathbb{Z}_{k}$. Consequently, we provide a method for computing the algebraic multiplicity of the spectral radius and zero Laplacian eigenvalue for connected uniform hypergraphs.