On Word Representations and Embeddings in Complex Matrices

Paul C. Bell , George Kenison , Reino Niskanen , Igor Potapov , Pavel Semukhin

Authors on Pith no claims yet

Pith reviewed 2026-05-10 08:50 UTC · model grok-4.3

classification 💻 cs.FL cs.DMmath.GRmath.RT

keywords matrixsemigroupsembeddingsrepresentationswordcomplexgroupslow-dimensional

0 comments

The pith

New techniques are constructed for word representations of Euclidean Bianchi groups inside 2x2 complex matrices, offering a framework for decision problems in matrix semigroups.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Words are sequences of symbols that can be multiplied according to rules. The authors map these sequences into 2-by-2 grids of complex numbers so that multiplication of words matches matrix multiplication. They focus on special groups called Euclidean Bianchi groups, which arise in geometry and number theory. The resulting matrix representations give a concrete way to study properties of the words using tools from linear algebra rather than abstract rules alone.

Core claim

These representations provide a symbolic framework and a natural first step towards analysing fundamental decision problems in 2x2 matrix semigroups.

Load-bearing premise

That the Euclidean Bianchi groups admit faithful representations into low-dimensional matrix semigroups over the complex numbers and that the new construction techniques succeed without violating known non-embeddability results for free semigroups.

read the original abstract

Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose strong structural restrictions on possible embeddings. Certain finitely generated groups admit faithful representations in SL(2, C) and other similar matrix groups. On the other hand, it is known that the product of two free semigroups on two generators cannot be embedded into the 2x2 complex matrices. In this paper we study embeddings of word structures into low-dimensional matrix semigroups over the complex numbers and develop new techniques for constructing word representations of the Euclidean Bianchi groups. These representations provide a symbolic framework and a natural first step towards analysing fundamental decision problems in 2x2 matrix semigroups.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper offers targeted constructions for embedding Euclidean Bianchi groups into 2x2 complex matrices while respecting known semigroup limits, but the lack of explicit examples leaves the actual advance hard to gauge.

read the letter

The main takeaway is that the authors have worked out new ways to represent words from Euclidean Bianchi groups inside 2x2 matrices over the complexes. They start from the known fact that certain groups embed into SL(2,C) and then build techniques that stay clear of the product of two free 2-generator semigroups, which cannot live in these matrices. That framing is useful because it directly ties combinatorics on words to the structural constraints of low-dimensional matrix semigroups and sets up a route toward decision problems like the mortality or identity problem in the resulting semigroups. They do a clean job of stating the background restrictions up front and treating the representations as a first symbolic step rather than a complete solution. The connection to Bianchi groups is specific enough that it could help people already working on those groups or on matrix semigroup algorithms. The soft spot is that the abstract and available text give no concrete matrices, no generator images, and no proof sketches. Without those, it is impossible to check whether the new techniques actually produce faithful embeddings or whether they simply restate prior SL(2,C) results in different language. The scope is also narrow by design, limited to 2x2 complexes and Euclidean Bianchi groups, so the broader payoff for arbitrary matrix semigroups remains speculative. This is the kind of paper that belongs in a specialized journal on automata or combinatorial algebra. A reader who already cares about word problems in matrix semigroups or about Bianchi groups will get value from the approach even if the details need filling in. I would send it to peer review; the topic is coherent and the authors appear to have engaged with the relevant non-embeddability facts, so referees can ask for the missing constructions and decide on the strength of the claims.

Referee Report

1 major / 0 minor

Summary. The manuscript studies embeddings of word structures into low-dimensional matrix semigroups over the complex numbers. It develops new techniques for constructing word representations of the Euclidean Bianchi groups, which are claimed to provide a symbolic framework and a natural first step towards analysing fundamental decision problems in 2x2 matrix semigroups. The work notes that certain finitely generated groups admit faithful representations in SL(2,C) and acknowledges the known result that the product of two free semigroups on two generators cannot be embedded into the 2x2 complex matrices.

Significance. If the constructions yield faithful embeddings that are compatible with known non-embeddability results, the paper would usefully connect combinatorics on words with linear algebra over C, potentially enabling new approaches to decision problems in matrix semigroups. The grounding in established facts about group representations is a positive aspect.

major comments (1)

