Large Alphabets and Incompressibility

We briefly survey some concepts related to empirical entropy -- normal numbers, de Bruijn sequences and Markov processes -- and investigate how well it approximates Kolmogorov complexity. Our results suggest $\ell$th-order empirical entropy stops being a reasonable complexity metric for almost all strings of length $m$ over alphabets of size $n$ about when $n^\ell$ surpasses $m$

Embedding in a Finite 2-Generator Semigroup

We augment the body of existing results on embedding finite semigroups of a certain type into 2-generator finite semigroups of the same type. The approach adopted applies to finite semigroups the idempotents of which form a band and also to finite orthodox semigroups

Derivation of the Rules of Quantum Mechanics from Information-Theoretic Axioms

Conventional quantum mechanics with a complex Hilbert space and the Born Rule is derived from five axioms describing properties of probability distributions for the outcome of measurements. Axioms I,II,III are common to quantum mechanics and hidden variable theories. Axiom IV recognizes a phenomenon, first noted by Turing and von Neumann, in which the increase in entropy resulting from a measurement is reduced by a suitable intermediate measurement. This is shown to be impossible for local hidden variable theories. Axiom IV, together with the first three, almost suffice to deduce the conventional rules but allow some exotic, alternatives such as real or quaternionic quantum mechanics. Axiom V recognizes a property of the distribution of outcomes of random measurements on qubits which holds only in the complex Hilbert space model. It is then shown that the five axioms also imply the conventional rules for all dimensions.Comment: 20 pages, 6 figure

Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices

The family of Vicsek fractals is one of the most important and frequently-studied regular fractal classes, and it is of considerable interest to understand the dynamical processes on this treelike fractal family. In this paper, we investigate discrete random walks on the Vicsek fractals, with the aim to obtain the exact solutions to the global mean first-passage time (GMFPT), defined as the average of first-passage time (FPT) between two nodes over the whole family of fractals. Based on the known connections between FPTs, effective resistance, and the eigenvalues of graph Laplacian, we determine implicitly the GMFPT of the Vicsek fractals, which is corroborated by numerical results. The obtained closed-form solution shows that the GMFPT approximately grows as a power-law function with system size (number of all nodes), with the exponent lies between 1 and 2. We then provide both the upper bound and lower bound for GMFPT of general trees, and show that leading behavior of the upper bound is the square of system size and the dominating scaling of the lower bound varies linearly with system size. We also show that the upper bound can be achieved in linear chains and the lower bound can be reached in star graphs. This study provides a comprehensive understanding of random walks on the Vicsek fractals and general treelike networks.Comment: Definitive version accepted for publication in Physical Review

Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation

Many real networks share three generic properties: they are scale-free, display a small-world effect, and show a power-law strength-degree correlation. In this paper, we propose a type of deterministically growing networks called Sierpinski networks, which are induced by the famous Sierpinski fractals and constructed in a simple iterative way. We derive analytical expressions for degree distribution, strength distribution, clustering coefficient, and strength-degree correlation, which agree well with the characterizations of various real-life networks. Moreover, we show that the introduced Sierpinski networks are maximal planar graphs.Comment: 6 pages, 5 figures, accepted by EP

Determining mean first-passage time on a class of treelike regular fractals

Relatively general techniques for computing mean first-passage time (MFPT) of random walks on networks with a specific property are very useful, since a universal method for calculating MFPT on general graphs is not available because of their complexity and diversity. In this paper, we present techniques for explicitly determining the partial mean first-passage time (PMFPT), i.e., the average of MFPTs to a given target averaged over all possible starting positions, and the entire mean first-passage time (EMFPT), which is the average of MFPTs over all pairs of nodes on regular treelike fractals. We describe the processes with a family of regular fractals with treelike structure. The proposed fractals include the $T$ fractal and the Peano basin fractal as their special cases. We provide a formula for MFPT between two directly connected nodes in general trees on the basis of which we derive an exact expression for PMFPT to the central node in the fractals. Moreover, we give a technique for calculating EMFPT, which is based on the relationship between characteristic polynomials of the fractals at different generations and avoids the computation of eigenvalues of the characteristic polynomials. Making use of the proposed methods, we obtain analytically the closed-form solutions to PMFPT and EMFPT on the fractals and show how they scale with the number of nodes. In addition, to exhibit the generality of our methods, we also apply them to the Vicsek fractals and the iterative scale-free fractal tree and recover the results previously obtained.Comment: Definitive version published in Physical Review

Random Sierpinski network with scale-free small-world and modular structure

