Combinatorial Yang–Baxter Maps

• Combinatorial Yang–Baxter maps are algebraic transformations derived from the Yang–Baxter equation and combinatorial group theory concepts.
• They are constructed through dynamical braces that integrate abelian groups, right-distributive multiplications, and update maps to produce parameter-dependent solutions.
• By encoding brace data as affine group subsets and digraphs, these maps facilitate the classification of non-involutive set-theoretic YBE solutions and connect with integrable systems.

A combinatorial Yang–Baxter map is a set-theoretic or algebraic transformation associated with the Yang–Baxter equation (YBE), whose core data and structure are rooted in combinatorial and algebraic group theory, discrete algebraic systems, or finite model theory. The terminology "combinatorial" refers to maps that are usually bijective and admit concrete, often algorithmic descriptions, frequently in terms of actions on finite sets, tableaux, discrete groupoids, or permutation structures. In the context of dynamical YBE and the related structure of dynamical braces, these maps encapsulate dynamical, parameter-dependent solutions to the YBE, organized by the underlying combinatorics of group actions, affine automorphism groups, or digraphs. Combinatorial Yang–Baxter maps facilitate the construction and classification of set-theoretic, often non-involutive, YBE solutions, illuminate the algebraic-geometric foundations of brace theory, and serve as foundational objects in quantum algebra, integrable discrete systems, and crystal combinatorics.

1. Dynamical Braces and the Definition of Combinatorial Yang–Baxter Maps

A dynamical brace (d-brace) consists of an abelian group $(A,+)$, a non-empty set $H$ of "dynamical parameters," a family of right-distributive but generally non-associative multiplications $$\{\cdot_{\lambda}\}_{\lambda\in H}: A\times A \to A$$, and an "update" map $\phi: H\times A \to H$. The system $(A,H,\phi;+, \{\cdot_\lambda\})$ is a d-brace if and only if it satisfies:

• Right-distributivity:

$$(a+b)\cdot_\lambda c = a\cdot_\lambda c + b\cdot_\lambda c$$

• Dynamical compatibility:

$$a\cdot_\lambda\left(b\cdot_{\phi(\lambda,c)} c + b + c\right) = \left(a\cdot_{\phi(\lambda,c)} b\right) \cdot_\lambda c + a\cdot_{\phi(\lambda,c)}b + a\cdot_\lambda c$$

• Right-quasigroup (bijection): For each $\lambda\in H$, $b\in A$, set $\gamma_\lambda(b)(a) = a + a\cdot_\lambda b$; then $H$0 is a bijection.

Given a d-brace, one defines the associated (dynamical) Yang–Baxter map for each $H$1,

$H$2

which satisfies

• the dynamical YBE,
• right-nondegeneracy, and
• unitary condition $H$3 for each $H$4.

These constructions generalize the classical brace approach (recoverable as $H$5) and encompass non-involutive and parameter-dependent solutions.

Significance: The d-brace framework locates combinatorial Yang–Baxter maps at the intersection of group-theoretic automorphisms, quasigroup theory, and combinatorial correspondence, enabling systematic classification of such maps in terms of combinatorial data (Matsumoto, 2011).

2. Combinatorial Correspondence: Affine Group Subsets and Digraphs

A central combinatorial feature is the equivalence between d-braces and certain families of subsets in the affine group $H$6. For each dynamical parameter $H$7,

$H$8

with the property

• for every $H$9, $$\{\cdot_{\lambda}\}_{\lambda\in H}: A\times A \to A$$0,
• for each $$\{\cdot_{\lambda}\}_{\lambda\in H}: A\times A \to A$$1, a unique $$\{\cdot_{\lambda}\}_{\lambda\in H}: A\times A \to A$$2.

This realizes an explicit combinatorial encoding: the parameters $$\{\cdot_{\lambda}\}_{\lambda\in H}: A\times A \to A$$3 are vertices in a digraph, and the edges from $$\{\cdot_{\lambda}\}_{\lambda\in H}: A\times A \to A$$4 to $$\{\cdot_{\lambda}\}_{\lambda\in H}: A\times A \to A$$5 are labeled by $$\{\cdot_{\lambda}\}_{\lambda\in H}: A\times A \to A$$6. This encoding systematizes the entire family of multiplications $$\{\cdot_{\lambda}\}_{\lambda\in H}: A\times A \to A$$7 and the update map $$\{\cdot_{\lambda}\}_{\lambda\in H}: A\times A \to A$$8 and thereby concretely represents the associated family of Yang–Baxter maps.

Context: The combinatorial-to-brace correspondence, which specializes to Rump's classification in the ordinary brace case, is proven as a bijection [(Matsumoto, 2011), Theorem 4.1].

3. Classification Theory and Structural Theorems

Key results in the classification and construction of combinatorial Yang–Baxter maps in this formalism include:

• Automorphism data equivalence: Specifying a family of automorphisms $$\{\cdot_{\lambda}\}_{\lambda\in H}: A\times A \to A$$9 satisfying

$\phi: H\times A \to H$0

is equivalent to specifying a d-brace. The corresponding $\phi: H\times A \to H$1 then solves the dynamical YBE [(Matsumoto, 2011), Theorem 3.2].

