Related papers: Constraint satisfaction problems, compactness and …

The omega limit sets plays a fundamental role to construct global attractors for topological semi-dynamical systems with continuous time or discrete time. Therefore, it is important to know when omega limit sets become nonempty compact…

In this paper we examine two basic topological properties of partial metric spaces, namely compactness and completeness. Our main result claims that in these spaces compactness is equivalent to sequential compactness. We also show that…

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…

It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph. We present a variant of this construction and show that…

We introduce the coherent algebra of a compact metric measure space by analogy with the corresponding concept for a finite graph. As an application we show that upon topologizing the collection of isomorphism classes of compact metric…

For a pair of finite relational structures $(\mathfrak{A},\mathfrak{B})$ such that $\mathfrak{A}$ homomorphically maps to $\mathfrak{B}$ we denote by $K_{(\mathfrak{A},\mathfrak{B})}$ the following statement: for all structures…

We provide examples of nonseparable compact spaces with the property that any continuous image which is homeomorphic to a finite product of spaces has a maximal prescribed number of nonseparable factors.

Within the framework of Zermelo-Fraenkel set theory without the Axiom of Choice, we establish equivalents to the assertion "the union of a countable collection of finite sets is countable" in the context of metric spaces, probability…

For infinite products of compact spaces, Tychonoff's theorem asserts that their product is compact, in the product topology. Tychonoff's theorem is shown to be equivalent to the axiom of choice. In this paper, we show that any countable…

We prove that the automorphism group of a topological parallelism on real projective 3-space is compact. In a preceding article it was proved that at least the connected component of the identity is compact. The present proof does not…

A set $A$ in a finite dimensional Euclidean space is \emph{monovex} if for every two points $x,y \in A$ there is a continuous path within the set that connects $x$ and $y$ and is monotone (nonincreasing or nondecreasing) in each coordinate.…

A relational structure is indivisible if for every partition of its set of elements into two parts there exists an embedding of the structure into one of the parts of the partition. A relational structure is homogeneous if every embedding…

We characterize the finite dimensional asymmetric normed spaces which are right bounded and the relation of this property with the natural compactness properties of the unit ball, as compactness and strong compactness. In contrast with some…

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

We generalize a recent result by J.F. Carlson to finite tensor categories having finitely generated cohomology. Specifically, we show that if the Krull dimension of the cohomology ring is sufficiently large, then there exist infinitely many…

For $n\geq 3$, let $(H_n, E)$ denote the $n$-th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed the complete graph on $n$ vertices. We show that for all…

The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

The Constraint Satisfaction Problem (CSP) and its counting counterpart appears under different guises in many areas of mathematics, computer science, and elsewhere. Its structural and algorithmic properties have demonstrated to play a…