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

推荐订阅源

宝玉的分享
宝玉的分享
小众软件
小众软件
J
Java Code Geeks
I
InfoQ
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
腾讯CDC
L
LangChain Blog
博客园 - 司徒正美
量子位
Y
Y Combinator Blog
C
Check Point Blog
T
Tailwind CSS Blog
D
DataBreaches.Net
Blog — PlanetScale
Blog — PlanetScale
N
Netflix TechBlog - Medium
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
F
Fortinet All Blogs
云风的 BLOG
云风的 BLOG
A
About on SuperTechFans
B
Blog RSS Feed
酷 壳 – CoolShell
酷 壳 – CoolShell
大猫的无限游戏
大猫的无限游戏
V
V2EX
阮一峰的网络日志
阮一峰的网络日志

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}}$
On an uncountable family of graphs whose spectrum is a Ca...
Matteo Cavaleri, Daniele D'Angeli, Alfredo Donno, Emanuele Rodar · 2021-01-19 · via math.CO updates on arXiv.org

For each $p\geq 1$, the star automaton group $\mathcal{G}_{S_p}$ is an automaton group which can be defined starting from a star graph on $p+1$ vertices. We study Schreier graphs associated with the action of the group $\mathcal{G}_{S_p}$ on the regular rooted tree $T_{p+1}$ of degree $p+1$ and on its boundary $\partial T_{p+1}$. With the transitive action on the $n$-th level of $T_{p+1}$ is associated a finite Schreier graph $Γ^p_n$, whereas there exist uncountably many orbits of the action on the boundary, represented by infinite Schreier graphs which are obtained as limits of the sequence $\{Γ_n^p\}_{n\geq 1}$ in the Gromov-Hausdorff topology. We obtain an explicit description of the spectrum of the graphs $\{Γ_n^p\}_{n\geq 1}$. Then, by using amenability of $\mathcal{G}_{S_p}$, we prove that the spectrum of each infinite Schreier graph is the union of a Cantor set of zero Lebesgue measure, which is the Julia set of the quadratic map $f_p(z) = z^2-2(p-1)z -2p$, and a countable collection of isolated points supporting the KNS spectral measure. We also give a complete classification of the infinite Schreier graphs up to isomorphism of unrooted graphs, showing that they may have $1$, $2$ or $2p$ ends, and that the case of $1$ end is generic with respect to the uniform measure on $\partial T_{p+1}$.