EUVIMEDEUVIMED entdecken
Crossref

An algebraic resolution of the ELSP via group actions in directed Paley graphs

Zhour Oumazouz

Journal of Combinatorial Mathematics and Combinatorial Computing · 14.03.2026 · 130 · 165-185

DOI: 10.61091/jcmcc130-12 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 14.03.2026. Verfasst von Zhour Oumazouz.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study the Equivalent Local Sequence Problem (ELSP), which consists in recovering an explicit sequence of local complementations that transforms a graph into a locally equivalent one. Focusing on directed Paley graphs, we establish that local complementations commute and induce a free action of an elementary abelian 2-group. The stabilizer condition is reformulated as a system of convolution equations and analyzed through Fourier techniques over finite fields, leading to a proof of stabilizer triviality. As a consequence, each graph in the orbit admits a unique subset encoding, and ELSP reduces to solving a linear inversion problem over 𝔽2. This characterization completely resolves ELSP for directed Paley graphs, provides a polynomial-time inversion algorithm and highlights structural features that may support future developments in cryptographic frameworks and quantum graph-state models.

Zitieren

APA

Oumazouz, Z. (2026). An algebraic resolution of the ELSP via group actions in directed Paley graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 130, 165-185. https://doi.org/10.61091/jcmcc130-12

Vancouver

Oumazouz Z. An algebraic resolution of the ELSP via group actions in directed Paley graphs. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;130:165-185. doi:10.61091/jcmcc130-12

BibTeX
@article{Oumazouz2026,
  author = {Oumazouz, Zhour},
  title = {An algebraic resolution of the ELSP via group actions in directed Paley graphs},
  journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
  year = {2026},
  volume = {130},
  pages = {165--185},
  doi = {10.61091/jcmcc130-12}
}
Kostenlos starten →