Related papers: $\Psi$-Spaces and Semi-Proximality

We consider maximal almost disjoint families of block subspaces of countable vector spaces, focusing on questions of their size and definability. We prove that the minimum infinite cardinality of such a family cannot be decided in ZFC and…

We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…

We recall some classical results relating normality and some natural weakenings of normality in $\Psi$-spaces over almost disjoint families of branches in the Cantor tree to special sets of reals like $Q$-sets, $\lambda$-sets and…

We conjecture that PPAD has a PCP-like complete problem, seeking a near equilibrium in which all but very few players have very little incentive to deviate. We show that, if one assumes that this problem requires exponential time, several…

In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…

In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff function allows us to provide algorithms for finding approximate equilibria in these…

We give a converging semidefinite programming hierarchy of outer approximations for the set of quantum correlations of fixed dimension and derive analytical bounds on the convergence speed of the hierarchy. In particular, we give a…

We study the extent to which it is possible to approximate the optimal value of a Unique Games instance in Fixed-Point Logic with Counting (FPC). Formally, we prove lower bounds against the accuracy of FPC-interpretations that map Unique…

We introduce a new class of almost disjoint families which we call fin-intersecting almost disjoint families. They are related to almost disjoint families whose Vietoris Hyperspace of their Isbell-Mr\'owka spaces are pseudocompact. We show…

Let \mathbb{F}_q^{n+l} denote the (n+l)-dimensional singular linear space over a finite field \mathbb{F}_q. For a fixed integer m\leq\min\{n,l\}, denote by \mathcal{L}^m_o(\mathbb{F}_q^{n+l}) the set of all subspaces of type (t,t_1), where…

We show that strong approximate lattices in higher-rank semi-simple algebraic groups are arithmetic.

Here we have studied the idea of semi Lamda*-closed sets and investigate some of their properties in spaces considered by A. D. Alexandroff [1]. We have introduced some new separation axioms namely semi-Tw/4, , semi-T3w/8, semi-T5w/8, and…

Let $G$ and $G'$ be simple Lie groups of equal real rank and real rank at least $2$. Let $\Gamma <G$ and $\Lambda < G'$ be non-uniform lattices. We prove a theorem that often implies that any quasi-isometric embedding of $\Gamma$ into…

In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…

An almost disjoint family $\mathcal A$ of subsets of $\mathbb N$ is said to be $\mathbb R$-embeddable if there is a function $f:\mathbb N\rightarrow \mathbb R$ such that the sets $f[A]$ are ranges of real sequences converging to distinct…

In this paper we discuss constraints on two-dimensional quantum-mechanical systems living in domains with boundaries. The constrains result from the requirement of hermicity of corresponding Hamiltonians. We construct new two-dimensional…

Answering questions of A. Avil\'es, F. Cabello S\'anchez, J. Castillo, M. Gonz\'alez and Y. Moreno we show that the following statements are independent of the usual axioms ZFC with arbitrarily large continuum: for every (some)…

Let $Y_0$ be a not very well approximable $m\times n$ matrix, and let $M$ be a connected analytic submanifold in the space of $m\times n$ matrices containing $Y_0$. Then almost all $Y\in M$ are not very well approximable. This and other…

In this paper we show the existence of approximate completely positive semidefinite (cpsd) factorizations with a cpsd-rank bounded above (almost) independently from the cpsd-rank of the initial matrix. This is particularly relevant since…

We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega$ implies that the modal logic S4.1.2 is complete with respect to the \v{C}ech-Stone compactification of the natural numbers,…