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

推荐订阅源

D
DataBreaches.Net
有赞技术团队
有赞技术团队
Jina AI
Jina AI
H
Help Net Security
D
Docker
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Blog — PlanetScale
Blog — PlanetScale
Hugging Face - Blog
Hugging Face - Blog
罗磊的独立博客
MyScale Blog
MyScale Blog
N
Netflix TechBlog - Medium
B
Blog RSS Feed
Martin Fowler
Martin Fowler
WordPress大学
WordPress大学
T
The Blog of Author Tim Ferriss
U
Unit 42
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
MongoDB | Blog
MongoDB | Blog
美团技术团队
M
MIT News - Artificial intelligence
阮一峰的网络日志
阮一峰的网络日志
博客园 - 司徒正美
Microsoft Security Blog
Microsoft Security Blog
IT之家
IT之家

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}}$
Conditional Non-Soficity of p-adic Deligne Extensions: on...
Michael Chapman, Yotam Dikstein, Alexander Lubotzky · 2024-10-04 · via math.CO updates on arXiv.org

A long standing problem asks whether every group is sofic, i.e., can be separated by almost-homomorphisms to the symmetric group $Sym(n)$. Similar problems have been asked with respect to almost-homomorphisms to the unitary group $U(n)$, equipped with various norms. One of these problems has been solved for the first time in [De Chiffre, Gelbsky, Lubotzky, Thom, 2020]: some central extensions $\widetildeΓ$ of arithmetic lattices $Γ$ of $Sp(2g,\mathbb{Q}_p)$ were shown to be non-Frobenius approximated by almost homomorphisms to $U(n)$. Right after, it was shown that similar results hold with respect to the $p$-Schatten norms in [Lubotzky, Oppenheim, 2020]. It is natural, and has already been suggested in [Chapman, Lubotzky, 2024] and [Gohla, Thom, 2024], to check whether the $\widetildeΓ$ are also non-sofic. In order to show that they are (also) non-sofic, it suffices: (a) To prove that the permutation Cheeger constant of the simplicial complex underlying $Γ$ is positive, generalizing [Evra, Kaufman, 2016]. This would imply that $Γ$ is stable. (b) To prove that the (flexible) stability of $Γ$ implies the non-soficity of $\widetildeΓ$. Clause (b) was proved by Gohla and Thom. Here we offer a more algebraic/combinatorial treatment to their theorem.