Related papers: Some implications of Ramsey Choice for n-element s…

A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. The paper studies Rogers semilattices, i.e. upper semilattices induced by the reducibility between numberings, for families…

Using ideas from Shelah's recent proof that a completely separable maximal almost disjoint family exists when $\c < {\aleph}_{\omega}$, we construct a weakly tight family under the hypothesis $\s \leq \b < {\aleph}_{\omega}$. The case when…

In this article, we show test properties, in the sense of finitely many vanishing of Ext or Tor, of CM (Cohen-Macaulay) modules whose multiplicity and number of generators (resp., type) are related by certain inequalities. We apply these…

A system of uniform families on an infinite subset $M$ of $\nn$ is a collection $(\cca_{\xi})_{\xi<\omega_1}$ of families of finite subsets of $\nn$ (where, $\cca_k$ consists of all $k$--element subset of $M$, for $k\in \nn$) with the…

Let (W,S) be a finite rank Coxeter system with W infinite. We prove that the limit weak order on the blocks of infinite reduced words of W is encoded by the topology of the Tits boundary of the Davis complex X of W. We consider many special…

Ramsey's theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdos and Fred Galvin proved that for each coloring f, there is an infinite set that is "packed together" which…

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

The star-critical Ramsey number is a refinement of the concept of a Ramsey number. In this paper, we give equivalent criteria for which the star-critical Ramsey number vanishes. Next, we provide a new general lower bound for multicolor…

We focus on formulae $\exists X.\, \varphi(\vec{Y}, X)$ of monadic second-order logic over the full binary tree, such that the witness $X$ is a well-founded set. The ordinal rank $\mathrm{rank}(X) < \omega_1$ of such a set $X$ measures its…

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…

In this thesis, we investigate the computational content and the logical strength of Ramsey's theorem and its consequences. For this, we use the frameworks of reverse mathematics and of computable reducibility. We proceed to a systematic…

For an element $g$ of a group $G$, a right Engel sink of $g$ is a subset of $G$ containing all sufficiently long commutators $[...[[g ,x],x],\dots ,x]$ for all $x\in G$. A left Engel sink of $g$ is a subset of $G$ containing all…

In this paper, we show that one of the conditions in the definition of weak tracial Rokhlin property for finite group actions on simple unital C*-algebras can be replaced by a seemingly weaker condition, or a seemingly stronger condition.…

We write $S_{\leq n}(A)$ and $\Part_{\fin}(A)$ for the set of permutations with at most $n$ non-fixed points, where $n$ is a natural number, and the set of partitions whose members are finite, respectively, of a set $A$. Among our results,…

Let $\Omega$, $\Omega'\subset\mathbb{R}^n$ be bounded domains and let $f_m\colon\Omega\to\Omega'$ be a sequence of homeomorphisms with positive Jacobians $J_{f_m} >0$ a.e. and prescribed Dirichlet boundary data. Let all $f_m$ satisfy the…

We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$. We prove that the following are equivalent over the weak…

We consider a special class of weak dependent random variables with control on covariances of Lipschitz transformations. This class includes, but is not limited to, positively, negatively associated variables and a few other classes of…

A function from sequences to their subsequences is called selection function. A selection function is called admissible (with respect to normal numbers) if for all normal numbers, their subsequences obtained by the selection function are…

The principle $ADS$ asserts that every linear order on $\omega$ has an infinite ascending or descending sequence. This has been studied extensively in the reverse mathematics literature, beginning with the work of Hirschfeldt and Shore. We…

An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in…