Related papers: Counting dependent and independent strings
We prove that these Cantor sets are made up of transcendental numbers, apart from their endpoints $0$ and $1$, under some arithmetical assumptions on the data. To that purpose, we establish a criterion of linear independence over the field…
An \itbf{indeterminate string} (or, more simply, just a \itbf{string}) $\s{x} = \s{x}[1..n]$ on an alphabet $\Sigma$ is a sequence of nonempty subsets of $\Sigma$. We say that $\s{x}[i_1]$ and $\s{x}[i_2]$ \itbf{match} (written $\s{x}[i_1]…
R. Duncan Luce once mentioned in a conversation that he did not consider Kolmogorov's probability theory well-constructed because it treats stochastic independence as a "numerical accident," while it should be treated as a fundamental…
A new set of boundary conditions for string propagators is proposed in this paper. The boundary conditions are parametrized by a complex number $\lambda$. Under these new boundary conditions, the left-moving and right-moving modes are…
We present a fully automatic method for music classification, based only on compression of strings that represent the music pieces. The method uses no background knowledge about music whatsoever: it is completely general and can, without…
We construct an infinite collection of knots with the property that any knot in this family has $n$-string essential tangle decompositions for arbitrarily high $n$.
Kolmogorov complexity is a measure of the information contained in a binary string. We investigate here the notion of quantum Kolmogorov complexity, a measure of the information required to describe a quantum state. We show that for any…
In this work we introduce a notion of independence based on finite-state automata: two infinite words are independent if no one helps to compress the other using one-to-one finite-state transducers with auxiliary input. We prove that, as…
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
We study the possibility of scaling down algorithmic information quantities in tuples of correlated strings. In particular, we address a question raised by Alexander Shen: whether, for any triple of strings $(a, b, c)$, there exists a…
In this article, the notion of bi-monotonic independence is introduced as an extension of monotonic independence to the two-faced framework for a family of pairs of algebras in a non-commutative space. The associated cumulants are defined…
Given any two rational numbers $r_1$ and $r_2$, a necessary and sufficient condition is established for the three numbers $1$, $\cos (\pi r_1)$, and $\cos (\pi r_2)$ to be rationally independent. Extending a classical fact sometimes…
In this paper, we introduce a concept of non-dependence of variables in formulas. A formula in first-order logic is non-dependent of a variable if the truth value of this formula does not depend on the value of that variable. This variable…
Given two conformal field theories related to each other by a marginal perturbation, and string field theories constructed around such backgrounds, we show how to construct explicit redefinition of string fields which relate these two…
We characterize the connected graphs of given order $n$ and given independence number $\alpha$ that maximize the number of maximum independent sets. For $3\leq \alpha\leq n/2$, there is a unique such graph that arises from the disjoint…
The combined universal probability M(D) of strings x in sets D is close to max_{x \in D} M({x}): their ~ logs differ by at most D's information j = I(D:H) about the halting sequence H. Thus if all x have complexity K(x) > k, D carries > i…
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…
We introduce a new natural notion of convergence for permutations at any specified scale, in terms of the density of patterns of restricted width. In this setting we prove that limits may be chosen independently at a countably infinite…
The holomorphy of the superpotential along with symmetries gives very strong constraints on any stringy non-perturbative effects. This observation suggests an approach to string phenomenology. (Presented at ``Strings 95'', March 1995.
A new seemingly weak axiomatic formulation of information algebras is given. It is shown how such information algebras can be embedded into set (information) algebras. In set algebras there is a natural relation of conditional independence…