Related papers: The Largest Suslin Axiom

We establish a general min-max type theorem that produces minimal surfaces with prescribed genus in 3-manifolds with positive Ricci curvature. An important intermediate step is to show that, in a generic metric with positive Ricci…

This paper associates a dual problem to the minimization of an arbitrary linear perturbation of the robust sum function introduced in DOI 10.1007/s11228-019-00515-2. It provides an existence theorem for primal optimal solutions and, under…

We develop a general theory for class-sized symmetric systems as a natural extension of symmetric systems with respect to class forcing. In particular, adapting the usual notions of pretameness and tameness for class forcing, we present…

We discuss a conjecture of Wilson that under the proper forcing axiom, $\Theta_0$ of the derived model at $\kappa$ is below $\kappa^+$. We prove the conjecture holds for the old derived model. Assuming mouse capturing in the new derived…

In this paper, we present a proof of the consistency of the New Foundations set theory ($\mathit{NF}$). $\mathit{NF}$'s main idea is to permit very large sets (including the Universal Set) by restricting set formation to stratified…

The first aim of this note is to give a concise, but complete and self-contained, presentation of the fundamental theorems of Mori theory - the nonvanishing, base point free, rationality and cone theorems - using modern methods of…

Let $f:(X,B)\to Z$ be a 3-fold extremal dlt flipping contraction defined over an algebraically closed field of characteristic $p>5$, such that the coefficients of $\{B\}$ are in the standard set $\{1-\frac 1n|n\in \mathbb N\}$, then the…

*Minimal sufficient reasons* represent a prevalent form of explanation - the smallest subset of input features which, when held constant at their corresponding values, ensure that the prediction remains unchanged. Previous *post-hoc*…

We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…

We prove, without set theoretic assumptions, that every locally presentable category C endowed with a tractable cofibrantly generated class of cofibrations has a unique minimal (or left induced) Quillen model structure. More generally, for…

We consider the symmetric binary perceptron model, a simple model of neural networks that has gathered significant attention in the statistical physics, information theory and probability theory communities, with recent connections made to…

In chapter 9 of his book "The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal", Woodin shows how to force the Strong Chang Conjecture over models of determinacy using $\mathbb{P}_{\mathrm{max}}$. We show here how a…

We develop an axiomatic set theory -- the Theory of Hyperfinite Sets THS, which is based on the idea of existence of proper subclasses of big finite sets. We demonstrate how theorems of classical continuous mathematics can be transfered to…

For neural models to garner widespread public trust and ensure fairness, we must have human-intelligible explanations for their predictions. Recently, an increasing number of works focus on explaining the predictions of neural models in…

The main goal of this note is to prove the following theorem. If $A_n$ is a sequence of measurable sets in a $\sigma$-finite measure space $(X, \mathcal{A}, \mu)$ that covers $\mu$-a.e. $x \in X$ infinitely many times, then there exists a…

This paper analyzes full HOD of natural models of AD^+ under a certain smallness assumption of the models. This assumption is made to utilize Sargsyan's work on the theory of hod mice. We show that HOD is a fine-structural model and in…

We prove the long-standing conjecture on the coset construction of the minimal series principal $W$-algebras of $ADE$ types in full generality. We do this by first establishing Feigin's conjecture on the coset realization of the universal…

We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…

Providing compact and understandable counterexamples for violated system properties is an essential task in model checking. Existing works on counterexamples for probabilistic systems so far computed either a large set of system runs or a…

Large neural network models have high predictive power but may suffer from overfitting if the training set is not large enough. Therefore, it is desirable to select an appropriate size for neural networks. The destructive approach, which…