Related papers: The Largest Suslin Axiom

In this paper, we present a more complete version of the minimax theorem established in [7]. As a consequence, we get, for instance, the following result: Let $X$ be a compact, not singleton subset of a normed space $(E,\|\cdot\|)$ and let…

A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…

In this paper we prove that every set $A\subset\mathbb{Z}$ satisfying the inequality $\sum_{x}\min(1_A*1_A(x),t)\le(2+\delta)t|A|$ for $t$ and $\delta$ in suitable ranges, then $A$ must be very close to an arithmetic progression. We use…

We introduce an abstract framework for forcing over a free Suslin tree with suborders of products of forcings which add some structure to the tree using countable approximations. The main ideas of this framework are consistency, separation,…

We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…

We introduce several axioms which may or may not hold for any given subgraph of the directed graph of all organisms (past, present and future) where edges represent biological parenthood, with the simplifying background assumption that life…

We consider the asymptotic consistency of maximum likelihood parameter estimation for dynamical systems observed with noise. Under suitable conditions on the dynamical systems and the observations, we show that maximum likelihood parameter…

We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

Model selection consistency in the high-dimensional regression setting can be achieved only if strong assumptions are fulfilled. We therefore suggest to pursue a different goal, which we call a minimal class of models. The minimal class of…

For an optimal control problem, the concept of a strong local infimum is introduce, for which necessary conditions consisting of some family of "maximum principles" are formulated. If a function delivers a strong local minimum in this…

When constructing models of the world, we aim for optimal compressions: models that include as few details as possible while remaining as accurate as possible. But which details -- or features measured in data -- should we choose to include…

Building on recent work of Krueger and the second author, we prove the consistency of the Guessing Model Principle at $\omega_2$ together with the existence of an almost Kurepa Suslin tree. In particular, it is consistent that the Guessing…

We conjecture that the exceptional set in Manin's Conjecture has an explicit geometric description. Our proposal includes the rational point contributions from any generically finite map with larger geometric invariants. We prove that this…

We describe a method of building ``nice'' sigma-ideals from Souslin ccc forcing notions. [These notes were written down in 1992, but were not submitted to any journal. In a slightly modified form, they were incorporated to: T. Bartoszynski…

We give a model where there is a ccc Souslin forcing which does not satisfy the Knaster condition. Next, we present a model where there is a sigma-linked not sigma-centered Souslin forcing such that all its small subsets are sigma-centered…

We prove a continuous Freiman's $3k-4$ theorem for small sumsets in $\mathbb{R}$ by using some ideas from Ruzsa's work on measure of sumsets in $\mathbb{R}$ as well as some graphic representation of density functions of sets. We thereby get…

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

In this note we propose a min-max theory for embedded hypersurfaces with a fixed boundary and apply it to prove several theorems about the existence of embedded minimal hypersurfaces with a given boundary. A simpler variant of these…