Related papers: The subcompleteness of diagonal Prikry forcing

We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of applications as in many cases errors in evaluation of a…

In this paper we introduce and study the notion of dynamical forcing. Basically, we develop a toolkit of techniques to produce finitely presented groups which can only act on the circle with certain prescribed dynamical properties. As an…

Let $\mathcal{SN}$ be the $\sigma$-ideal of the strong measure zero sets of reals. We present general properties of forcing notions that allow to control of the additivity of $\mathcal{SN}$ after finite support iterations. This is applied…

In descending generality I survey: five partial orderings of graphs, the induced-subgraph ordering, and examples like perfect, threshold, and mock threshold graphs. The emphasis is on how the induced subgraph ordering differs from other…

We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof is by interpolation and uses the Mapping Reflection Principle.

Let mu be singular of uncountable cofinality. If mu>2^{cf(mu)}, we prove that in P=([mu]^mu,supseteq) as a forcing notion we have a natural complete embedding of Levy(aleph_0, mu^+) (so P collapses mu^+ to aleph_0) and even Levy(aleph_0,…

Let GCH hold and let $j:V\longrightarrow M$ be a definable elementary embedding such that $crit(j)=\kappa$, $^{\kappa}M\subseteq M$ and $\kappa^{++}=\kappa_{M}^{++}$. H. Woodin proved that there is a cofinality preserving generic extension…

We explore properties of generalized Paley graphs and we extend a result of Lim and Praeger by providing a more precise description of the connected components of disconnected generalized Paley graphs. This result leads to a new…

Given a Woodin cardinal $\delta$, I show that if $F$ is any Easton function with $F"\delta\subseteq\delta$ and $\GCH$ holds, then there is a cofinality-preserving forcing extension in which $2^\gamma= F(\gamma)$ for each regular cardinal…

Given a forcing notion $P$ that forces certain values to several classical cardinal characteristics of the reals, we show how we can compose $P$ with a collapse (of a cardinal $\lambda>\kappa$ to $\kappa$) such that the composition still…

This paper defines a Mitchell rank for supercompact cardinals. If $\kappa$ is a $\theta$-supercompact cardinal then $o_{\theta-sc}(\kappa) = \sup \{ o_{\theta-sc}(\mu) + 1 \ | \ \mu \in m(\kappa)\}$, where $m(\kappa)$ is the collection of…

We obtain a small ultrafilter number at $\aleph_{\omega_1}$. Moreover, we develop a version of the overlapping strong extender forcing with collapses which can keep the top cardinal $\kappa$ inaccessible. We apply this forcing to construct…

Smallish large cardinals $\kappa$ are often characterized by the existence of a collection of filters on $\kappa$, each of which is an ultrafilter on the subsets of $\kappa$ of some transitive $\mathrm{ZFC}^-$-model of size $ \kappa$. We…

W.H. Woodin showed that if $\kappa_1 < \cdots < \kappa_n$ are strong cardinals then two-step ${\bf\Sigma}^1_{n+3}$ generic absoluteness holds after collapsing $2^{2^{\kappa_n}}$ to be countable. We show that this number can be reduced to…

Let $D$ be a simple digraph (directed graph) with vertex set $V(D)$ and arc set $A(D)$ where $n=|V(D)|$, and each arc is an ordered pair of distinct vertices. If $(v,u) \in A(D)$, then $u$ is considered an \emph{out-neighbor} of $v$ in $D$.…

Mining subgraphs with interesting structural properties from networks (or graphs) is a computationally challenging task. In this paper, we propose two algorithms for enumerating all connected induced subgraphs of a given cardinality from…

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…

Mirsky proved that, for the existence of a complex matrix with given eigenvalues and diagonal entries, the obvious necessary condition is also sufficient. We generalize this theorem to matrices over any field and provide a short proof.…

We study the possible structures which can be carried by sets which have no countable subset, but which fail to be `surjectively Dedekind finite', in two possible senses, that there is a surjection to $\omega$, or alternatively, that there…