Related papers: MA$_{\omega_1}(S)[S]$ does not imply $\mathcal{K}_…

We describe the possible values of $K$-theory for $C(X)$ when $X$ is a co-existentially closed continuum. As a consequence we also show that all pseudo-solenoids, except perhaps the universal one, are not co-existentially closed.

We continue the investigation started in [Sh:1215] about the relation between the Keilser-Shelah isomorphism theorem and the continuum hypothesis. In particular, we show it is consistent that the continuum hypothesis fails and for any given…

We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…

We present a simple and purely combinatorial proof of Steel's result according to which the core model is \Sigma^1_3 correct under the appropriate hypotheses.

Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…

We study the behavior of matrix string theory in the strong coupling region, where it is expected to reduce to discrete light-cone type IIA superstring. In the large $N$ limit, the reduction corresponds to the double-dimensional reduction…

For $S$ a set of positive integers, and $k$ and $r$ fixed positive integers, denote by $f(S,k;r)$ the least positive integer $n$ (if it exists) such that within every $r$-coloring of $\{1,2,...,n\}$ there must be a monochromatic sequence…

A classical problem, due to Gerencs\'er and Gy\'arf\'as from 1967, asks how large a monochromatic connected component can we guarantee in any $r$-edge colouring of $K_n$? We consider how big a connected component can we guarantee in any…

In this paper we explore the representation property over sets. This property generalizes constructibility, however is weak enough to enable us to prove that the class of theories $T$ whose models are representable is exactly the class of…

Let $\ell$ be a prime number, $k$ a positive integer and consider the group $\Gamma_{\ell^k} :=\langle a,b\ \vert\ a^{\ell^k(\ell^k-1)}ba^{-\ell^k}b^{-2}\rangle$. We prove that $\Gamma_{\ell^k}$ is not $\mathrm{SL}_2$-weakly integral with…

Two competing models for strong hadronic decays, the $^3P_0$ and $^3S_1$ models, are currently in use. Attempts to rule out one or the other have been hindered by a poor understanding of final state interactions and by ambiguities in the…

Let $F$ be a totally real field and $K$ a finite abelian CM extension of $F$. Using class field theory, we show that our previous result giving a strong form of the Brumer-Stark conjecture implies the minus part of the equivariant Tamagawa…

Consider an a.e.c. (abstract elementary class), that is, a class K of models with a partial order refining inclusion (submodel) which satisfy the most basic properties of an elementary class. Our test question is trying to show that the…

Let $S$ be the group of finitely supported permutations of a countably infinite set. Let $K[S]$ be the group algebra of $S$ over a field $K$ of characteristic $0$. According to a theorem of Formanek and Lawrence, $K[S]$ satisfies the…

We establish a "neighborhood" variant of the cubical KKM lemma and the Lebesgue covering theorem and deduce a discretized version which is a "neighborhood" variant of Sperner's lemma on the cube. The main result is the following: for any…

Let $G$ be a graph and $r\in\mathbb{N}$. The matching Kneser graph $\textsf{KG}(G, rK_2)$ is a graph whose vertex set is the set of $r$-matchings in $G$ and two vertices are adjacent if their corresponding matchings are edge-disjoint. In…

We consider a generalization of the classic Sperner lemma. This lemma states that every Sperner coloring of a triangulation of a simplex contains a fully colored simplex. We found a weaker assumption than Sperner's coloring. It is also…

In this article, we prove that Ramsey's theorem for pairs and two colors is $\Pi^1_1$-conservative over~$\mathsf{RCA}_0 + \mathsf{B}\Sigma^0_2 + \mathsf{WF}(\epsilon_0)$ and over~$\mathsf{RCA}_0 + \mathsf{B}\Sigma^0_2 + \bigcup_n…

The well-known Koml\'os conjecture states that given $n$ vectors in $\mathbb{R}^d$ with Euclidean norm at most one, there always exists a $\pm 1$ coloring such that the $\ell_{\infty}$ norm of the signed-sum vector is a constant independent…

The main result of this paper shows that if $\mathcal{M}$ is a consistent strong linear Maltsev condition which does not imply the existence of a cube term, then for any finite algebra $\mathbb{A}$ there exists a new finite algebra…