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

推荐订阅源

腾讯CDC
aimingoo的专栏
aimingoo的专栏
S
SegmentFault 最新的问题
A
About on SuperTechFans
Engineering at Meta
Engineering at Meta
宝玉的分享
宝玉的分享
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 叶小钗
WordPress大学
WordPress大学
N
Netflix TechBlog - Medium
MyScale Blog
MyScale Blog
Stack Overflow Blog
Stack Overflow Blog
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - 聂微东
M
MIT News - Artificial intelligence
F
Fortinet All Blogs
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Blog — PlanetScale
Blog — PlanetScale
T
Tailwind CSS Blog
Recent Announcements
Recent Announcements
Jina AI
Jina AI
大猫的无限游戏
大猫的无限游戏
Apple Machine Learning Research
Apple Machine Learning Research
J
Java Code Geeks

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}}$
The spectral property of hypergraph coverings
Yi-Min Song, Yi-Zheng Fan, Yi Wang, Meng-Yu Tian, Jiang-Chao Wan · 2021-08-29 · via math.CO updates on arXiv.org

Let $H$ be a connected $m$-uniform hypergraph, and let $\mathcal{A}(H)$ be the adjacency tensor of $H$ whose spectrum is simply called the spectrum of $H$. Let $s(H)$ denote the number of eigenvectors of $\mathcal{A}(H)$ associated with the spectral radius, and $c(H)$ denote the number of eigenvalues of $\mathcal{A}(H)$ with modulus equal to the spectral radius, which are respectively called the stabilizing index and cyclic index of $H$. Let $\bar{H}$ be a $k$-fold covering of $H$ which can be obtained from some permutation assignment in the symmetric group $\mathbf{S}_k$ on $H$. In this paper, we first characterize the connectedness of $\bar{H}$ by its incidence graph and the permutation assignment, and then investigate the relationship between the spectral property of $H$ and that of $\bar{H}$. By applying module theory and group representation, if $\bar{H}$ is connected, we prove that $s(H) \mid s(\bar{H})$ and $c(H) \mid c(\bar{H})$. In particular, when $\bar{H}$ is a $2$-fold covering of $H$, if $m$ is even, we show that regardless of multiplicities, the spectrum of $\bar{H}$ contains the spectrum of $H$ and the spectrum of a signed hypergraph with $H$ as underlying hypergraph; if $m$ is odd, we give an explicit formula for $s(\bar{H})$. We also find some differences on the spectral property between hypergraph coverings and graph coverings by examples.