Related papers: A User's Guide to the Mapping Class Group: Once Pu…
The increasing size of neural networks has led to a growing demand for methods of efficient fine-tuning. Recently, an orthogonal fine-tuning paradigm was introduced that uses orthogonal matrices for adapting the weights of a pretrained…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…
Let $S$ be a planar $n$-point set. A triangulation for $S$ is a maximal plane straight-line graph with vertex set $S$. The Voronoi diagram for $S$ is the subdivision of the plane into cells such that all points in a cell have the same…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…
Closed formulae for all Gaussian or optimal, 1-parameter quadrature rules in a compact interval [a, b] with non uniform, asymmetric subintervals, arbitrary number of nodes per subinterval for the spline classes $S_{2N, 0}$ and $S_{2N+1,…
We show that several families of asymptotically rigid mapping class groups arise as explicit quotients of the fundamental group of a graph of groups, with mapping class groups as vertex and edge stabilizers. Using this description, and…
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented…
The ruled surface is a typical modeling surface in computer aided geometric design. It is usually given in the standard parametric form. However, it can also be in the forms than the standard one. For these forms, it is necessary to…
Symmetry is an implicit objective in structural form-finding that often reconciles efficiency and aesthetics. This paper identifies the symmetry of polyhedral diagrams in three-dimensional graphic statics (3DGS) as point groups and…
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…
Algorithms operating on real numbers are implemented as floating-point computations in practice, but floating-point operations introduce roundoff errors that can degrade the accuracy of the result. We propose $\Lambda_{num}$, a functional…
O-categories generalize categories of domains to provide just the structure required to compute fixed points of locally continuous functors. Parametrized fixed points are of particular interest to denotational semantics and are often given…
The extended mapping class group of a surface $\Sigma$ is defined to be the group of isotopy classes of (not necessarily orientation-preserving) homeomorphisms of $\Sigma$. We are able to show that the extended mapping class group of an…
A classical approach for surface classification is to find a compact algebraic representation for each surface that would be similar for objects within the same class and preserve dissimilarities between classes. We introduce Self…
Let $S_{g,1,p}$ be an orientable surface of genus $g$ with one boundary component and $p$ punctures. Let $\mathcal{M}_{g,1,p}$ be the mapping-class group of $S_{g,1,p}$ relative to the boundary. We construct homomorphisms…
We present a survey of results on word equations in simple groups, as well as their analogues and generalizations, which were obtained over the past decade using various methods, group-theoretic and coming from algebraic and arithmetic…
We describe an algorithm which, given two essential curves on a surface $S$, computes their distance in the curve graph of $S$, up to multiplicative and additive errors. As an application, we present an algorithm to decide the…
This is a review of [Michor, Peter W.: The moment mapping for a unitary representation, Ann. Global Anal. Geometry, 8, No 3(1990), 299--313] including a careful description of calculus in infinite dimensions. For any unitary representation…