Abstract: The central claim that the new representations supply a symbolic framework for decision problems in 2x2 matrix semigroups depends on the embeddings being faithful and free of the forbidden substructure (the product of two free 2-generator semigroups). The abstract provides no indication of how the construction techniques ensure this compatibility, which is load-bearing for the validity of the claimed applications.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only abstract available; no explicit free parameters, axioms, or invented entities can be identified.

pith-pipeline@v0.9.0 · 5440 in / 935 out tokens · 33226 ms · 2026-05-10T08:50:22.011753+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

28 extracted references · 18 canonical work pages

[1]

Journal of Number Theory121(2), 305–323 (2006)

Bayer Fluckiger, E.: Upper bounds for Euclidean minima of algebraic number fields. Journal of Number Theory121(2), 305–323 (2006). https://doi.org/10.1016/j.jnt.2006.03.002

work page doi:10.1016/j.jnt.2006.03.002 2006
[2]

In: Klein, P.N

Bell, P.C., Hirvensalo, M., Potapov, I.: The Identity Problem for Matrix Semi- groups in SL2(Z)is NP-complete. In: Klein, P.N. (ed.) Proceedings of the Twenty- Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pp. 187–206. SIAM (2017). https://doi.org/10.1137/1.9781611974782.13

work page doi:10.1137/1.9781611974782.13 2017
[3]

Fast semi-iterative finite ele- ment Poisson solvers for tensor core GPUs based on prehandling

