Related papers: A real chain condition for groups
We consider the logic space of countable (enumerated) groups and show that closed subspaces corresponding to some standard classes of groups have (do not have) generic groups. We also discuss the cases of semigroups and associative rings.
It is ``folklore'' that the solution to a set reachability problem for a dynamical system is only noncomputable because of non-robustness reasons. A robustness condition that can be imposed on a dynamical system is the requirement of the…
We analyze the properties of weakly compact sets in Lipschitz free spaces. Prior research has established that, for a complete metric space $M$, weakly precompact sets in the Lipschitz free space $\mathcal F(M)$ are tight. In this paper, we…
We establish a one-to-one correspondence between one-sided and two-sided regular systems of conditional probabilities on the half-line that preserves the associated chains and Gibbs measures. As an application, we determine uniqueness and…
We study rigidity properties of linearly ordered sets (chains) under automorphisms, order-embeddings, epimorphisms, and endomorphisms. We focus on two main cases, dense subchains of the real numbers, and uncountable dense chains of higher…
In this paper we show an explicit relation between chains of torsion classes and weak stability conditions over an abelian category. In particular, up to a natural equivalence, they coincide. We investigate topological properties of the…
This note studies monotone Markov chains, a subclass of Markov chains with extensive applications in operations research and economics. While the properties that ensure the global stability of these chains are well studied, their…
In this note, we determine the finite groups whose poset of conjugacy classes of subgroups has breaking points. This leads to a new characterization of the generalized quaternion $2$-groups. A generalization of this property is also…
In this paper we consider a number of finiteness conditions for semigroups related to their ideal structure, and ask whether such conditions are preserved by sub- or supersemigroups with finite Rees or Green index. Specific properties under…
In the theory of flat chains with coefficients in a normed abelian group, we give a simple necessary and sufficient condition on a group element $g$ in order for the following fundamental regularity principle to hold: if a mass-minimizing…
A subgroup $R$ of a finite group $G$ is weakly subnormal in $G$ if $R$ is not subnormal in $G$ but it is subnormal in every proper overgroup of $R$ in $G$. In this paper, we first classify all finite groups $G$ which contains a weakly…
We study test sets: subfamilies of sequences converging to a point P that still suffice to detect every discontinuity of real-valued functions at P. Ordered by inclusion, these test sets form a poset. Under natural hypotheses at P, we prove…
The conventional definition of extremality of a finite collection of sets is extended by replacing a fixed point (extremal point) in the intersection of the sets by a collection of sequences of points in the individual sets with the…
Motivated by biochemical reaction networks, a generalization of the classical secant condition for the stability analysis of cyclic interconnected commensurate fractional-order systems is provided. The main result presents a sufficient…
We define the $\aleph_{1.5}$ chain condition. The corresponding forcing axiom is a generalization of Martin's Axiom and implies certain uniform failures of club--guessing on $\omega_1$ that don't seem to have been considered in the…
The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom…
A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
Let $[n]=\{1,2,\ldots,n\}$ be a finite chain and let $\mathcal{P}_{n}$ be the semigroup of partial transformations on $[n]$. Let $\mathcal{CP}_{n}=\{\alpha\in \mathcal{P}_{n}: (for~all ~x,y\in Dom~\alpha)~|x\alpha-y\alpha|\leq|x-y|\}$, then…
A countable group is residually finite if every nontrivial element can act nontrivially on a finite set. When a group fails to be residually finite, we might want to measure how drastically it fails - it could be that only finitely many…