Related papers: Ultrafilters maximal for finite embeddability

In the paper, we describe all total orders $\succ$ compatible with addition on additive subsemigroup $S$ of finite dimensional spaces over rational numbers. We provide a necessary and sufficient condition under which a finitely generated…

We extend the class of ultrafilters $U$ over countable sets for which $U\cdot U\equiv_T U$, extending several results from \cite{Dobrinen/Todorcevic11}. In particular, we prove that for each countable ordinal $\alpha\geq 2$, the generic…

We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…

In this paper we analyse and compare two different notions of regularity for filters on complete Boolean algebras. We also announce two results from a forthcoming paper in preparation, which provide a characterization of Keisler's order in…

A new hierarchy of "exact" unification types is introduced, motivated by the study of admissibility for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by…

Recent research has examined algorithms to minimize robots' resource footprints. The class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods for reducing their space…

In this paper we investigate Schur ultrafilters on groups. Using the algebraic structure of Stone-\v{C}ech compactifications of discrete groups and Schur ultrafilters, we give a new description of Bohr compactifications of topological…

A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by…

We study the universal closest refinement problem on measurable bipartite relations over standard Borel spaces. Given prescribed side measures, the feasible class consists of finite refinement plans concentrated on the relation and carrying…

In standard construction of hyperrational numbers using an ultrapower we assume that the ultrafilter is selective. It makes possible to assign real value to any finite hyperrational number. So, we can consider hyperrational numbers with…

Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and…

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

We investigate families of partitions of omega which are related to special coideals, so-called happy families, and give a dual form of Ramsey ultrafilters in terms of partitions. The combinatorial properties of these…

Let us say that a class of upward closed sets (upsets) of distributive lattices is a finitary filter class if it is closed under homomorphic preimages, intersections, and directed unions. We show that the only finitary filter classes of…

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in Shelah math.LO/0407498 and studied also in math.LO/0605067. We introduce a general scheme of generating a filter on lambda from filters on smaller…

We introduce order conserving embeddings as a more general form of order preserving embeddings between finite dimensional nest algebras. The structure of these embeddings is determined, in terms of order indecomposable decompositions, and…

Selective ultrafilters are characterized by many equivalent properties, in particular the Ramsey property that every finite colouring of unordered pairs of integers has a homogeneous set in U, and the equivalent property that every function…

Reduction of combinatorial filters involves compressing state representations that robots use. Such optimization arises in automating the construction of minimalist robots. But exact combinatorial filter reduction is an NP-complete problem…

For every filter $\mathcal F$ on $\mathbb N$, we introduce and study corresponding uniform $\mathcal F$-boundedness principles for locally convex topological vector spaces. These principles generalise the classical uniform boundedness…