Related papers: Maximal towers and ultrafilter bases in computabil…
We develop a dynamical version of some of the theory surrounding the Toms-Winter conjecture for simple separable nuclear C*-algebras and study its connections to the C*-algebra side via the crossed product. We introduce an analogue of…
Let omega be the first infinite ordinal (or the set of all natural numbers) with the usual order <. In section 1 we show that, assuming the consistency of a supercompact cardinal, there may exist an ultrapower of omega, whose cardinality is…
Four constructions result from a desire to create enhancements to Cantor's infinite real set cardinality. Each continues to keep Cantor's cardinality formulation in place while providing new comparisons of arbitrary infinite sets. To…
We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple…
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…
We extend to singular cardinals the model-theoretical relation $\lambda \stackrel{\kappa}{\Rightarrow} \mu$ introduced in P. Lipparini, The compactness spectrum of abstract logics, large cardinals and combinatorial principles, Boll. Unione…
We present three models concerning Tukey types of ultrafilters on $\omega$. The first model is built via a countable support iteration, and we show there is no basically generated ultrafilter in such model. The second and third models are…
A tower is a sequence of simplicial complexes connected by simplicial maps. We show how to compute a filtration, a sequence of nested simplicial complexes, with the same persistent barcode as the tower. Our approach is based on the coning…
We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…
We study fundamental clustering problems for incomplete data. Specifically, given a set of incomplete d-dimensional vectors (representing rows of a matrix), the goal is to complete the missing vector entries in a way that admits a…
Characterizations of ultrafilters belong to the smallest ideal of Stone-\v{C}ech compactification of a discrete semigroup are exhibited using syndetic sets, strongly central sets and very strongly central sets respectively. These lead to…
In the constructible universe, we construct a co-analytic maximal family of pairwise eventually different functions from $\mathbb{N}$ to $\mathbb{N}$ which remains maximal after adding arbitrarily many Sacks reals (by a countably supported…
One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\mathcal{P}_q(n)$ for a given minimum distance. The…
Existing results of Fu show that, if two finite sets of roots of unity are projectively equivalent by a projective automorphism that does not act bijectively on the set of all roots of unity, then these sets consist of at most 14 points.…
We provide a characterization of when a countably infinite set of finite sets contains an infinite sunflower. We also show that the collection of such sets is Turing equivalent to the set of programs such that whenever the program converges…
We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…
Given two infinite cardinals $\kappa$ and $\lambda$, we introduce and study the notion of a $\kappa$-barely independent family over $\lambda.$ We provide some conditions under which these types of families exist. In particular, we relate…
We characterize sums of normal ultrafilters after the Magidor iteration (product) of Prikry forcings over a discrete set of measurable cardinals. We apply this to show that the weak Ultrapower Axiom is not equivalent to the Ultrapower…
Answering a question of Dobrinen and Todorcevic, we prove that below any stable ordered-union ultrafilter $\mathcal{U}$, there are exactly four nonprincipal Tukey classes: $[\mathcal{U}], [\mathcal{U}_{\operatorname{min}}],…
We survey some connections between topological dynamics, semigroups of ultrafilters, and combinatorics. As an application, we give a proof, based on ideas of Bergelson and Hindman, of the Hales-Jewett partition theorem.