Search arXivSearch

arXiv · 2512.06541

Frame Numbers and Jacobson Radicals for Partial Geometries and Related Coherent Configurations

Abstract

We study the modular representation theory of rank $3$ association schemes arising from partial geometries with parameters $(s,t,α)$. First, we obtain an explicit closed formula for the Frame number of the point scheme in terms of the number of points $v$ and the parameter $s+t+1-α$, and use it to characterize the primes $p$ for which the adjacency algebra over $\mathbb{F}_p$ is not semisimple. We then give a complete case-by-case description of the Jacobson radical of this algebra in four arithmetic situations and determine the generic $p$-ranks of the adjacency matrices. As a step toward understanding the modular representation theory of coherent configurations of type $[3,2;3]$ associated with strongly regular designs, we analyze the relationship between the modular structure of the point scheme and that of the design algebra. For the generalized quadrangle $\mathrm{GQ}(2,2)$ we obtain partial results on the structure of the $2$-modular adjacency algebra $\mathbb{F}_2 \mathfrak{X}$, and we explain the representation-theoretic difficulties that prevent a complete determination of its Wedderburn decomposition and Gabriel quiver, which remains open and is formulated as Problem~6.8.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Osamu Shimabukuro. 2025-12-06. Frame Numbers and Jacobson Radicals for Partial Geometries and Related Coherent Configurations. https://arxiv.org/abs/2512.06541

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