Diagonals of solutions of the Yang–Baxter equation

Abstract We study the diagonal mappings in non-involutive set-theoretic solutions of the Yang–Baxter equation. We show that, for non-degenerate solutions, they are commuting bijections. This gives the positive answer to the question: “Is every non-degenerate solution bijective?” of Cedó, Jespers and Verwimp. Additionally, we show that, for a subclass of solutions called k - permutational , only one-sided non-degeneracy suffices to prove that one of the diagonal mappings is invertible. We also present an equational characterization of multipermutation solutions and extend results of Rump, Gateva–Ivanova and Castelli, Mazzotta, Stefanelli about decomposability to non-involutive infinite case. In particular, we show that each, not necessarily involutive, square-free multipermutation solution of finite level and arbitrary cardinality, is always decomposable.

Authors

Institutions

Publication Details

Journal
Forum Mathematicum
Published
2025-05-29
DOI
https://doi.org/10.1515/forum-2024-0409
Citations
3
Primary Topic
Algebraic structures and combinatorial models
Type
article
Field-Weighted Citation Impact
12.26
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Diagonals of solutions of the Yang–Baxter equation

Agata Pilitowska, Přemysl Jedlička
3 citations
Forum Mathematicum
Algebraic structures and combinatorial models
12.26
article

Diagonals of solutions of the Yang–Baxter equation

Agata Pilitowska, Přemysl Jedlička
article en
3 citations

Abstract

Abstract We study the diagonal mappings in non-involutive set-theoretic solutions of the Yang–Baxter equation. We show that, for non-degenerate solutions, they are commuting bijections. This gives the positive answer to the question: “Is every non-degenerate solution bijective?” of Cedó, Jespers and Verwimp. Additionally, we show that, for a subclass of solutions called k - permutational , only one-sided non-degeneracy suffices to prove that one of the diagonal mappings is invertible. We also present an equational characterization of multipermutation solutions and extend results of Rump, Gateva–Ivanova and Castelli, Mazzotta, Stefanelli about decomposability to non-involutive infinite case. In particular, we show that each, not necessarily involutive, square-free multipermutation solution of finite level and arbitrary cardinality, is always decomposable.

Forum Mathematicum
Warsaw University of Technology (PL), Czech University of Life Sciences Prague (CZ)
Openalex Percentile: Top 1%
Algebraic structures and combinatorial models
12.26
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.