A NOTION OF GEOMETRIC COMPLEXITY AND ITS APPLICATION TO TOPOLOGICAL RIGIDITY

This property, which is a particular instance of a very general notion due to Malcev, was introduced and studied in the group-theoretic setting by Gordon- Vershik [GV97] and St¨

We showed the finiteness of two different natural semantics of MALL 2 – an observational quotient of the syntax, and the historical model of coherence spaces and normal functors –

For an alphabet of size at least 3, the average time complexity, for the uniform distribution over the sets X of Set n,m , of the construction of the accessible and

Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we establish that the average state complexities of the rational operations

By the very essence of this discipline, the foundations of information theory must have a nite combinatorial character." It is the aim of this paper to derive randomness

Marker sets defined by right special factors constitute the key tool needed to split each factor of an infinite word of linear complexity into two pieces.. First introduced by

As a result, the proposed algorithm, namely three-dimensional orthonormal projection approximation subspace tracking for third-order tensors (3D-OPAST), yields linear

We consider a problem of decomposition of a ternary function into a composition of binary ones from the viewpoint of communication complexity and algorithmic information theory as