Conlon's conjecture on norming graphs and stable reflection graphs
Statement
Let be a graph. A graph is norming if its associated graph norm is a norm, and a stable reflection graph is a graph arising as the specified -graph, where is a finite reflection graph and are parabolic subgroups with .
Conlon's conjecture. Every norming graph is a stable reflection graph. Equivalently, a graph is norming if and only if it is isomorphic to a special type of -graph with these properties.
The conjecture proposes a complete correspondence between the functional-analytic property of being norming and a group-theoretic description; it would also imply the stated characterization using edge-transitivity under stable involutions. The supplied text does not state whether the conjecture has been resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.