Related papers: Random affine code tree fractals and Falconer-Sloa…
For fixed $t\ge 2$, we consider the class of representations of $1$ as sum of unit fractions whose denominators are powers of $t$ or equivalently the class of canonical compact $t$-ary Huffman codes or equivalently rooted $t$-ary plane…
In this article, we provide a simple and systematic way to represent general (inhomogeneous) fractals that may look different at different scales and places. By using set-valued compression maps, we express these general fractals as…
The main goal of this paper has a double purpose. On the one hand, we propose a new definition in order to compute the fractal dimension of a subset respect to any fractal structure, which completes the theory of classical box-counting…
We prove the existence of two thresholds regarding the compilability of random 2-CNF formulas to OBDDs. The formulas are drawn from $\mathcal{F}_2(n,\delta n)$, the uniform distribution over all 2-CNFs with $\delta n$ clauses and $n$…
Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…
We show that for a large class of planar $1$-dimensional random fractals $S$, the Favard length $\operatorname{Fav}(S(r))$ of the neighborhood $S(r)$ is comparable to $\log^{-1}(1/r)$, matching a universal lower bound; up to now, this was…
In the paper, we define a class of new fractals named ``non-autonomous attractors", which are the generalization of classic Moran sets and attractors of iterated function systems. Simply to say, we replace the similarity mappings by…
In this paper, we prove that with high probability, random Reed-Solomon codes approach the half-Singleton bound - the optimal rate versus error tradeoff for linear insdel codes - with linear-sized alphabets. More precisely, we prove that,…
We compute in conventional dimensional regularisation the tree-level splitting amplitudes for a quark parent in the limit where four partons become collinear to each other. This is part of the universal infrared behaviour of the QCD…
Suppose a graph-directed iterated function system consists of maps f_e with upper estimates of the form d(f_e(x),f_e(y)) <= r_e d(x,y). Then the fractal dimension of the attractor K_v of the IFS is bounded above by the dimension associated…
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…
We completely describe the equilibrium states of a class of potentials over the full shift which includes Falconer's singular value function for affine iterated function systems with invertible affinities. We show that the number of…
Let F:=(f_1,...,f_n) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/epsilon. The bound depends on an integral…
In the first section we review recent results on the harmonic analysis of fractals generated by iterated function systems with emphasis on spectral duality. Classical harmonic analysis is typically based on groups whereas the fractals are…
The methods of determining the fractal dimension and irregularity scale in simulated galaxy catalogs and the application of these methods to the data of the 2dF and 6dF catalogs are analyzed. Correlation methods are shown to be correctly…
Let $\mathcal{T}_n$ be the set of all mappings $T:[n]\to[n]$, where $[n]=\{1,2,\ldots,n\}$. The corresponding graph $G_T$ of $T$, called a functional digraph, is a union of disjoint connected components. Each component is a directed cycle…
The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…
Folded Reed-Solomon (FRS) codes are a well-studied family of codes, known for achieving list decoding capacity. In this work, we give improved deterministic and randomized algorithms for list decoding FRS codes of rate $R$ up to radius…
Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\'{o}lya trees: a uniform random P\'{o}lya tree of size $n$ consists of a conditioned critical…
We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…