Related papers: Sweet & Sour and other flavours of ccc forcing not…
We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A >>Cohen algebra<< is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of…
We expand the results of Roslanowski and Shelah arXive:1806.06283 , arXive:1909.00937 to all perfect Abelian Polish groups $(H,+)$. In particular, we show that if $\alpha<\omega_1$ and $4\leq k<\omega$, then there is a ccc forcing notion…
We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the stochastic dominance relation between fractional or randomized…
In a self-contained way, we deal with revised countable support iterated forcing for the reals. We improve theorems on preservation of the property UP, weaker than semi proper, and we hopefully improve the presentation. We continue [Sh:b,…
We analyze constraints on low-energy flavour-changing sfermion mass terms, coming from FCNC and CP violating processes, in the model-independent framework of the mass insertion method. We discuss the relevance of these constraints as tests…
Given an inner model $W \subset V$ and a regular cardinal $\kappa$, we consider two alternatives for adding a subset to $\kappa$ by forcing: the Cohen poset $Add(\kappa,1)$, and the Cohen poset of the inner model $Add(\kappa,1)^W$. The…
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),…
The soft bootstrap program aims to construct consistent effective field theories (EFT's) by recursively imposing the desired soft limit on tree-level scattering amplitudes through on-shell recursion relations. A prime example is the leading…
In this note, we investigate the implications of classical soft theorems for the formalism developed by Kosower, Maybee and O'Connell (KMOC) to derive classical observables in gauge theory and gravity from scattering amplitudes. In…
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…
In this paper we continue the study of equivalence of generics filters started by Smythe in [Smy22]. We fully characterize those forcing posets for which the corresponding equivalence of generics is smooth using the purely topological…
We present an algorithm for strongly refuting smoothed instances of all Boolean CSPs. The smoothed model is a hybrid between worst and average-case input models, where the input is an arbitrary instance of the CSP with only the negation…
As one of the three main pillars of fine-grained complexity theory, the 3SUM problem explains the hardness of many diverse polynomial-time problems via fine-grained reductions. Many of these reductions are either directly based on or…
In this paper we look at popular fairness methods that use causal counterfactuals. These methods capture the intuitive notion that a prediction is fair if it coincides with the prediction that would have been made if someone's race, gender…
With every $\sigma$-ideal $I$ on a Polish space we associate the $\sigma$-ideal $I^*$ generated by the closed sets in $I$. We study the forcing notions of Borel sets modulo the respective $\sigma$-ideals $I$ and $I^*$ and find connections…
We explored the possibility that Higgs coupling to new physics violates flavor universality. In particular, we parameterize such models with dimension-six effective operators which modify the coupling between the first generation quarks,…
A strong antidiamond principle (*c) is shown to be consistent with CH. This principle can be stated as a "P-ideal dichotomy": every P-ideal on omega-1 (i.e. an ideal that is sigma-directed under inclusion modulo finite) either has a closed…
Accurately segmenting a citation string into fields for authors, titles, etc. is a challenging task because the output typically obeys various global constraints. Previous work has shown that modeling soft constraints, where the model is…
A recent trend of fair machine learning is to define fairness as causality-based notions which concern the causal connection between protected attributes and decisions. However, one common challenge of all causality-based fairness notions…
We consider massless scattering from the point of view of the position, momentum, and celestial bases. In these three languages different properties of physical processes become manifest or obscured. Within the soft sector, they highlight…