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

In this paper, we discuss the fixed point property for an infinite family of order-preserving mappings which satisfy the Lipschitzian condition on comparable pairs. The underlying framework of our main results is a metric space of any…

Motivated by the pervasiveness of strong inapproximability results for Max-CSPs, we introduce a relaxed notion of an approximate solution of a Max-CSP. In this relaxed version, loosely speaking, the algorithm is allowed to replace the…

This is an exposition of homotopical results on the geometric realization of semi-simplicial spaces. We then use these to derive basic foundational results about classifying spaces of topological categories, possibly without units. The…

Several distinct techniques have been proposed to design quasi-polynomial algorithms for solving parity games since the breakthrough result of Calude, Jain, Khoussainov, Li, and Stephan (2017): play summaries, progress measures and register…

A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most {\xi} times. The family of {\xi}-nearly planar graphs is widely extending the notion of planarity. We introduce an alternative…

We present a new distributed model of probabilistically checkable proofs (PCP). A satisfying assignment $x \in \{0,1\}^n$ to a CNF formula $\varphi$ is shared between two parties, where Alice knows $x_1, \dots, x_{n/2}$, Bob knows…

For a finite dimensional algebra $\Lambda$, we consider a torsion class $G$ in $mod$-$\Lambda$, which is not necessarily finitely generated. We construct a wall-and-chamber structure for $G$ where the chambers are the connected components…

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their…

In this paper, we study the parallelism between perfect numbers and Leinster groups and continue it by introducing the new concepts of almost and quasi Leinster groups which parallel almost and quasi perfect numbers. These are small…

Locally symmetric spaces like $SL(n,\mathbb Z)\backslash SL_n(\mathbb R)/SO(n)$ contain immersed compact flat manifolds of dimension equal to the real rank. We give a lower bound for the contribution of these cycles to the homology of…

We consider some distinguished classes of elements of a multiplicative lattice endowed with coarse lower topologies, and call them lower spaces. The primary objective of this paper is to study the topological properties of these lower…

In order to verify Percival's conjecture [J. Phys. B 6,L229 (1973)] we study a planar billiard in its classical and quantum versions. We provide an evaluation of the nearest-neighbor level-spacing distribution for the Cassini oval billiard,…

We show that the analogues of the Hamkins embedding theorems, proved for the countable models of set theory, do not hold when extended to the uncountable realm of $\omega_1$-like models of set theory. Specifically, under the $\diamondsuit$…

In this paper we obtained some direct and inverse theorems of approximation theory for $\psi$-differentiable functions in the metric weighted Orlicz spaces with weights, which belong to the class of Muckenhoupt.

We consider systems of "pinned balls," i.e., balls that have fixed positions and pseudo-velocities. Pseudo-velocities change according to the same rules as those for velocities of totally elastic collisions between moving balls. The times…

We construct a deterministic, Lagrangian many-particle approximation to a class of nonlocal transport PDEs with nonlinear mobility arising in many contexts in biology and social sciences. The approximating particle system is a nonlocal…

An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…

In literature on imprecise probability little attention is paid to the fact that imprecise probabilities are precise on a set of events. We call these sets systems of precision. We show that, under mild assumptions, the system of precision…

In this article, we consider the notion of almost irredundant sets: A subset $\mathcal{X}$ of a C*-algebra $\mathcal{A}$ is called almost irredundant if and only if for every $a\in \mathcal{X}$, the element $a$ does not belong to the…

We formulate and study analytically and computationally two families of piecewise linear degree one circle maps. These families offer the rare advantage of being non-trivial but essentially solvable models for the phenomenon of mode-locking…