Related papers: On the Conditional Complexity of Sets of Strings
This paper is an attempt to find out which properties of a finite group G can be expressed in terms of commutators of elements of coprime orders. A criterion of solubility of G in terms of such commutators is obtained. We also conjecture…
In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist of a single letter, but which nevertheless may itself…
We suggest necessary conditions of soficness of multidimensional shifts formulated in termsof resource-bounded Kolmogorov complexity. Using this technique we provide examples ofeffective and non-sofic shifts on $\mathbb{Z}^2$ with very low…
We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations), in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple…
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…
We consider the group $\mathfrak{X}(G)$ obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. Deceptively complicated finitely presented groups arise from…
A measure of complexity based on a probabilistic description of physical systems is proposed. This measure incorporates the main features of the intuitive notion of such a magnitude. It can be applied to many physical situations and to…
For an extension A/B of neither necessarily associative nor necessarily unital rings, we investigate the connection between simplicity of A with a property that we call A-simplicity of B. By this we mean that there is no non-trivial ideal I…
We define a general notion of "summability" of a set $I\subseteq\mathbb{C^{N}}$ and show that some trivial condition necessary for a set to be summable, is also sufficient. We deduce some intresting corollaries.
We study the structural complexity of bimatrix games, formalized via rank, from an empirical perspective. We consider a setting where we have data on player behavior in diverse strategic situations, but where we do not observe the relevant…
The question What is Complexity? has occupied a great deal of time and paper over the last 20 or so years. There are a myriad different perspectives and definitions but still no consensus. In this paper I take a phenomenological approach,…
What are simplest ways to construct a finite group from its atomic constituents? To understand part-whole relations between finite simple groups and the global structure of finite groups, we axiomatize complexity measures on finite groups.…
D. Krieger and J. Shallit have proved that every real number greater than 1 is a critical exponent of some sequence. We show how this result can be derived from some general statements about sequences whose subsequences have (almost)…
One cannot yet point to any firm string prediction. While many approximate string ground states are known with interesting properties, we do not have any argument that one or another describes what we observe around us, and for reasons…
We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in…
The generalized order $e_G(g)$ of an element $g$ of a group $G$ is the smallest positive integer $k$ such that there exist $x_1,\ldots,x_k \in G$ such that $g^{x_1} \ldots g^{x_k}=1$, where $g^x=x^{-1}gx$. Let $e(G) = \max \{e_G(g)\ |\ g…
Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed \emph{coding theorem method} the complexity of strings of length…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…
We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…