Related papers: A note on some example of NSOP1 theories
Motivated by global warming issues, we consider a time se- ries that consists of a nondecreasing trend observed with station- ary fluctuations, nonparametric estimation of the trend under monotonicity assumption is considered. The rescaled…
In two recent papers we introduced some new techniques for constructing an extension of a probability-preserving system $T:\mathbb{Z}^d\curvearrowright (X,\mu)$ that enjoys certain desirable properties in connexion with the asymptotic…
In this note, we prove that Kim-dividing over models is always witnessed by a coheir Morley sequence in NATP theories. Following the strategy of Chernikov and Kaplan [8], we obtain some corollaries which hold in NATP theories. Namely, (i)…
We give a new proof of the NIP arithmetic regularity lemma for finite groups (due to the authors and Pillay), which describes the approximate structure of "NIP sets" in finite groups, i.e., subsets whose collection of left translates has…
Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…
We study the effects of the sequence on the propagation of nonlinear excitations in simple models of DNA in which we incorporate actual DNA sequences obtained from human genome data. We show that kink propagation requires forces over a…
The physical motivations and the basic construction rules for Type I strings and M-theory compactifications are reviewed in light of the recent developments. The first part contains the basic theoretical ingredients needed for building…
Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key…
We give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which generalize to new settings. More concretely, in the first part of the paper, we give a new proof of Yao's XOR-Lemma…
We summarize our investigations of several aspects of $\mathcal{N}=1$ supersymmetric Yang-Mills (SYM) theory. We present our final results for SU(3) $\mathcal{N}=1$ SYM simulated with Wilson fermions. We also discuss the first test of the…
We investigate the possibility to construct extended parafermionic conformal algebras whose generating current has spin $1+\frac{1}{K}$, generalizing the superconformal (spin 3/2) and the Fateev Zamolodchikov (spin 4/3) algebras. Models…
Supersymmetric gauge theories are characterized by the existence of a transformation of the bosonic fields (Nicolai map) such that the Jacobi determinant of the transformation equals the product of the Matthews-Salam-Seiler and…
We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…
This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability…
In this work we use the deformation procedure and explore the route to obtain distinct field theory models that present similar stability potentials. Starting from systems that interact polynomially or hyperbolically, we use a deformation…
We describe three different approaches to the extended (N=2) supersymmetrization of the multicomponent KP hierarchy. In the first one we utilize only superfermions while in the second only superbosons and in the third superbosons as well as…
We study approximation in the unit interval by rational numbers whose numerators are selected randomly with certain probabilities. Previous work showed that an analogue of Khintchine's Theorem holds in a similar random model and raised the…
We investigate the notions of strict independence and strict non-forking, and establish basic properties and connections between the two. In particular it follows from our investigation that in resilient theories strict non-forking is…
We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that…
Consider tossing a collection of coins, each fair or biased towards heads, and take the distribution of the total number of heads that result. It is natural to conjecture that this distribution should be 'more random' when each coin is…