Related papers: An algorithm to compute the Hausdorff dimension of…
This paper studies an algorithm similar to that of Gaussian elimination in symplectic and orthogonal groups. We discuss two applications of this algorithm in computational group theory. One computes the spinor norm and the other computes…
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…
We introduce a new class of locally compact groups, namely the strongly compactly covered groups, which are the Hausdorff topological groups $G$ such that every element of $G$ is contained in a compact open normal subgroup of $G$. For…
In a previous paper, dealing with "Applications in $\mathbb{R}^1$," the authors developed a new approach to the computation of the Hausdorff dimension of the invariant set of an iterated function system or IFS and studied some applications…
We provide a generalization of continued fractions to the Heisenberg group. We prove an explicit estimate on the rate of convergence of the infinite continued fraction and several surprising analogs of classical formulas about continued…
A Hausdorff paratopological group G is H-closed if G is closed in each Hausdorff paratopological group containing G. We obtain criteria of H-closedness for some classes of abelian paratopological groups. In particular, for topological…
We describe an algorithm to find the virtual cohomological dimension of the automorphism group of a right-angled Artin group. The algorithm works in the relative setting; in particular it also applies to untwisted automorphism groups and…
We describe an algorithm for classifying the closed subsets of a root system, up to conjugation by the associated Weyl group. Such a classification of an irreducible root system is closely related to the classification of the regular…
In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity…
The Hausdorff distance is a fundamental measure for comparing sets of vectors, widely used in database theory and geometric algorithms. However, its exact computation is computationally expensive, often making it impractical for large-scale…
Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…
In this note we will describe a simple and practical approach to get rigorous bounds on the Hausdorff dimension of limits sets for some one dimensional Markov iterated function schemes. The general problem has attracted considerable…
We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…
A systematic method is presented for the construction and classification of algebras of gauge transformations for arbitrary high rank tensor gauge fields. For every tensor gauge field of a given rank, the gauge transformation will be…
We describe a practical algorithm to compute the (oriented) genus of a graph, give results of the program implementing this algorithm, and compare the performance to existing algorithms. The aim of this algorithm is to be fast enough for…
Using McMullen's Hausdorff dimension algorithm, we study numerically the dimension of the limit set of groups generated by reflections along three geodesics on the hyperbolic plane. Varying these geodesics, we found four minima in the…
We explicitly calculate the Hausdorff dimension of the graph and range of an isotropic stable L\'{e}vy process $X$ plus deterministic drift function $f$. For that purpose we use a restricted version of the genuine Hausdorff dimension which…
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…
We study the Hausdorff dimension of R-analytic subgroups in an R-analytic profinite group, where R is a pro-p ring whose asso- ciated graded ring is an integral domain. In particular, we prove that the set of such Hausdorff dimensions is a…
We calculate the measure and Hausdorff dimension of sets of matrices over fields of formal power series with good approximation properties for a restricted set of denominators.