• Affine group subset characterization: The regularity-translation conditions for the sets $\phi: H\times A \to H$2 (existence/uniqueness and translation by edge labeling) completely characterize d-brace data [(Matsumoto, 2011), Theorem 4.1].
• Reduction to the classical case: If $\phi: H\times A \to H$3, the theory collapses to ordinary braces and their well-known correspondence to regular subgroups of the affine group.

These regulatory and bijective properties enable the complete construction of all combinatorial Yang–Baxter maps arising from a given d-brace structure.

4. Explicit Algebraic and Combinatorial Examples

Field case:

Let $\phi: H\times A \to H$4 be a field. Define

$\phi: H\times A \to H$5

This yields a multiplication

$\phi: H\times A \to H$6

with the corresponding Yang–Baxter map

$\phi: H\times A \to H$7

Finite case ($\phi: H\times A \to H$8):

Set $\phi: H\times A \to H$9, $(A,H,\phi;+, \{\cdot_\lambda\})$0 with $(A,H,\phi;+, \{\cdot_\lambda\})$1. Several non-isomorphic d-braces correspond to different assignments of the subsets $(A,H,\phi;+, \{\cdot_\lambda\})$2, e.g.

$(A,H,\phi;+, \{\cdot_\lambda\})$3

The combinatorial structure is encoded by the labeled cubic digraph on four vertices $(A,H,\phi;+, \{\cdot_\lambda\})$4, with three outgoing labeled edges per vertex. Full extraction of brace data and YB-maps is algorithmically realized from this graph.

Interpretation: In all cases, the mapping between algebraic data, affine-group structures, and directed graphs underpins the combinatorial realization of the Yang–Baxter property (Matsumoto, 2011).

5. Structural Implications and Dynamical Features

Several broader consequences are evident from the combinatorial brace theory:

• The brace structure ensures right-nondegeneracy, unitary (involutive) property, and explicit invertibility of $(A,H,\phi;+, \{\cdot_\lambda\})$5.
• The labeled digraph effectively encodes not only the YBE solution but also the entire parameter dynamics, a key aspect in applications to dynamical (rather than static) integrable systems.
• For $(A,H,\phi;+, \{\cdot_\lambda\})$6, the combinatorial formalism is mathematically equivalent to the brace and regular affine group subgroup correspondence, highlighting the distinction in dynamical extensions.

Further insight: The formalism supports complete classification and construction protocols for all (finite and infinite) combinatorial Yang–Baxter maps arising via the dynamical brace mechanism, accommodating non-involutive, parameter-dependent, and rich structural generalizations. Consequences extend to the study of left or right nondegenerate idempotent solutions and their semigroup decompositions, as in the parallel traditions of set-theoretic YBE theory (Colazzo et al., 2022).

6. Relationship to Broader Research Contexts

Combinatorial Yang–Baxter maps arising from d-braces intertwine:

• Algebraic combinatorics of groups, automorphisms, and affine group actions.
• Discrete integrability via parameter-dependent YBE and its combinatorial realization as finite digraph dynamics.
• The unification of brace-based, semigroup, and set-theoretic YBE solutions, encompassing both involutive and non-involutive regimes.

Connections exist to quantum groups, ring-theoretic properties (e.g., structure algebra properties of semigroups associated to idempotent solutions (Colazzo et al., 2022)), and combinatorial models in integrable systems, such as the crystal basis and box-ball systems.

Summary Table: Core Correspondences

Structure	Combinatorial Object	Functionality
D-brace $(A,H,\phi;+, \{\cdot_\lambda\})$7	Family $(A,H,\phi;+, \{\cdot_\lambda\})$8 of subsets $(A,H,\phi;+, \{\cdot_\lambda\})$9	Encodes multiplications and $$(a+b)\cdot_\lambda c = a\cdot_\lambda c + b\cdot_\lambda c$$0 via affine group data
Multiplications $$(a+b)\cdot_\lambda c = a\cdot_\lambda c + b\cdot_\lambda c$$1	Regular subsets & labeled digraph	Labels and dynamical transitions between $$(a+b)\cdot_\lambda c = a\cdot_\lambda c + b\cdot_\lambda c$$2
Update map $$(a+b)\cdot_\lambda c = a\cdot_\lambda c + b\cdot_\lambda c$$3	Edges in parameter digraph	Connects vertices according to $$(a+b)\cdot_\lambda c = a\cdot_\lambda c + b\cdot_\lambda c$$4 and brace structure
Yang–Baxter map $$(a+b)\cdot_\lambda c = a\cdot_\lambda c + b\cdot_\lambda c$$5	Permutational map inferred from $$(a+b)\cdot_\lambda c = a\cdot_\lambda c + b\cdot_\lambda c$$6	Satisfies dynamical YBE, nondegeneracy, involutivity

The combinatorial framework for dynamical Yang–Baxter maps realized via d-braces provides a transparent, algorithmic, and structure-preserving paradigm, combining algebraic and combinatorial techniques for classification, explicit construction, and theoretical investigation of set-theoretic and parameter-dependent YBE solutions (Matsumoto, 2011).