Jan Legerský
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jan Legerský has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Georg Grasegger
Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences, Linz, Austria
6 shared publications - Matteo Gallet
Johannes Kepler University
3 shared publications - Josef Schicho
Research Institute for Symbolic Computation, Johannes Kepler University, Hagenberg im Mhlkreis, Austria
2 shared publications Elias Tsigaridas
Sorbonne Université, CNRS, Inria, Paris, France
1 shared publication- Evangelos Bartzos
“Athena” Research Center, Maroussi, Greece
1 shared publication Ioannis Z. Emiris
National Kapodistrian University of Athens & ATHENA Research Center, Athens, Greece
1 shared publication
Latest Publications
- Open Access
- 15 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 52 (3) , 1-22
PyRigi — a general-purpose Python package for the rigidity and flexibility of bar-and-joint frameworks
We present PyRigi , a novel Python package designed to study the rigidity properties of graphs and frameworks. Among many other capabilities, PyRigi can determine whether a graph admits only finitely many ways, up to isometries, of placing the vertices in the plane so that the corresponding edge lengths are not altered, it can check whether the graph satisfies such a property even after the removal of any of its edges, and whether is has a unique vertex placement. By implementing algorithms from the scientific literature, PyRigi enables the exploration of rigidity properties of structures that would be out of reach for computations by hand. With reliable and robust algorithms, as well as clear, well-documented methods that are closely connected to the underlying mathematical definitions and results, PyRigi aims to be a practical and powerful general-purpose tool for the working mathematician interested in rigidity theory. PyRigi is open source and easy to use, and awaits researchers to benefit from its computational potential.
- 15 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 52 (3) , 1-22
Open AccessPyRigi — a general-purpose Python package for the rigidity and flexibility of bar-and-joint frameworks
We present PyRigi , a novel Python package designed to study the rigidity properties of graphs and frameworks. Among many other capabilities, PyRigi can determine whether a graph admits only finitely many ways, up to isometries, of placing the vertices in the plane so that the corresponding edge lengths are not altered, it can check whether the graph satisfies such a property even after the removal of any of its edges, and whether is has a unique vertex placement. By implementing algorithms from the scientific literature, PyRigi enables the exploration of rigidity properties of structures that would be out of reach for computations by hand. With reliable and robust algorithms, as well as clear, well-documented methods that are closely connected to the underlying mathematical definitions and results, PyRigi aims to be a practical and powerful general-purpose tool for the working mathematician interested in rigidity theory. PyRigi is open source and easy to use, and awaits researchers to benefit from its computational potential.
- 27 September 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 324, 1-17
Flexing infinite frameworks with applications to braced Penrose tilings
- 27 September 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 324, 1-17
Flexing infinite frameworks with applications to braced Penrose tilings
- 15 February 2021
- Published by MathDoc/Centre Mersenne in Comptes Rendus Mathematique
- Vol. 359 (1) , 7-38
Combinatorics of Bricard’s octahedra
We re-prove the classification of motions of an octahedron — obtained by Bricard at the beginning of the XX century — by means of combinatorial objects satisfying some elementary rules. The explanations of these rules rely on the use of a well-known creation of modern algebraic geometry, the moduli space of stable rational curves with marked points, for the description of configurations of graphs on the sphere. Once one accepts the objects and the rules, the classification becomes elementary (though not trivial) and can be enjoyed without the need of a very deep background on the topic.
- 15 February 2021
- Published by MathDoc/Centre Mersenne in Comptes Rendus Mathematique
- Vol. 359 (1) , 7-38
Combinatorics of Bricard’s octahedra
We re-prove the classification of motions of an octahedron — obtained by Bricard at the beginning of the XX century — by means of combinatorial objects satisfying some elementary rules. The explanations of these rules rely on the use of a well-known creation of modern algebraic geometry, the moduli space of stable rational curves with marked points, for the description of configurations of graphs on the sphere. Once one accepts the objects and the rules, the classification becomes elementary (though not trivial) and can be enjoyed without the need of a very deep background on the topic.
- 6 June 2020
- Vol. 12097, 442-450
FlexRiLoG—A SageMath Package for Motions of Graphs
In this paper we present the SageMath package FlexRiLoG (short for flexible and rigid labelings of graphs). Based on recent results the software generates motions of graphs using special edge colorings. The package computes and illustrates the colorings and the motions. We present the structure and usage of the package.
- 6 June 2020
- Vol. 12097, 442-450
FlexRiLoG—A SageMath Package for Motions of Graphs
In this paper we present the SageMath package FlexRiLoG (short for flexible and rigid labelings of graphs). Based on recent results the software generates motions of graphs using special edge colorings. The package computes and illustrates the colorings and the motions. We present the structure and usage of the package.
- Open Access
Combinatorics of Bricard's octahedra
We re-prove the classification of flexible octahedra, obtained by Bricard at the beginning of the XX century, by means of combinatorial objects satisfying some elementary rules. The explanations of these rules rely on the use of a well-known creation of modern algebraic geometry, the moduli space of stable rational curves with marked points, for the description of configurations of graphs on the sphere. Once one accepts the objects and the rules, the classification becomes elementary (though not trivial) and can be enjoyed without the need of a very deep background on the topic.
Open AccessCombinatorics of Bricard's octahedra
We re-prove the classification of flexible octahedra, obtained by Bricard at the beginning of the XX century, by means of combinatorial objects satisfying some elementary rules. The explanations of these rules rely on the use of a well-known creation of modern algebraic geometry, the moduli space of stable rational curves with marked points, for the description of configurations of graphs on the sphere. Once one accepts the objects and the rules, the classification becomes elementary (though not trivial) and can be enjoyed without the need of a very deep background on the topic.
- 1 November 2019
- Published by Elsevier in Theoretical Computer Science
- Vol. 795, 547-569
Construction of algorithms for parallel addition in expanding bases via Extending Window Method
- 1 November 2019
- Published by Elsevier in Theoretical Computer Science
- Vol. 795, 547-569
Construction of algorithms for parallel addition in expanding bases via Extending Window Method
- Open Access
Minimal non-integer alphabets allowing parallel addition
Parallel addition, i.e., addition with limited carry propagation, has been so far studied for complex bases and integer alphabets. We focus on alphabets consisting of integer combinations of powers of the base. We give necessary conditions on the alphabet allowing parallel addition. Under certain assumptions, we prove the same lower bound on the size of the generalized alphabet that is known for alphabets consisting of consecutive integers. We also extend the characterization of bases allowing parallel addition to numeration systems with non-integer alphabets.
Open AccessMinimal non-integer alphabets allowing parallel addition
Parallel addition, i.e., addition with limited carry propagation, has been so far studied for complex bases and integer alphabets. We focus on alphabets consisting of integer combinations of powers of the base. We give necessary conditions on the alphabet allowing parallel addition. Under certain assumptions, we prove the same lower bound on the size of the generalized alphabet that is known for alphabets consisting of consecutive integers. We also extend the characterization of bases allowing parallel addition to numeration systems with non-integer alphabets.
- Open Access
- 31 October 2018
- Published by Czech Technical University in Prague - Central Library in Acta Polytechnica
- Vol. 58 (5) , 285-291
MINIMAL NON-INTEGER ALPHABETS ALLOWING PARALLEL ADDITION
Parallel addition, i.e., addition with limited carry propagation has been so far studied for complex bases and integer alphabets. We focus on alphabets consisting of integer combinations of powers of the base. We give necessary conditions on the alphabet allowing parallel addition. Under certain assumptions, we prove the same lower bound on the size of the generalized alphabet that is known for alphabets consisting of consecutive integers. We also extend the characterization of bases allowing parallel addition to numeration systems with non-integer alphabets.
- 31 October 2018
- Published by Czech Technical University in Prague - Central Library in Acta Polytechnica
- Vol. 58 (5) , 285-291
Open AccessMINIMAL NON-INTEGER ALPHABETS ALLOWING PARALLEL ADDITION
Parallel addition, i.e., addition with limited carry propagation has been so far studied for complex bases and integer alphabets. We focus on alphabets consisting of integer combinations of powers of the base. We give necessary conditions on the alphabet allowing parallel addition. Under certain assumptions, we prove the same lower bound on the size of the generalized alphabet that is known for alphabets consisting of consecutive integers. We also extend the characterization of bases allowing parallel addition to numeration systems with non-integer alphabets.
- 5 September 2018
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 62 (2) , 461-480
Graphs with Flexible Labelings
- 5 September 2018
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 62 (2) , 461-480
Graphs with Flexible Labelings