相关论文: A hereditarily indecomposable tree-like continuum …

We introduce a new, relatively simple, line-breaking construction of the $\alpha$-stable tree which realises its random finite-dimensional distributions. This is a direct analogue of Aldous' line-breaking construction of the Brownian…

We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…

If $f:[a,b]\to \mathbb{R}$, with $a<b$, is continuous and such that $a$ and $b$ are mapped in opposite directions by $f$, then $f$ has a fixed point in $I$. Suppose that $f:\mathbb{C}\to\mathbb{C}$ is map and $X$ is a continuum. We extend…

We prove a general factorization theorem for maps with hereditarily indecomposable fibers and apply it to reprove a theorem of Mackoviak on the existence of universal hereditarily indecomposable continua.

We prove that a continuum $X$ is tree-like (resp. circle-like, chainable) if and only if for each open cover $\U_4=\{U_1,U_2,U_3,U_4\}$ of $X$ there is a $\U_4$-map $f:X\to Y$ onto a tree (resp. onto the circle, onto the interval). A…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

The article contains a construction of a self-similar dendryte which cannot be the attractor of any self-similar zipper.

We propose a new constructive model of the real continuum based on the notion of fractal definability. Rather than assuming the continuum as a completed uncountable totality, we view it as the cumulative result of a vast space of stratified…

We continue the investigation of Gregory trees and the Cantor Tree Property carried out by Hart and Kunen. We produce models of MA with the Continuum arbitrarily large in which there are Gregory trees, and in which there are no Gregory…

We prove some theorems on decomposable continua. In particular, we prove; (i) the property of being a Wilder continuum is not a Whitney reversible property, (ii) inverse limits of D**-continua with surjective monotone upper semi-continuous…

Two models of candidates for hereditary symmetry operators are proposed and thus many nonlinear systems of evolution equations possessing infinitely many commutative symmetries may be generated. Some concrete structures of hereditary…

We show that a plane continuum X is indecomposable iff X has a sequence (U_n) of not necessarily distinct complementary domains satisfying what we call the double-pass condition: If one draws an open arc A_n in each U_n whose ends limit…

We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…

The first examples of formations which are arboreous (and therefore Hall) but not freely indexed (and therefore not locally extensible) are found. Likewise, the first examples of solvable formations which are freely indexed and arboreous…

We construct a continuum sized family $\{G_x\}_{x\in\{0,1\}^{\mathbb N}}$ of pairwise non-measure equivalent countable groups which have property (T) (hence are finitely generated), have zero $\ell^2$-Betti numbers of all orders, and are…

Given a continuum $X$, let $\mathcal{NB} (\mathcal{F}_1(X))$ be the hyperspace of nonblockers of $\mathcal{F}_1(X)$. In this paper, we show that if $X$ is hereditarily decomposable with the property of Kelley such that $\mathcal{NB}…

We show that for any $k\in\omega$, the structure $(H_k,\in)$ of sets that are hereditarily of size at most $k$ is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds…

We construct linear Hamilton systems without usual dichotomy property. The Ljapunov spectra of these systems are unfamiliar and conflicting, the behaviour of trajectories is very complicated. The paper's subject refers to some problems of…

Let $\mathcal{B}$ be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only if its root has children $u$ and $v$ such that the subtrees…

Reconstructing the tree of life from molecular sequences is a fundamental problem in computational biology. Modern data sets often contain a large number of genes, which can complicate the reconstruction problem due to the fact that…