Accelerate Literature Icon
Want to do a literature review? Try our new Literature Review workflow

Switching equivalence of strongly regular polar graphs

  • Abstract
  • Literature Map
  • Similar Papers
Abstract
Translate article icon Translate Article Star icon

We prove the switching equivalence of the strongly regular polar graphs N O ± ( 4 m , 2 ) , N O ∓ ( 2 m + 1 , 4 ) , and Γ ( O ∓ ( 4 m , 2 ) ) with an isolated vertex by giving an analytic description for them and their associated two-graphs.

Similar Papers
  • Research Article
  • Cite Count Icon 15
  • 10.1016/j.ffa.2013.11.003
Lifting constructions of strongly regular Cayley graphs
  • Dec 12, 2013
  • Finite Fields and Their Applications
  • Koji Momihara + 1 more

Lifting constructions of strongly regular Cayley graphs

  • Research Article
  • 10.1002/jcd.22001
Tightness of the Weight‐Distribution Bound for Strongly Regular Polar Graphs
  • Aug 4, 2025
  • Journal of Combinatorial Designs
  • Rhys J Evans + 2 more

ABSTRACTIn this paper, we show the tightness of the weight‐distribution bound for the positive nonprincipal eigenvalue of strongly regular (affine) polar graphs and characterise the optimal eigenfunctions. Additionally, we show the tightness of the weight‐distribution bound for the negative nonprincipal eigenvalue of some unitary polar graphs.

  • Single Book
  • Cite Count Icon 126
  • 10.1017/9781009057226
Strongly Regular Graphs
  • Jan 6, 2022
  • Andries E Brouwer + 1 more

Strongly regular graphs lie at the intersection of statistical design, group theory, finite geometry, information and coding theory, and extremal combinatorics. This monograph collects all the major known results together for the first time in book form, creating an invaluable text that researchers in algebraic combinatorics and related areas will refer to for years to come. The book covers the theory of strongly regular graphs, polar graphs, rank 3 graphs associated to buildings and Fischer groups, cyclotomic graphs, two-weight codes and graphs related to combinatorial configurations such as Latin squares, quasi-symmetric designs and spherical designs. It gives the complete classification of rank 3 graphs, including some new constructions. More than 100 graphs are treated individually. Some unified and streamlined proofs are featured, along with original material including a new approach to the (affine) half spin graphs of rank 5 hyperbolic polar spaces.

  • PDF Download Icon
  • Research Article
  • Cite Count Icon 3
  • 10.37236/9382
Nonassociativity of the Norton Algebras of Some Distance Regular Graphs
  • Nov 13, 2020
  • The Electronic Journal of Combinatorics
  • Jia Huang

A Norton algebra is an eigenspace of a distance regular graph endowed with a commutative nonassociative product called the Norton product, which is defined as the projection of the entrywise product onto this eigenspace. The Norton algebras are useful in finite group theory as they have interesting automorphism groups. We provide a precise quantitative measurement for the nonassociativity of the Norton product on the eigenspace of the second largest eigenvalue of the Johnson graphs, Grassman graphs, Hamming graphs, and dual polar graphs, based on the formulas for this product established in previous work of Levstein, Maldonado and Penazzi. Our result shows that this product is as nonassociative as possible except for two cases, one being the trivial vanishing case while the other having connections with the integer sequence A000975 on OEIS and the so-called double minus operation studied recently by Huang, Mickey, and Xu.

  • Research Article
  • Cite Count Icon 4
  • 10.1016/j.laa.2011.08.008
Suborbits of a point stabilizer in the orthogonal group on the last subconstituent of orthogonal dual polar graphs
  • Aug 27, 2011
  • Linear Algebra and its Applications
  • Fenggao Li + 3 more

Suborbits of a point stabilizer in the orthogonal group on the last subconstituent of orthogonal dual polar graphs

  • Research Article
  • 10.1134/s0081543817090243
On the Local Structure of Mathon Distance-Regular Graphs
  • Dec 1, 2017
  • Proceedings of the Steklov Institute of Mathematics
  • L Yu Tsiovkina

We study the structure of local subgraphs of distance-regular Mathon graphs of even valency. We describe some infinite series of locally Δ-graphs of this family, where Δ is a strongly regular graph that is the union of affine polar graphs of type “–,” a pseudogeometric graph for p G l (s, l), or a graph of rank 3 realizable by means of the van Lint–Schrijver scheme. We show that some Mathon graphs are characterizable by their intersection arrays in the class of vertex-transitive graphs.

  • PDF Download Icon
  • Research Article
  • Cite Count Icon 56
  • 10.1103/physrevresearch.3.013023
Minimal model of many-body localization
  • Jan 8, 2021
  • Physical Review Research
  • F Monteiro + 3 more

We present a fully analytical description of a many body localization (MBL) transition in a microscopically defined model. Its Hamiltonian is the sum of one- and two-body operators, where both contributions obey a maximum-entropy principle and have no symmetries except hermiticity (not even particle number conservation). These two criteria paraphrase that our system is a variant of the Sachdev-Ye-Kitaev (SYK) model. We will demonstrate how this simple `zero-dimensional' system displays numerous features seen in more complex realizations of MBL. Specifically, it shows a transition between an ergodic and a localized phase, and non-trivial wave function statistics indicating the presence of `non-ergodic extended states'. We check our analytical description of these phenomena by parameter free comparison to high performance numerics for systems of up to $N=15$ fermions. In this way, our study becomes a testbed for concepts of high-dimensional quantum localization, previously applied to synthetic systems such as Cayley trees or random regular graphs. We believe that this is the first many body system for which an effective theory is derived and solved from first principles. The hope is that the novel analytical concepts developed in this study may become a stepping stone for the description of MBL in more complex systems.

Save Icon
Up Arrow
Open/Close
Notes

Save Important notes in documents

Highlight text to save as a note, or write notes directly

You can also access these Documents in Paperpal, our AI writing tool

Powered by our AI Writing Assistant