Bell, P.C., Niskanen, R., Potapov, I., Semukhin, P.: On the Identity and Group Problems for Complex Heisenberg Matrices. In: Bournez, O., Formenti, E., Potapov, I. (eds.) Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings. Lecture Notes in Computer Sci- ence, vol. 14235, pp. 42–55. Springer (2023...

work page doi:10.1007/978-3-031- 2023
[4]

Information and Computation206(11), 1353–1361 (2008)

Bell, P.C., Potapov, I.: Reachability problems in quaternion matrix and ro- tation semigroups. Information and Computation206(11), 1353–1361 (2008). https://doi.org/10.1016/j.ic.2008.06.004

work page doi:10.1016/j.ic.2008.06.004 2008
[5]

Communications in Algebra 44(1), 265–278 (2016)

Button, J.O.: Groups and Embeddings in SL(2,C). Communications in Algebra 44(1), 265–278 (2016). https://doi.org/10.1080/00927872.2014.975347

work page doi:10.1080/00927872.2014.975347 2016
[6]

Journal of Algebra579, 237–255 (2021)

Campagnolo, C., Kammeyer, H.: Products of free groups in Lie groups. Journal of Algebra579, 237–255 (2021). https://doi.org/10.1016/j.jalgebra.2021.03.023

work page doi:10.1016/j.jalgebra.2021.03.023 2021
[7]

International Journal of Algebra and Computation9(03n04), 295–305 (1999)

Cassaigne, J., Harju, T., Karhumäki, J.: On the undecidability of freeness of matrix semigroups. International Journal of Algebra and Computation9(03n04), 295–305 (1999). https://doi.org/10.1142/S0218196799000199

work page doi:10.1142/s0218196799000199 1999
[8]

Informatics Appl.46(3), 355–399 (2012)

Cassaigne,J.,Nicolas,F.:Onthedecidabilityofsemigroupfreeness.RAIROTheor. Informatics Appl.46(3), 355–399 (2012). https://doi.org/10.1051/ITA/2012010

work page doi:10.1051/ita/2012010 2012
[9]

Cohen, H.: A course in computational algebraic number theory, vol. 138. Springer Science & Business Media (2013)

2013
[10]

AK Peters/CRC Press (2003)

Conway, J.H., Smith, D.A.: On Quaternions and Octonions. AK Peters/CRC Press (2003)

2003
[11]

Communication lower bounds for collision problems via density increment arguments

Dong, R.: Semigroup algorithmic problems in metabelian groups. In: Mohar, B., Shinkar, I., O’Donnell, R. (eds.) Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24-28, 2024. pp. 884–891. ACM (2024). https://doi.org/10.1145/3618260.3649609

work page doi:10.1145/3618260.3649609 2024
[12]

Dong, R.: Semigroup Intersection Problems in the Heisenberg Groups. SIAM J. Discret. Math.38(4), 3176–3197 (2024). https://doi.org/10.1137/23M1581467

work page doi:10.1137/23m1581467 2024
[13]

Canadian J

Dubois, D.W., Steger, A.: A note on division algorithms in imagi- nary quadratric number fields. Canadian J. Math.10, 285–286 (1958). https://doi.org/10.4153/CJM-1958-030-3

work page doi:10.4153/cjm-1958-030-3 1958
[14]

Fine, B.: The Picard group and the modular group, p. 150–163. London Mathe- matical Society Lecture Note Series, Cambridge University Press (1987)

1987
[15]

Fine, B.: Algebraic theory of the Bianchi groups, Monographs and Textbooks in Pure and Applied Mathematics, vol. 129. Marcel Dekker, Inc., New York (1989)

1989
[16]

Oxford University Press, Oxford, sixth edn

Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers. Oxford University Press, Oxford, sixth edn. (2008), revised by D. R. Heath-Brown and J. H. Silverman, With a foreword by Andrew Wiles

2008
[17]

American Mathematical Society, Providence, RI (2022) 14 P.C

Hatcher, A.: Topology of numbers. American Mathematical Society, Providence, RI (2022) 14 P.C. Bell et al

2022
[18]

https://doi.org/10.5281/zenodo.18939458

Kenison, G.: georgekenison/EuclidBianchiWordRep: EuclideanBianchiWordRepre- sentation (2026). https://doi.org/10.5281/zenodo.18939458

work page doi:10.5281/zenodo.18939458 2026
[19]

In: Proceedings of ICALP 2018

Ko, S.K., Niskanen, R., Potapov, I.: On the identity problem for the special linear group and the Heisenberg group. In: Proceedings of ICALP 2018. LIPIcs, vol. 107, pp. 132:1–132:15 (2018). https://doi.org/10.4230/lipics.icalp.2018.132

work page doi:10.4230/lipics.icalp.2018.132 2018
[20]

Exposi- tiones Mathematicae13, 385–416 (1 1995)

Lemmermeyer, F.: The Euclidean algorithm in algebraic number fields. Exposi- tiones Mathematicae13, 385–416 (1 1995)

1995
[21]

Interscience Publishers [John Wiley & Sons], New York-London-Sydney (1966)

Magnus, W., Karrass, A., Solitar, D.: Combinatorial group theory: Presentations of groups in terms of generators and relations. Interscience Publishers [John Wiley & Sons], New York-London-Sydney (1966)

1966
[22]

Journal of Differential Geometry2(4) (1968)

Milnor, J.: Growth of finitely generated solvable groups. Journal of Differential Geometry2(4) (1968). https://doi.org/10.4310/jdg/1214428659

work page doi:10.4310/jdg/1214428659 1968
[23]

Neukirch, J.: Algebraic number theory, Grundlehren der mathematischen Wis- senschaften [Fundamental Principles of Mathematical Sciences], vol. 322. Springer- Verlag, Berlin (1999). https://doi.org/10.1007/978-3-662-03983-0

work page doi:10.1007/978-3-662-03983-0 1999
[24]

Studies in Applied Mathematics 49(1), 105 (1970)

Paterson, M.S.: Unsolvability in3×3matrices. Studies in Applied Mathematics 49(1), 105 (1970). https://doi.org/10.1002/sapm1970491105

work page doi:10.1002/sapm1970491105 1970
[25]

Journal of Computer and System Sciences100, 30–43 (03 2019)

Potapov, I., Semukhin, P.: Vector and scalar reachability problems in SL(2,Z). Journal of Computer and System Sciences100, 30–43 (03 2019). https://doi.org/10.1016/j.jcss.2018.09.003

work page doi:10.1016/j.jcss.2018.09.003 2019
[26]

Springer New York (1995)

Rotman, J.J.: An Introduction to the Theory of Groups. Springer New York (1995). https://doi.org/10.1007/978-1-4612-4176-8

work page doi:10.1007/978-1-4612-4176-8 1995
[27]

CRC Press, Boca Raton, FL, fourth edn

Stewart, I., Tall, D.: Algebraic number theory and Fermat’s last theorem. CRC Press, Boca Raton, FL, fourth edn. (2016)

2016
[28]

Claim holds for matrices inPSL(2,Od)

The Sage Developers: SageMath, the Sage Mathematics Software System (Version 10.7) (2026),https://www.sagemath.org On Word Representations and Embeddings in Complex Matrices 15 A Background Material on Imaginary Quadratic Fields We have the following characterisation of the ring of algebraic integers in the imaginary quadratic fieldQ( √ −d)[27, Chapter 3]...

2026