Search arXivSearch

arXiv · 1804.01204

Remarks on singular Cayley graphs and vanishing elements of simple groups

Abstract

Let $Γ$ be a finite graph and let $A(Γ)$ be its adjacency matrix. Then $Γ$ is {\it singular} if $A(Γ)$ is singular. The singularity of graphs is of certain interest in graph theory and algebraic combinatorics. Here we investigate this problem for Cayley graphs ${\rm Cay}(G,H)$ when $G$ is a finite group and when the connecting set $H$ is a union of conjugacy classes of $G.$ In this situation the singularity problem reduces to finding an irreducible character $χ$ of $G$ for which $\sum_{h\in H}\,χ(h)=0.$ At this stage we focus on the case when $H$ is a single conjugacy class $h^G$ of $G.$ Here the above equality is equivalent to $χ(h)=0$. Much is known in this situation, with essential information coming from the block theory of representations of finite groups. An element $h\in G$ is called vanishing if $χ(h)=0$ for some irreducible character $χ$ of $G.$ We study vanishing elements mainly in finite simple groups and in alternating groups in particular. We suggest some approaches for constructing singular Cayley graphs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Johannes Siemons, Alexandre Zalesski. 2018-04-04. Remarks on singular Cayley graphs and vanishing elements of simple groups. https://arxiv.org/abs/1804.01204

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