Related papers: The free group in R
Free and open source software package ecosystems have existed for a long time and are among the most sophisticated human-made systems. One of the oldest and most popular software package ecosystems is CRAN, the repository of packages of the…
Graph representations of programs are commonly a central element of machine learning for code research. We introduce an open source Python library python_graphs that applies static analysis to construct graph representations of Python…
In this short article I introduce the stokes package which provides functionality for working with tensors, alternating forms, wedge products, and related concepts from the exterior calculus. Notation and spirit follow Spivak. Stokes's…
We present Simphony, a free and open-source software toolbox for abstracting and simulating photonic integrated circuits, implemented in Python. The toolbox is both fast and easily extensible; plugins can be written to provide compatibility…
We desribe how we extend R with an external C++ code library by using the Rcpp package. Our working example uses the recent machine learning library and application 'Corels' providing optimal yet easily interpretable rule lists…
An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…
This article describes SimEngine, an open-source R package for structuring, maintaining, running, and debugging statistical simulations on both local and cluster-based computing environments. Several R packages exist for structuring…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
In this paper we explore the connections between the class of Visibly Pushdown Languages ($\mathbf{VPL}$) and the natural sets of words one can associate to a finitely generated group. We show that the word problem of a finitely generated…
This document introduces the Graph Signal Processing Toolbox (GSPBox) a framework that can be used to tackle graph related problems with a signal processing approach. It explains the structure and the organization of this software. It also…
One of the key steps in the proof of the Banach-Tarski Theorem is the introduction of a free group of rotations. First, a free group of reduced words is generated where each element of the set is represented as an ACL2 list. Then we…
We introduce the R package \CRANpkg{SIHR} for statistical inference in high-dimensional generalized linear models with continuous and binary outcomes. The package provides functionalities for constructing confidence intervals and performing…
Academic Clinical Trial Units frequently face fragmented statistical workflows, leading to duplicated effort, limited collaboration, and inconsistent analytical practices. To address these challenges within an oncology Clinical Trial Unit,…
Finite mixture modelling provides a framework for cluster analysis based on parsimonious Gaussian mixture models. Variable or feature selection is of particular importance in situations where only a subset of the available variables provide…
We describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in terms of memory use and even of arithmetic, than permuattion and…
This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to…
Lists of equivalence classes of words under rotation or rotation plus reversal (i.e., necklaces and bracelets) have many uses, and efficient algorithms for generating these lists exist. In combinatorial group theory elements of a group are…
In this article we will describe a finitely presented subgroup of Monod's group of piecewise projective homeomorphisms of R. This in particular provides a new example of a finitely presented group which is nonamenable and yet does not…
R-MAT is a simple, widely used recursive model for generating `complex network' graphs with a power law degree distribution and community structure. We make R-MAT even more useful by reducing the required work per edge from logarithmic to…
We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…