Search arXivSearch

arXiv · 2208.12626

Homotopy properties of the complex of frames of a unitary space

Abstract

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$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kevin Ivan Piterman, Volkmar Welker. 2023-05-04. Homotopy properties of the complex of frames of a unitary space. https://arxiv.org/abs/2208.12626

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO