Related papers: Surjectively rigid chains
Dimensional types of metric scattered spaces are investigated. Revised proofs of Mazurkiewicz-Sierpi\'nski and Knaster-Urbanik theorems are presented. Embeddable properties of countable metric spaces are generalized onto uncountable metric…
We study possibilities for semantic and syntactic rigidity, i.e., the rigidity with respect to automorphism group and with respect to definable closure. Variations of rigidity and their degrees are studied in general case, for special…
We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.
We prove metric rigidity for complete manifolds supporting solutions of certain second order differential systems, thus extending classical works on a characterization of space-forms. In the route, we also discover new characterizations of…
Joinings are fundamental global objects in ergodic theory, yet in compact metric models one naturally observes only finite orbit-distance patterns. We bridge this gap by introducing multi-particle distance arrays, which sample finite orbit…
We study the utility of chains defined on causal sets in estimating continuum properties like the curvature, the proper time and the spacetime dimension through a numerical analysis. In particular, we show that in $\text{dS}_2$ and…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
In this paper we will show that if a sequence of natural numbers satisfies a certain growth rate, then there is a weak mixing diffeomorphism on $\mathbb{T}^2$ that is uniformly rigid with respect to that sequence. The proof is based on a…
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…
We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees form a copy of the dense linear order…
We study geometric rigidity of a class of fractals, which is slightly larger than the collection of self-conformal sets. Namely, using a new method, we shall prove that a set of this class is contained in a smooth submanifold or is totally…
This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…
We consider the system of $N$ points on the segment of the real line with the nearest-neighbor Coulomb repulsive interaction and external force $F$. For the fixed points of such systems (fixed configurations) we study the asymptotics (in…
We introduce a new class of real-valued monotones in preordered spaces, injective monotones. We show that the class of preorders for which they exist lies in between the class of preorders with strict monotones and preorders with countable…
We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…
We study compactness and L\"owenheim-Skolem properties of fragments of the class-sized logic $\mathcal{L}_{\infty \infty}$ and of class-sized versions of second-order and sort logics. In these fragments, certain combinations of infinitary…
The paper studies the higher-order absolute differences taken from progressive terms of time-homogenous binary Markov chains. Two theorems presented are the limiting theorems for these differences, when their order $k$ converges to…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…
We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.
Great part of the interest in complex networks has been motivated by the presence of structured, frequently non-uniform, connectivity. Because diverse connectivity patterns tend to result in distinct network dynamics, and also because they…