相关论文: Kolmogorov complexity and symmetric relational str…

For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…

We study in which way Kolmogorov complexity and instance complexity affect properties of r.e. sets. We show that the well-known 2log n upper bound on the Kolmogorov complexity of initial segments of r.e.\ sets is optimal and characterize…

An infinite binary sequence has randomness rate at least $\sigma$ if, for almost every $n$, the Kolmogorov complexity of its prefix of length $n$ is at least $\sigma n$. It is known that for every rational $\sigma \in (0,1)$, on one hand,…

We study the Fraisse limit of the class of all finite simplicial complexes. Whilst the natural model-theoretic setting for this class uses an infinite language, a range of results associated with Fraisse limits of structures for finite…

We develop \emph{Fra\"iss\'e theory}, namely the theory of \emph{Fra\"iss\'e classes} and \emph{Fra\"iss\'e limits}, in the context of metric structures. We show that a class of finitely generated structures is Fra\"iss\'e if and only if it…

The general theory developed by Ben Yaacov for metric structures provides Fra\"iss\'e limits which are approximately ultrahomogeneous. We show here that this result can be strengthened in the case of relational metric structures. We give an…

Mutual information I in infinite sequences (and in their finite prefixes) is essential in theoretical analysis of many situations. Yet its right definition has been elusive for a long time. I address it by generalizing Kolmogorov Complexity…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

Assume that for some $\alpha<1$ and for all nutural $n$ a set $F_n$ of at most $2^{\alpha n}$ "forbidden" binary strings of length $n$ is fixed. Then there exists an infinite binary sequence $\omega$ that does not have (long) forbidden…

This paper has two parts. First, we complete the proof of the Kolmogorov extension theorem for unbounded random variables using compactness theorem of integral logic which was proved for bounded case in [8]. Second, we give a proof of the…

The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…

Big Ramsey degrees of finite structures are usually considered with respect to a Fra\"{i} ss\'e limit. Building mainly on the work of Devlin, Sauer, Laflamme and Van Th\'e, in this paper we consider structures which are not Fra\"{i} ss\'e…

Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the…

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

The random permutation is the Fra\"iss\'e limit of the class of finite structures with two linear orders. Answering a problem stated by Peter Cameron in 2002, we use a recent Ramsey-theoretic technique to show that there exist precisely 39…

In this paper we study the possibility to define irreducible representations of the symmetric groups with the help of finitely many relations. The existence of finite bases is established for the classes of representations corresponding to…

We will show that almost all nonassociative relation algebras are symmetric and integral (in the sense that the fraction of both labelled and unlabelled structures that are symmetric and integral tends to 1), and using a Fra\"iss\'e limit,…

The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…

In this article we prove that stratified spaces and other geometric subfamilies satisfy categorical Fra\"iss\'e properties, a matter that might be of interest for both geometers and logicians. As a motivation we show a new example of a…