Related papers: A symmetric $\beta$-model

We prove that a countable simple unidimensional theory that eliminates hyperimaginaries is supersimple. This solves a problem of Shelah in the more general context of simple theories under weak assumptions.

A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…

This paper considers statistical inference for the explained variance $\beta^{\intercal}\Sigma \beta$ under the high-dimensional linear model $Y=X\beta+\epsilon$ in the semi-supervised setting, where $\beta$ is the regression vector and…

A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…

Let $\beta \equiv \{ \beta_\mathbf{i} \}_{\mathbf{i} \in \mathbb{Z}_+^d}$ be a $d$-dimensional multisequence. Curto and Fialkow, have shown that if the infinite moment matrix $M(\beta)$ is finite-rank positive semidefinite, then $\beta$ has…

We sketch a tentative proof of P-completeness for the $\beta$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $\lambda$-terms.

We prove that a real x is 1-generic if and only if every differentiable computable function has continuous derivative at x. This provides a counterpart to recent results connecting effective notions of randomness with differentiability. We…

We prove that superdeterministic models of quantum mechanics are conspiratorial in a mathematically well-defined sense, by further development of the ideas presented in a previous article $\mathcal{A}$. We consider a Bell scenario where, in…

We show that if a separable space X has a meager open subset containing a copy of the Cantor set 2^\omega, then X has $\frak{c}$ types of countable dense subsets. We suggest a generalization of the \lambda-set for non-separable spaces. Let…

The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…

We show that for each countable simplicial complex P the following conditions are equivalent: (1) $P \in AE(X)$ iff $P \in AE(\beta X)$ for any space X; (2) There exists a P-invertible map of a metrizable compactum X with $P \in AE(X)$ onto…

When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq \alpha X$ and $|B| \geq \beta X$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (\alpha…

We study the structure of the partial order induced by the definability relation on definitions of truth for the language of arithmetic. Formally, a definition of truth is any sentence $\alpha$ which extends a weak arithmetical theory…

Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…

Suppose $\alpha$ is a rotationally symmetric norm on $L^{\infty}\left(\mathbb{T}\right) $ and $\beta$ is a "nice" norm on $L^{\infty}\left(\Omega,\mu \right) $ where $\mu$ is a $\sigma$-finite measure on $\Omega$. We prove a version of…

We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we…

Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…

A real X is defined to be relatively c.e. if there is a real Y such that X is c.e.(Y) and Y does not compute X. A real X is relatively simple and above if there is a real Y <_T X such that X is c.e.(Y) and there is no infinite subset Z of…

We show that for every countable recursively saturated model $M$ of Peano Arithmetic and every subset $A \subseteq M$, there exists a full satisfaction class $S_A \subset M^2$ such that $A$ is definable in $(M,S_A)$ without parametres. It…

An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…