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

推荐订阅源

腾讯CDC
The Cloudflare Blog
IT之家
IT之家
V
V2EX
雷峰网
雷峰网
MyScale Blog
MyScale Blog
P
Proofpoint News Feed
Stack Overflow Blog
Stack Overflow Blog
博客园 - Franky
Engineering at Meta
Engineering at Meta
S
SegmentFault 最新的问题
GbyAI
GbyAI
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - 司徒正美
云风的 BLOG
云风的 BLOG
小众软件
小众软件
博客园 - 叶小钗
Blog — PlanetScale
Blog — PlanetScale
C
Check Point Blog
A
About on SuperTechFans
B
Blog
月光博客
月光博客
宝玉的分享
宝玉的分享
Last Week in AI
Last Week in AI

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}}$
Homotopy properties of the complex of frames of a unitary...
Kevin Ivan Piterman, Volkmar Welker · 2022-08-26 · via math.CO updates on arXiv.org

Let $V$ be a finite dimensional vector space equipped with a non-degenerate Hermitian form over a field $\mathbb{K}$. Let $\mathcal{G}(V)$ be the graph with vertex set the $1$-dimensional non-degenerate subspaces of $V$ and adjacency relation given by orthogonality. We give a complete description of when $\mathcal{G}(V)$ is connected in terms of the dimension of $V$ and the size of the ground field $\mathbb{K}$. Furthermore, we prove that if $\dim(V) > 4$ then the clique complex $\mathcal{F}(V)$ of $\mathcal{G}(V)$ is simply connected. For finite fields $\mathbb{K}$, we also compute the eigenvalues of the adjacency matrix of $\mathcal{G}(V)$. Then by Garland's method, we conclude that $\tilde{H}_m(\mathcal{F}(V);\mathbb{k}) = 0$ for all $0\leq m\leq \dim(V)-3$, where $\mathbb{k}$ is a field of characteristic $0$, provided that $\dim(V)^2 \leq |\mathbb{K}|$. Under these assumptions, we deduce that the barycentric subdivision of $\mathcal{F}(V)$ deformation retracts to the order complex of the certain rank selection of $\mathcal{F}(V)$ which is Cohen-Macaulay over $\mathbb{k}$. Finally, we apply our results to the Quillen poset of elementary abelian $p$-subgroups of a finite group and to the study of geometric properties of the poset of non-degenerate subspaces of $V$ and the poset of orthogonal decompositions of $V$.