Computer Algebra for Differential Equations

@techreport{RISC5977,
author = {M. Gallet and G. Grasegger and J. Legerský and J. Schicho},
title = {{On the existence of paradoxical motions of generically rigid graphs on the sphere}},
language = {english},
year = {2019},
institution = {arXiv},
length = {40},
url = {https://arxiv.org/abs/1908.00467}
}

@techreport{RISC6071,
author = {G. Grasegger and J. Legerský and J. Schicho},
title = {{On the Classification of Motions of Paradoxically Movable Graphs}},
language = {english},
year = {2019},
institution = {-},
length = {0}
}

@techreport{RISC5418,
author = {Jose Capco and Georg Grasegger and Matteo Gallet and Christoph Koutschan and Niels Lubbes and Josef Schicho},
title = {{The number of realizations of a Laman graph}},
language = {english},
abstract = {Laman graphs model planar frameworks that are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. Such realizations can be seen as solutions of systems of quadratic equations prescribing the distances between pairs of points. Using ideas from algebraic and tropical geometry, we provide a recursion formula for the number of complex solutions of such systems. },
year = {2017},
institution = {Research Institute for Symbolic Computation (RISC/JKU)},
length = {42},
url = {http://www.koutschan.de/data/laman/}
}

@techreport{RISC5485,
author = {Alexander Brunhuemer},
title = {{Validating the Formalization of Theories and Algorithms of Discrete Mathematics by the Computer-Supported Checking of Finite Models}},
language = {english},
abstract = {The goal of this Bachelor’s thesis is the formal specification and implementation of centraltheories and algorithms in the field of discrete mathematics by using the RISC AlgorithmLanguage (RISCAL), developed at the Research Institute for Symbolic Computation (RISC).This specification language and associated software system allow the verification of specifications,by using the concept of finite model checking. Validation on finite models is intendedto serve as a foundation layer for further research on the corresponding generalized theorieson infinite models.This thesis results in a collection of specifications of exemplarily chosen formalized algorithmsof set theory, relation and function theory and graph theory. The algorithms arespecified in different ways (implicit, recursive and procedural), to emphasize the correspondingconnections between them.The evaluation and validation of implemented theories is demonstrated on Dijkstra’s algorithmfor finding a shortest path between vertices in a graph.},
year = {2017},
month = {September},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria},
length = {88},
type = {Bachelor Thesis}
}