Related papers: The free group in R
We give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…
Sets of solutions to finite systems of equations in a free group, are equivalent to sets of homomorphisms from a fixed f.p. group into a free group. The latter can be encoded in a diagram, the construction of which is valid also for f.g.…
fixest is an R package for fast and flexible econometric estimation. It provides a unified framework for applied research, with comprehensive support for a diverse class of models: ordinary least squares, instrumental variables, generalized…
We present a short tutorial on to the use of the R gasper package. Gasper is a package dedicated to signal processing on graphs. It also provides an interface to the SuiteSparse Matrix Collection.
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
We introduce pygrank, an open source Python package to define, run and evaluate node ranking algorithms. We provide object-oriented and extensively unit-tested algorithm components, such as graph filters, post-processors, measures,…
In rustworkx, we provide a high-performance, flexible graph library for Python. rustworkx is inspired by NetworkX but addresses many performance concerns of the latter. rustworkx is written in Rust and is particularly suited for…
We use methods from the cohomology of groups to describe the finite groups which can act freely and homologically trivially on closed 3-manifolds which are rational homology spheres.
This paper complements "Writing R Extensions," the official guide for writing R extensions, for those interested in developing R packages using Rust. It highlights idiosyncrasies of R and Rust that must be addressed by any integration and…
CARTAN is an easy-to-use symbolic, tensor component package based on the popular Mathematica program. CARTAN makes use of the powerful formalism of rigid frames, and can return results both in this frame and in the coordinate basis. CARTAN…
This article describes tsmp, an R package that implements the matrix profile concept for time series. The tsmp package is a toolkit that allows all-pairs similarity joins, motif, discords and chains discovery, semantic segmentation, etc.…
rollama is an R package that wraps the Ollama API, which allows you to run different Generative Large Language Models (GLLM) locally. The package and learning material focus on making it easy to use Ollama for annotating textual or imagine…
This report is an account of freely representable groups, which are finite groups admitting linear representations whose only fixed point for a nonidentity element is the zero vector. The standard reference for such groups is Wolf (1967)…
Cox analysis is a common clinical data analysis technique to link valuable variables to clinical outcomes including dead and relapse. In the omics era, Cox model batch processing is a basic strategy for screening clinically relevant…
When performing an aggregate data meta-analysis of a continuous outcome, researchers often come across primary studies that report the sample median of the outcome. However, standard meta-analytic methods typically cannot be directly…
For researchers in electromyography (EMG), and similar biosginals, signal processing is naturally an essential topic. There are a number of excellent tools available. To these one may add the freely available open source statistical…
Let $\Gamma$ be a finite graph together with a group $G_v$ at each vertex $v$. The graph product $G(\Gamma)$ is obtained from the free product of all $G_v$ by factoring out by the normal subgroup generated by $\{g^{-1}h^{-1}gh; g\in G_v,…
Nowadays, Neural Networks are considered one of the most effective methods for various tasks such as anomaly detection, computer-aided disease detection, or natural language processing. However, these networks suffer from the ``black-box''…
iGraphMatch is an R package for finding corresponding vertices between two graphs, also known as graph matching. The package implements three categories of prevalent graph matching algorithms including relaxation-based, percolation-based,…
robustloggamma is an R package for robust estimation and inference in the generalized loggamma model. We briefly introduce the model, the estimation procedures and the computational algorithms. Then, we illustrate the use of the package…