Alexis Langlois-Rémillard
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Alexis Langlois-Rémillard has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Roy Oste
Department of Applied Mathematics, Computer Science and Statistics, Faculty of Sciences, Ghent University, Gent, Belgium
4 shared publications - Hendrik De Bie
Ghent University
3 shared publications - Joris Van der Jeugt
Department of Mathematics, Computer Science and Statistics, Ghent University, Krijgslaan 281-S9, B-9000 Gent, Belgium
3 shared publications - Yvan Saint-Aubin
University of Montreal
2 shared publications - Érika Róldan2 shared publications
- Alexi Morin-Duchesne
Department of Applied Mathematics Computer Science Statistics Ghent University 9000 Ghent Belgium
1 shared publication
Latest Publications
- Open Access
- 7 May 2026
- Published by Springer Nature in Advances in Applied Clifford Algebras
- Vol. 36 (3) , 31
The Double Dihedral Dunkl Total Angular Momentum Algebra
The Dunkl total angular momentum algebra (TAMA) is realised as the dual partner of the orthosymplectic Lie superalgebra containing the Dunkl deformation of the Dirac operator. In this paper, we consider the case when the reflection group associated with the Dunkl operators is a product of two dihedral groups acting on a four-dimensional Euclidean space. We show that in this case there is a subalgebra of the total angular momentum algebra that admits a triangular decomposition. In analogy to the celebrated theory of semisimple Lie algebras, we use this triangular subalgebra to give precise necessary conditions that a finite-dimensional irreducible representation must obey, in terms of weights. In specific cases, which includes unitary representations, we construct a basis of weight vectors with explicit actions of all TAMA elements. Examples of these modules occur in the kernel of the Dunkl–Dirac operator in the context of deformations of Howe dual pairs.
- 7 May 2026
- Published by Springer Nature in Advances in Applied Clifford Algebras
- Vol. 36 (3) , 31
Open AccessThe Double Dihedral Dunkl Total Angular Momentum Algebra
The Dunkl total angular momentum algebra (TAMA) is realised as the dual partner of the orthosymplectic Lie superalgebra containing the Dunkl deformation of the Dirac operator. In this paper, we consider the case when the reflection group associated with the Dunkl operators is a product of two dihedral groups acting on a four-dimensional Euclidean space. We show that in this case there is a subalgebra of the total angular momentum algebra that admits a triangular decomposition. In analogy to the celebrated theory of semisimple Lie algebras, we use this triangular subalgebra to give precise necessary conditions that a finite-dimensional irreducible representation must obey, in terms of weights. In specific cases, which includes unitary representations, we construct a basis of weight vectors with explicit actions of all TAMA elements. Examples of these modules occur in the kernel of the Dunkl–Dirac operator in the context of deformations of Howe dual pairs.
- 5 May 2026
- Published by Taylor & Francis in Communications in Algebra
- p. 1-54
Uncoiled affine Temperley–Lieb algebras and their Wenzl–Jones projectors
- 5 May 2026
- Published by Taylor & Francis in Communications in Algebra
- p. 1-54
Uncoiled affine Temperley–Lieb algebras and their Wenzl–Jones projectors
- Open Access
- 8 February 2025
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 12 (1) , 1-26
Complexity of chess domination problems
We study different domination problems of attacking and non-attacking rooks and queens on polyominoes and polycubes of all dimensions. Our main result proves that maximum independent domination is NP-complete for non-attacking queens and for non-attacking rooks on polycubes of dimension three and higher. We also analyze these problems for polyominoes and convex polyominoes, conjecture the complexity classes, and provide a computer tool for investigation. We have also computed new values for classical queen domination problems on chessboards (square polyominoes). For our computations, we have translated the problem into an integer linear programming instance. Finally, using this computational implementation and the game engine Godot, we have developed a video game of minimum domination of queens and rooks on randomly generated polyominoes.
- 8 February 2025
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 12 (1) , 1-26
Open AccessComplexity of chess domination problems
We study different domination problems of attacking and non-attacking rooks and queens on polyominoes and polycubes of all dimensions. Our main result proves that maximum independent domination is NP-complete for non-attacking queens and for non-attacking rooks on polycubes of dimension three and higher. We also analyze these problems for polyominoes and convex polyominoes, conjecture the complexity classes, and provide a computer tool for investigation. We have also computed new values for classical queen domination problems on chessboards (square polyominoes). For our computations, we have translated the problem into an integer linear programming instance. Finally, using this computational implementation and the game engine Godot, we have developed a video game of minimum domination of queens and rooks on randomly generated polyominoes.
- Open Access
Insights from a workshop on gamification of research in mathematics and computer science
Can outreach inspire and lead to research and vice versa? In this work, we introduce our approach to the gamification of research in mathematics and computer science through three illustrative examples. We discuss our primary motivations and provide insights into what makes our proposed gamification effective for three research topics in discrete and computational geometry and topology: (1) DominatriX, an art gallery problem involving polyominoes with rooks and queens; (2) Cubical Sliding Puzzles, an exploration of the discrete configuration spaces of sliding puzzles on the $d$-cube with topological obstructions; and (3) The Fence Challenge, a participatory isoperimetric problem based on polyforms. Additionally, we report on the collaborative development of the game Le Carré du Diable, inspired by The Fence Challenge and created during the workshop Let's talk about outreach!, held in October 2022 in Les Diablerets, Switzerland. All of our outreach encounters and creations are designed and curated with an inclusive culture and a strong commitment to welcoming the most diverse audience possible.
Open AccessInsights from a workshop on gamification of research in mathematics and computer science
Can outreach inspire and lead to research and vice versa? In this work, we introduce our approach to the gamification of research in mathematics and computer science through three illustrative examples. We discuss our primary motivations and provide insights into what makes our proposed gamification effective for three research topics in discrete and computational geometry and topology: (1) DominatriX, an art gallery problem involving polyominoes with rooks and queens; (2) Cubical Sliding Puzzles, an exploration of the discrete configuration spaces of sliding puzzles on the $d$-cube with topological obstructions; and (3) The Fence Challenge, a participatory isoperimetric problem based on polyforms. Additionally, we report on the collaborative development of the game Le Carré du Diable, inspired by The Fence Challenge and created during the workshop Let's talk about outreach!, held in October 2022 in Les Diablerets, Switzerland. All of our outreach encounters and creations are designed and curated with an inclusive culture and a strong commitment to welcoming the most diverse audience possible.
- 26 September 2023
- Published by Springer Nature
- p. 591-612
Deforming Algebras with Anti-involution via Twisted Associativity
- 26 September 2023
- Published by Springer Nature
- p. 591-612
Deforming Algebras with Anti-involution via Twisted Associativity
- Open Access
Generalised symmetries and bases for Dunkl monogenics
We introduce a family of commuting generalised symmetries of the Dunkl--Dirac operator inspired by the Maxwell construction in harmonic analysis. We use these generalised symmetries to construct bases of the polynomial null-solutions of the Dunkl--Dirac operator. These polynomial spaces form representation spaces of the Dunkl--Dirac symmetry algebra. For the $\mathbb{Z}_2^d$ case, the results are compared with previous investigations.Open AccessGeneralised symmetries and bases for Dunkl monogenics
We introduce a family of commuting generalised symmetries of the Dunkl--Dirac operator inspired by the Maxwell construction in harmonic analysis. We use these generalised symmetries to construct bases of the polynomial null-solutions of the Dunkl--Dirac operator. These polynomial spaces form representation spaces of the Dunkl--Dirac symmetry algebra. For the $\mathbb{Z}_2^d$ case, the results are compared with previous investigations. - Open Access
Complexity of Chess Domination Problems
We study different domination problems of attacking and non-attacking rooks and queens on polyominoes and polycubes of all dimensions. Our main result proves that maximal domination is NP-complete for non-attacking queens and for non-attacking rooks on polycubes of dimension three and higher. We also analyse these problems for polyominoes and convex polyominoes, conjecture the complexity classes and provide a computer tool for investigation. We have also computed new values for classical queen domination problems on chessboards (square polyominoes). For our computations, we have translated the problem into an integer linear programming instance. Finally, using this computational implementation and the game engine Godot, we have developed a video game of minimal domination of queens and rooks on randomly generated polyominoes.
Open AccessComplexity of Chess Domination Problems
We study different domination problems of attacking and non-attacking rooks and queens on polyominoes and polycubes of all dimensions. Our main result proves that maximal domination is NP-complete for non-attacking queens and for non-attacking rooks on polycubes of dimension three and higher. We also analyse these problems for polyominoes and convex polyominoes, conjecture the complexity classes and provide a computer tool for investigation. We have also computed new values for classical queen domination problems on chessboards (square polyominoes). For our computations, we have translated the problem into an integer linear programming instance. Finally, using this computational implementation and the game engine Godot, we have developed a video game of minimal domination of queens and rooks on randomly generated polyominoes.
- 1 February 2022
- Published by Elsevier in Journal of Algebra
- Vol. 591, 170-216
Finite-dimensional representations of the symmetry algebra of the dihedral Dunkl–Dirac operator
- 1 February 2022
- Published by Elsevier in Journal of Algebra
- Vol. 591, 170-216
Finite-dimensional representations of the symmetry algebra of the dihedral Dunkl–Dirac operator
- 1 January 2022
- Published by Springer Nature
- p. 515-522
The Dihedral Dunkl–Dirac Symmetry Algebra with Negative Clifford Signature
- 1 January 2022
- Published by Springer Nature
- p. 515-522
The Dihedral Dunkl–Dirac Symmetry Algebra with Negative Clifford Signature
- Open Access
Finite-dimensional representations of the symmetry algebra of the dihedral Dunkl--Dirac operator
The Dunkl--Dirac operator is a deformation of the Dirac operator by means of Dunkl derivatives. We investigate the symmetry algebra generated by the elements supercommuting with the Dunkl--Dirac operator and its dual symbol. This symmetry algebra is realised inside the tensor product of a Clifford algebra and a rational Cherednik algebra associated with a reflection group or root system. For reducible root systems of rank three, we determine all the irreducible finite-dimensional representations and conditions for unitarity. Polynomial solutions of the Dunkl--Dirac equation are given as a realisation of one family of such irreducible unitary representations.
Open AccessFinite-dimensional representations of the symmetry algebra of the dihedral Dunkl--Dirac operator
The Dunkl--Dirac operator is a deformation of the Dirac operator by means of Dunkl derivatives. We investigate the symmetry algebra generated by the elements supercommuting with the Dunkl--Dirac operator and its dual symbol. This symmetry algebra is realised inside the tensor product of a Clifford algebra and a rational Cherednik algebra associated with a reflection group or root system. For reducible root systems of rank three, we determine all the irreducible finite-dimensional representations and conditions for unitarity. Polynomial solutions of the Dunkl--Dirac equation are given as a realisation of one family of such irreducible unitary representations.