In this paper, we define a stochastic Sierpinski gasket, on the basis of which we construct a network called random Sierpinski network (RSN). We investigate analytically or numerically the statistical characteristics of RSN. The obtained results reveal that the properties of RSN is particularly rich, it is simultaneously scale-free, small-world, uncorrelated, modular, and maximal planar. All obtained analytical predictions are successfully contrasted with extensive numerical simulations. Our network representation method could be applied to study the complexity of some real systems in biological and information fields.Comment: 7 pages, 9 figures; final version accepted for publication in EPJ

Spectral triples for the Sierpinski Gasket

We construct a family of spectral triples for the Sierpinski Gasket $K$. For suitable values of the parameters, we determine the dimensional spectrum and recover the Hausdorff measure of $K$ in terms of the residue of the volume functional $a\to$ tr$(a\,|D|^{-s})$ at its abscissa of convergence $d_D$, which coincides with the Hausdorff dimension $d_H$ of the fractal. We determine the associated Connes' distance showing that it is bi-Lipschitz equivalent to the distance on $K$ induced by the Euclidean metric of the plane, and show that the pairing of the associated Fredholm module with (odd) $K$-theory is non-trivial. When the parameters belong to a suitable range, the abscissa of convergence $\delta_D$ of the energy functional $a\to$ tr$(|D|^{-s/2}|[D,a]|^2\,|D|^{-s/2})$ takes the value $d_E=\frac{\log(12/5)}{\log 2}$, which we call energy dimension, and the corresponding residue gives the standard Dirichlet form on $K$.Comment: 48 pages, 9 figures. Final version, to appear in J.Funct.Ana

Range-preserving AE(0)-spaces

[EN] All spaces here are Tychonoff spaces. The class AE(0) consists of those spaces which are absolute extensors for compact zero-dimensional spaces. We define and study here the subclass AE(0)rp, consisting of those spaces for which extensions of continuous functions can be chosen to have the same range. We prove these results. If each point of T 2 AE(0) is a G-point of T , then T 2 AE(0)rp. These are equivalent: (a) T 2 AE(0)rp; (b) every compact subspace of T is metrizable; (c) every compact subspace of T is dyadic; and (d) every subspace of T is AE(0). Thus in particular, every metrizable space is an AE(0)rp-space.Comfort, W.; Hager, A. (2013). Range-preserving AE(0)-spaces. Applied General Topology. 14(1):33-40. doi:10.4995/agt.2013.1614.SWORD3340141A. B laszczyk, Compactness, in: Encyclopedia of General Topology (K. Hart, J. Nagata, and J. Vaughan, eds.), pp. 169–173. Elsevier, Amsterdam, 2004.B. Efimov, Dyadic bicompacta, Soviet Math. Doklady 4 (1963), 496–500, Russian original in: Doklady Akad. Nauk SSSR 149 (1963), 1011-1014.R. Engelking, Cartesian products and dyadic spaces, Fund. Math. 57 (1965), 287–304.Ryszard Engelking, General Topology, Heldermann Verlag, Berlin, 1989.R. Haydon, On a problem of Pelczynski: Milutin spaces, Dugunjdi spaces, and AE(0 − dim), Studia Math. 52 (1974), 23–31.Hoffmann, B. (1979). A surjective characterization of Dugundji spaces. Proceedings of the American Mathematical Society, 76(1), 151-151. doi:10.1090/s0002-9939-1979-0534408-xIsbell, J. (1964). Uniform Spaces. Mathematical Surveys and Monographs. doi:10.1090/surv/012W. Sierpinski, Sur les projections des ensembles complémentaire aux ensembles (a), Fund. Math. 11 (1928), 117–122

Large Diffeomorphisms in (2+1)-Quantum Gravity on the Torus

The issue of how to deal with the modular transformations -- large diffeomorphisms -- in (2+1)-quantum gravity on the torus is discussed. I study the Chern-Simons/connection representation and show that the behavior of the modular transformations on the reduced configuration space is so bad that it is possible to rule out all finite dimensional unitary representations of the modular group on the Hilbert space of $L^2$-functions on the reduced configuration space. Furthermore, by assuming piecewise continuity for a dense subset of the vectors in any Hilbert space based on the space of complex valued functions on the reduced configuration space, it is shown that finite dimensional representations are excluded no matter what inner-product we define in this vector space. A brief discussion of the loop- and ADM-representations is also included.Comment: The proof for the nonexistence of the one- and two-dimensional representations of PSL(2,Z) in the relevant Hilbert space, has been extended to cover all finite dimensional unitary representations. The notation is slightly improved and a few references are added