Related papers: An algorithm to compute the Hausdorff dimension of…
Using generating functions techniques we develop a relation between the Hausdorff and spectral dimension of trees with a unique infinite spine. Furthermore, it is shown that if the outgrowths along the spine are independent and identically…
A Hopf Galois structure on a finite field extension L/K is given by a finite cocommutative K-Hopf algebra and a Hopf action. In this paper we present an algorithm written in the computational algebra system Magma which gives all Hopf Galois…
The main goal of this work is to examine the structure of normal Hausdorff operators on $\mathbb{R}^n$. We show that normal Hausdorff operator in $L^2(\mathbb{R}^n)$ is unitary equivalent to the operator of multiplication by some…
We determine the Hausdorff and box dimension of the fractal graphs for a general class of Weierstrass-type functions of the form $f(x) = \sum_{n=1}^\infty a_n \, g(b_n x + \theta_n)$, where $g$ is a periodic Lipschitz real function and…
We study fine properties of the so-called stable trees, which are the scaling limits of critical Galton-Watson trees conditioned to be large. In particular we derive the exact Hausdorff measure function for Aldous' continuum random tree and…
In this paper, we present a second partial solution for the problem of cardinality calculation of the set of fractals for its subcategory of the random virtual ones. Consistent with the deterministic case, we show that for the given…
Let $B$ be a $d$-dimensional Gaussian process on $\mathbb{R}$, where the component are independents copies of a scalar Gaussian process $B_0$ on $\mathbb{R}_+$ with a given general variance function…
We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+b), given real numbers a, b, and x. We apply our main theorem to a problem in fractal geometry, giving an improved lower…
We give upper and lower bounds for the Hausdorff dimensions for a class of graph-directed measures when its underlying directed graph is the infinite N-ary tree. These measures are different from graph-directed self-similar measures driven…
By applying a 2014 result on the distribution of full cylinders, we give a proof of the useful folklore: for any $\beta>1$, the Hausdorff dimension of an arbitrary set in the shift space $S_\beta$ is equal to the Hausdorff dimension of its…
We develop a new approach to the computation of the Hausdorff dimension of the invariant set of an iterated function system or IFS. In the one dimensional case that we consider here, our methods require only $C^3$ regularity of the maps in…
Hausdorff operators on the real line and multidimensional Euclidean spaces originated from some classical summation methods. Now it is an active research area. Hausdorff operators on general groups were defined and studied by the author…
We present a method of computing elements of spin groups in the case of arbitrary dimension. This method generalizes Hestenes method for the case of dimension 4. We use the method of averaging in Clifford's geometric algebra previously…
A theory of graded manifolds can be viewed as a generalization of differential geometry of smooth manifolds. It allows one to work with functions which locally depend not only on ordinary real variables, but also on $\mathbb{Z}$-graded…
We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP), which is a generalization of the well-studied Hidden…
The paper suggests the use of Multi-Valued Decision Diagrams (MDDs) as the supporting data structure for a generic global constraint. We give an algorithm for maintaining generalized arc consistency (GAC) on this constraint that amortizes…
We develop a versatile framework which allows us to rigorously estimate the Hausdorff dimension of maximal conformal graph directed Markov systems in $\mathbb{R}^n$ for $n \geq 2$. Our method is based on piecewise linear approximations of…
Distributed algorithms for solving coupled semidefinite programs (SDPs) commonly require many iterations to converge. They also put high computational demand on the computational agents. In this paper we show that in case the coupled…
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…
A general concept of a Hausdorff-type operator that absorbs all types of operators bearing the name `` Hausdorff operator'' and many others is considered. The characteristic features of this concept are the consideration of kernels…