Related papers: A hereditarily indecomposable tree-like continuum …
A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…
A method is presented to construct a partition of an incomplete horseshoe in a Poincare map which is only based on unstable manifolds of outermost fixed points and eventually their limits. Thereby this partition becomes natural from the…
A countable structure is said to be extendible if it has the same Scott sentence as some uncountable structure. Rigid structures are not extendible. We give an example of an extendible model with a rigid elementary extension.
We show how to construct, via forcing, splitting families than are preserved by a certain type of finite support iterations. As an application, we construct a model where 15 classical characteristics of the continuum are pairwise different,…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
It is proved that the fixed point submonoid and the periodic point submonoid of a trace monoid endomorphism are always finitely generated. Considering the Foata normal form metric on trace monoids and uniformly continuous endomorphisms, a…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
An equation describing the irreversible evolution of the local density of a continuous medium without involving any statistical hypotheses and assumptions is derived. The derivation is based on the smoothing of the microscopic dynamic…
For any composant $E \subset \mathbb H^*$ and corresponding near-coherence class $\mathscr E \subset \omega^*$ we prove the following are equivalent : (1) $E$ properly contains a dense semicontinuum. (2) Each countable subset of $E$ is…
The paper is devoted to a study of certain fixed point properties, and their relatives, in the context of full automorphism groups of countable rooted trees. Namely, we study Serre's property (FA'), also called unsplittability, property…
Let $C^{pr}_m$ be the upper semilattice of degrees of computable sets with respect to primitive recursive $m$-reducibility. We prove that the first-order theory of $C^{pr}_m$ is hereditarily undecidable.
We prove that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov-Hausdorff sense after a suitable rescaling to the Brownian continuum random tree. This proves a conjecture by…
Let $M$ be a closed smooth manifold and let $f:M\to M$ be a diffeomorphism. $C^1$-generically, a continuum-wise expansive satisfies Axiom A without cycles. Moreover, there is a partially hyperbolic diffeomorphism $f$ such that it is not…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
A non-statistical theory of continuous, but irreversible, evolution can be constructed in terms of the Cartan calculus. The fundamental postulate, for an evolutionary theory which admits irreversible processes, is that the topology of the…
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
In this paper we examine the relationship between hyperconvex hulls and metric trees. After providing a linking construction for hyperconvex spaces, we show that the four-point property is inherited by the hyperconvex hull, which leads to…
We investigate relations between the pseudo-orbit-tracing property, topological stability and openness for tree-shifts. We prove that a tree-shift is of finite type if and only if it has the pseudo-orbit-tracing property which implies that…
We construct meta-intransitive systems of independent random variables of any finite order from basic tuple of random variables which generalize intransitive dice. Under this construction, the equality of some linear functional is…