Related papers: An algorithm to compute the Hausdorff dimension of…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…
We study the arithmetic and geometric iterated monodromy groups associated to the postcritically finite (PCF) quadratic rational function $f(x)=\frac{2}{(x-1)^2}$ defined over a number field $k$, whose critical points are both strictly…
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…
We compute point schemes of some regular algebras using (Wolfram) Mathematica. These algebras are Ore extensions of regular graded skew Clifford algebras of global dimension 3.
We present an algorithm to compute the Hecke operators on the equivariant cohomology of an arithmetic subgroup $\Gamma$ of the general linear group $\mathrm{GL}_n$. This includes $\mathrm{GL}_n$ over a number field or a finite-dimensional…
In this paper we give an algorithm for the computation of all the Arf numerical semigroups with a given genus. Moreover, we generalize the concept of genus of a numerical semigroup to good semigroups of $\mathbb{N}^r$ and we give a…
This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal…
Previous work has shown that the Hausdorff dimension of sofic affine-invariant sets is expressed as a limit involving intricate matrix products. This limit has typically been regarded as incalculable. However, in several highly non-trivial…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…
An approach is given for estimating the Hausdorff dimension of the univoque set of a self-similar set. This sometimes allows us to get the exact Hausdorff dimensions of the univoque sets.
We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by…
We present a new method to calculate the Hausdorff dimension of a certain class of fractals: boundaries of self-affine tiles. Among the interesting aspects are that even if the affine contraction underlying the iterated function system is…
This paper is concerned with restricted families of projections in $\mathbb{R}^{3}$. Let $K \subset \mathbb{R}^{3}$ be a Borel set with Hausdorff dimension $\dim K = s > 1$. If $\mathcal{G}$ is a smooth and sufficiently well-curved…
We construct an invariant of closed oriented $3$-manifolds using a finite dimensional, involutory, unimodular and counimodular Hopf algebra $H$. We use the framework of normal o-graphs introduced by R. Benedetti and C. Petronio, in which…
An algorithm of Thomas Breuer produces complete lists of automorphism groups of curves for a fixed genus, and the code to execute this algorithm was written in the computer algebra package GAP and run by Breuer over a decade ago. For each…
The Hausdorff dimension of the set of points that are covered infinitely many times by a sequence of randomly distributed balls in the unit cube can be expressed in terms of the sizes of the balls. This note presents a new proof of the…
In this paper we describe an algorithm visiting all numerical semigroups up to a given genus using a well suited representation. The interest of this algorithm is that it fits particularly well the architecture of modern computers allowing…
The Hausdorff distance is a measure of (dis-)similarity between two sets which is widely used in various applications. Most of the applied literature is devoted to the computation for sets consisting of a finite number of points. This has…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.