Search arXivSearch

arXiv · 2004.04028

Set-theoretic solutions of the Pentagon Equation

Abstract

A set-theoretic solution of the Pentagon Equation on a non-empty set $S$ is a map $s\colon S^2\to S^2$ such that $s_{23}s_{13}s_{12}=s_{12}s_{23}$, where $s_{12}=s\times\mathrm{id}$, $s_{23}=\mathrm{id}\times s$ and $s_{13}=(\tau\times\mathrm{id})(\mathrm{id}\times s)(\tau\times\mathrm{id})$ are mappings from $S^3$ to itself and $\tau\colon S^2\to S^2$ is the flip map, i.e., $\tau (x,y) =(y,x)$. We give a description of all involutive solutions, i.e., $s^2=\mathrm{id}$. It is shown that such solutions are determined by a factorization of $S$ as direct product $X\times A \times G$ and a map $\sigma\colon A\to\mathrm{Sym}(X)$, where $X$ is a non-empty set and $A,G$ are elementary abelian $2$-groups. Isomorphic solutions are determined by the cardinalities of $A$, $G$ and $X$, i.e., the map $\sigma$ is irrelevant. In particular, if $S$ is finite of cardinality $2^n(2m+1)$ for some $n,m\geq 0$ then, on $S$, there are precisely $\binom{n+2}{2}$ non-isomorphic solutions of the Pentagon Equation.

Explore related subjects

Keep this discovery

BibTeXRIS

Ilaria Colazzo, Eric Jespers, Lukasz Kubat. 2020-04-08. Set-theoretic solutions of the Pentagon Equation. https://doi.org/10.1007/s00220-020-03862-6

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA