Related papers: An algorithm to compute the Hausdorff dimension of…
For each odd prime $p$, we produce a $2$-generated pro-$p$ group $G$ whose normal Hausdorff spectra \[ \mathrm{hspec}_{\trianglelefteq}^{\mathcal{S}}(G) = \{ \mathrm{hdim}_{G}^{\mathcal{S}}(H)\mid H\trianglelefteq_\mathrm{c} G \} \] with…
An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant…
In this paper, we study the Hausdorff dimension of self-similar measures and sets on the real line, where the generating iterated function system consists of some maps that share the same fixed point. In particular, we will show that out of…
We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
In [Computer Aided Geometric Design 27 (2010), 212-231] the authors present an algorithm to parametrize approximately $\epsilon$-rational curves, and they show in 2 examples that the Hausdorff distance, w.r.t. to the Euclidean distance,…
We calculate the almost sure Hausdorff dimension of the random covering set $\limsup_{n\to\infty}(g_n + \xi_n)$ in $d$-dimensional torus $\mathbb T^d$, where the sets $g_n\subset\mathbb T^d$ are parallelepipeds, or more generally, linear…
This paper examines level sets of two families of continuous, nowhere differentiable functions (one a subfamily of the other) defined in terms of the "tent map". The well-known Takagi function is a special case. Sharp upper bounds are given…
Mean Hausdorff dimension is a dynamical version of Hausdorff dimension. It provides a way to dynamicalize geometric measure theory. We pick up the following three classical results of fractal geometry. (1) The calculation of Hausdorff…
In [14], the authors developed a new approach to the computation of the Hausdorff dimension of the invariant set of an iterated function system or IFS. In this paper, we extend this approach to incorporate high order approximation methods.…
An efficient method is proposed for computing the structure of Jordan blocks of a matrix of integers or rational numbers by exact computation. We have given a method for computing Jordan chains of a matrix with exact computation. However,…
L\"uroth series, like regular continued fractions, provide an interesting identification of real numbers with infinite sequences of integers. These sequences give deep arithmetic and measure-theoretic properties of subsets of numbers…
The classical Hausdorff dimension of finite or countable metric spaces is zero. Recently, we defined a variant, called \emph{finite Hausdorff dimension}, which is not necessarily trivial on finite metric spaces. In this paper we apply this…
We prove that, for every norm on $\mathbb{R}^d$ and every $E \subseteq \mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\dim_{\mathrm{H}} E - (d-1)$. An explicit construction follows,…
In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first…
We establish a 3-manifold invariant for each finite-dimensional, involutory Hopf algebra. If the Hopf algebra is the group algebra of a group $G$, the invariant counts homomorphisms from the fundamental group of the manifold to $G$. The…
For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
Hausdorff relation, topologically identifying points in a given space, belongs to elementary tools of modern mathematics. We show that if subtle enough mathematical methods are used to analyze this relation, the conclusions may be…
The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…