相关论文: Generating ultrafilters in a reasonable way
We consider a combinatorial question about searching for an unknown ideal $\mu$ within a known poset $\lambda$. Elements of $\lambda$ may be queried for membership in $\mu$, but at most $k$ positive query results are permitted. The goal is…
We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…
We generalize the Hart-Shelah example \cite{HaSh:323} to higher infinitary logics. We build, for each natural number $k\geq 2$ and for each infinite cardinal $\lambda$, a sentence $\psi_k^\lambda$ of the logic $L_{(2^\lambda)^+,\omega}$…
Elegant and general algorithms for handling upwards-closed and downwards-closed subsets of WQOs can be developed using the filter-based and ideal-based representation for these sets. These algorithms can be built in a generic or…
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…
We provide a model theoretical and tree property like characterization of $\lambda$-$\Pi^1_1$-subcompactness and supercompactness. We explore the behaviour of those combinatorial principles at accessible cardinals.
We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of…
We introduce the notion of additive filter and present a new proof of the existence of idempotent ultrafilters on N without any use of Zorn's Lemma, and where one only assumes the Ultrafilter Theorem for the continuum.
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…
The aim of this paper is to study the canonical filtration $L(\lambda)_l$ of an irreducible finite dimensional $\operatorname{SL}(V)$-module $L(\lambda)$ using the universal enveloping algebra $U(\mathfrak{sl}(V))$ and the annihilator ideal…
This note shows how recent work of Eskew and Hayut can be combined with a method of Raghavan and Shelah to show the consistency of $\mathfrak u_\kappa<2^\kappa$ for $\aleph_3\leq \kappa<\aleph_{\omega}$, from a huge cardinal.
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
We construct a fundamental theory of the derived category of non-finite bi-filtered complexes.
Problems about attainability in topological spaces are considered. Some nonsequential version of the Warga approximate solutions is investigated: we use filters and ultrafilters of measurable spaces. Attraction sets are constructed.
By using nonstandard analysis, and in particular iterated hyper-extensions, we give foundations to a peculiar way of manipulating ultrafilters on the natural numbers and their pseudo-sums. The resulting formalism is suitable for…
In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…
We consider the universal discrete filtering problem, where an input sequence generated by an unknown source passes through a discrete memoryless channel, and the goal is to estimate its components based on the output sequence with limited…
We address a number of problems on Boolean Algebras. For example, we construct, in ZFC, for any BA B, and cardinal kappa BAs B_1,B_2 extending B such that the depth of the free product of B_1,B_2 over B is strictly larger than the depths of…
It is well-known that many famous pooling designs are constructed from mathematical structures by the "containment matrix" method. In this paper, we propose another method and obtain a family of pooling designs with surprisingly high degree…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…