Related papers: Extractors and an efficient variant of Muchnik's t…

When specialized to the context of permutations, Schmerl and Trotter's Theorem states that every simple permutation which is not a parallel alternation contains a simple permutation with one fewer entry. We give an elementary proof of this…

Consider a d*n matrix A, with d<n. The problem of solving for x in y=Ax is underdetermined, and has infinitely many solutions (if there are any). Given y, the minimum Kolmogorov complexity solution (MKCS) of the input x is defined to be an…

Below is a translation from my Russian paper. I added references, unavailable to me in Moscow. Similar results have been also given in [Schnorr Stumpf 75] (see also [Lynch 75]). Earlier relevant work (classical theorems like Compression,…

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

We develop the technique of reduced word manipulation to give a range of results concerning reduced words and permutations more generally. We prove a broad connection between pattern containment and reduced words, which specializes to our…

A value of a CSP instance is typically defined as a fraction of constraints that can be simultaneously met. We propose an alternative definition of a value of an instance and show that, for purely combinatorial reasons, a value of an…

The existence of lower dimensional KAM tori is shown for a class of nearly integrable Hamiltonian systems where the second Melnikov's conditions are eliminated. As a consequence, it is proved that there exist many invariant tori and thus…

We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain…

In this paper we prove Korovkin type theorems for sequences of sublinear, monotone and weak additive operators acting on function spaces C(X); where X is a compact or a locally compact metric space. Our results are illustrated by a series…

In this note, we give the most natural (perhaps the simplest ever) generalization of the Fuglede-Putnam theorem where all operators involved are unbounded.

The piecewise complexity $h(u)$ of a word is the minimal length of subwords needed to exactly characterise $u$. Its piecewise minimality index $\rho(u)$ is the smallest length $k$ such that $u$ is minimal among its order-$k$ class $[u]_k$…

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

We give a general version of Bryc's theorem valid on any topological space and with any algebra $\mathcal{A}$ of real-valued continuous functions separating the points, or any well-separating class. In absence of exponential tightness, and…

This paper proposes an extension to classical regular expressions by the addition of two operators allowing the inclusion of boolean formulae from the zeroth order logic. These expressions are called constrained expressions. The associated…

We prove that if a solution of the time-dependent Schr{\"o}dinger equation on an homogeneous tree with bounded potential decays fast at two distinct times then the solution is trivial. For the free Schr{\"o}dinger operator, we use the…

`What more than its truth do we know if we have a proof of a theorem in a given formal system?' We examine Kreisel's question in the particular context of program termination proofs, with an eye to deriving complexity bounds on program…

We analyze the structure of left maps in algebraic weak factorization systems constructed using Garner's algebraic small object argument. We find that any left map can be constructed from generators in Bourke and Garner's double category of…

In the present work we study a problem of finding a global minimum of a piecewise affine function. We employ optimality conditions for the problem in terms of coexhausters and use them to state and prove necessary and sufficient conditions…

In this paper, we use a new method to prove cut-elimination of weak intuitionistic tense logic. This method focuses on splitting the contraction rule and cut rules. Further general theories and applications of this method shall be developed…