Related papers: Sequences with increasing subsequence
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…
For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…
We study ideals $\mathcal{I}$ on $\mathbb{N}$ satisfying the following Baire-type property: if $X$ is a complete metric space and $\{X_{A} \colon A \in \mathcal{I} \}$ is a family of nowhere dense subsets of $X$ with $X_{A} \subset X_{B}$…
Following Laczkovich we consider the partially ordered set $\iB_1(\RR)$ of Baire class 1 functions endowed with the pointwise order, and investigate the order types of the linearly ordered subsets. Answering a question of Komj\'ath and…
Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary "propositional" logic should in general be the logic of subsets of a given universe set. Partitions on…
The Suslin hypothesis states that there are no nonseparable complete dense linear orderings without endpoints which have the countable chain condition. $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$ proves the Suslin hypothesis. In…
We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the…
We study the coarse classification of partial orderings using chain conditions in the context of descriptive combinatorics. We show that (unlike the Borel counterpart of many other combinatorics), we have a distinct hierarchy of different…
Given an integer $n$, we introduce the integral Lie ring of partitions with bounded maximal part, whose elements are in one-to-one correspondence to integer partitions with parts in $\{1,2,\dots, n-1\}$. Starting from an abelian subring, we…
We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…
A Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation…
The Baire algebra of a topological space $X$ is the quotient of the algebra of all subsets of $X$ modulo the meager sets. We show that this Boolean algebra can be endowed with a natural closure operator, resulting in a closure algebra which…
Every reduced ring $R$ has a natural partial order defined by $a\le b$ if $a^2=ab$; it generalizes the natural order on a boolean ring. The article examines when $R$ is a lower semi-lattice in this order with examples drawn from weakly Baer…
A slalom is a sequence of finite sets of length omega. Slaloms are ordered by coordinatewise inclusion with finitely many exceptions. Improving earlier results of Mildenberger, Shelah and Tsaban, we prove consistency results concerning…
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
Partial orders are a natural model for the social hierarchies that may constrain "queue-like" rank-order data. However, the computational cost of counting the linear extensions of a general partial order on a ground set with more than a few…
A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…
We construct Luzin-type subsets of the real line in all finite powers Rothberger, with a non-Menger product. To this end, we use a purely combinatorial approach which allows to weaken assumptions used earlier to construct sets with…
In this paper we consider a notion of $\mathcal{I}$-Luzin set which generalizes the classical notion of Luzin set and Sierpi{\'n}ski set on Euclidean spaces. We show that there is a translation invariant $\sigma$-ideal $\mathcal{I}$ with…