3 papers
math.CO2025
Computing the number of realisations of a rigid graph
Sean Dewar, Georg Grasegger, Josef Schicho +2
A graph is said to be rigid if, given a generic realisation of the graph as a bar-and-joint framework in the plane, there exist only finitely many other realisations of the graph w…
stat.ML2025
Positivity sets of hinge functions
Josef Schicho, Ayush Kumar Tewari, Audie Warren
In this paper we investigate which subsets of the real plane are realisable as the set of points on which a one-layer ReLU neural network takes a positive value. In the case of con…
math.MG2025
On the Genus of One Degree of Freedom Planar Linkages via Tropical Geometry
Josef Schicho, Ayush Kumar Tewari, Audie Warren
This paper focuses on studying the configuration spaces of graphs realised in , such that the configuration space is, after normalisation, one dimensional. If this is…