Related papers: Subcompact cardinals, type omission and ladder sys…

We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary sequences. On the combinatorial side, we study the rotation lattices on permutrees and their lattice homomorphisms, unifying the weak order,…

We show that for any uncountable cardinal $\lambda$, the category of sets of cardinality at least $\lambda$ and monomorphisms between them cannot appear as the category of point of a topos, in particular is not the category of models of a…

Let $\kappa$ be a regular cardinal, $\lambda<\kappa$ be a smaller infinite cardinal, and $\mathsf K$ be a $\kappa$-accessible category where colimits of $\lambda$-indexed chains exist. We show that various category-theoretic constructions…

A model M of cardinality lambda is said to have the small index property if for every G subseteq Aut(M) such that [Aut(M):G] <= lambda there is an A subseteq M with |A|< lambda such that Aut_A(M) subseteq G. We show that if M^* is a…

We discuss matching control laws for underactuated systems. We previously showed that this class of matching control laws is completely charactarized by a linear system of first order partial differential equations for one set of variables…

We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…

We summarize the known methods of producing a non-supercompact strongly compact cardinal and describe some new variants. Our Main Theorem shows how to apply these methods to many cardinals simultaneously and exactly control which cardinals…

We isolate a new large cardinal concept, "remarkability." Consistencywise, remarkable cardinals are between ineffable and omega-Erdos cardinals. They are characterized by the existence of "0^sharp-like" embeddings; however, they relativize…

Cardinal functions provide valuable insight into the topological properties of spaces, helping to analyze and compare spaces in terms of their covering, convergence and separation properties. This paper focuses on investigating cardinal…

Let C denote any of the following cardinal characteristics of Boolean algebras: incomparability, spread, character, pi-character, hereditary Lindelof number, hereditary density. It is shown to be consistent that there exists a sequence…

Let P be the direct product of countably many copies of the additive group Z of integers. We study, from a set-theoretic point of view, those subgroups of P for which all homomorphisms to Z annihilate all but finitely many of the standard…

Incomplete pairwise comparison matrices offer a natural way of expressing preferences in decision making processes. Although ordinal information is crucial, there is a bias in the literature: cardinal models dominate. Ordinal models usually…

We consider the partition lattice $\Pi_\kappa$ on any set of transfinite cardinality $\kappa$ and properties of $\Pi_\kappa$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of…

Building on work of Holy, L\"ucke and Njegomir \cite{MR3913154} on small embedding characterizations of large cardinals, we use some classical results of Baumgartner (see \cite{MR0384553} and \cite{MR0540770}), to give characterizations of…

In this paper we investigate some properties of first order theories which prevent them from having universal models under certain cardinal arithmetic assumptions. Our results give a new syntactical condition, oak property, which is a…

Assume $\lambda$ is a singular limit of $\eta$ supercompact cardinals, where $\eta \leq \lambda$ is a limit ordinal. We present two forcing methods for making $\lambda^+$ the successor of the limit of the first $\eta$ measurable cardinals…

For a free ultrafilter U on omega we study several cardinal characteristics which describe part of the combinatorial structure of U. We provide various consistency results; e.g. we show how to force simultaneously many characters and many…

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…

We extend and improve the result of Makkai and Par\'e that the powerful image of any accessible functor F is accessible, assuming there exists a sufficiently large strongly compact cardinal. We reduce the required large cardinal assumption…