Related papers: On semi-open codes and bi-continuing almost everyw…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
We examine conditions on a (compact metrizable) space $X$ such that for any space $Y$ and closed subspace $Z$, the set of continuous functions from $Z$ to $X$ which extend to $Y$ is either open or closed in the set of continuous functions…
We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges…
This paper introduces semiopen and semiclosed soft sets in soft topological spaces. The notions of interior and closure are generalized using these sets. A detail study is carried out on properties of semiopen, semiclosed soft sets, semi…
We observe that under certain conditions on the Lyapunov exponents a semi-invertible cocycle is, indeed, invertible. As a consequence, if a semi-invertible cocycle generated by a H\"{o}lder continuous map $A:M\to M(d, \mathbb{R})$ over a…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
A random field $X = (X_v)_{v \in G}$ on a quasi-transitive graph $G$ is a factor of i.i.d. if it can be written as $X=\varphi(Y)$ for some i.i.d. process $Y= (Y_v)_{v \in G}$ and equivariant map $\varphi$. Such a map, also called a coding,…
The behavior of factorization properties in various ring extensions is a central theme in commutative algebra. Classically, the UFDs are (completely) integrally closed and tend to behave well in standard ring extensions, with the notable…
It has been an open problem to identify classes of Gibbs measures less regular then H\"older continuous on the full shift which are closed under factor maps. In this article we show that in fact all of the classical uniqueness regimes…
In this work we study permutation synchronisation for the challenging case of partial permutations, which plays an important role for the problem of matching multiple objects (e.g. images or shapes). The term synchronisation refers to the…
Let $X$ be an ordered vector space. The net $\{x_\alpha\}\subseteq X$ is semi unbounded order convergent to $x$ (in symbol $x_\alpha\xrightarrow{suo}x$), if there is a net $\{y_\beta\}$, possibly over a different index set, such that…
In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…
We show that every $2$-connected cubic graph $G$ has a cycle double cover if $G$ has a spanning subgraph $F$ such that (i) every component of $F$ has an even number of vertices (ii) every component of $F$ is either a cycle or a subdivision…
The question if a deterministic finite automaton admits a software reset in the form of a so-called synchronizing word can be answered in polynomial time. In this paper, we extend this algorithmic question to deterministic automata beyond…
We consider proper holomorphic mappings of equidimensional pseudoconvex domains in complex Euclidean space, where both source and target can be represented as Cartesian products of smoothly bounded domains. It is shown that such mappings…
In this letter we proved this theorem: \emph{if $F$ be a holomorphic mapping of $T_{\Omega}$ to a mapping manifold $X$ such that for every compact subset $K\subset \Omega$ the mapping $F$ is uniformly continues on $T_{K}$ and $F(T_{K})$ is…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
Let $X$ and $Y$ be topological spaces, let $Z$ be a metric space, and let $f: X\times Y\to Z$ be a mapping. It is shown that when $Y$ has a countable base $\mathcal B$, then under a rather general condition on the set-valued mappings $X\ni…
A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…
Classical results for exchangeable systems of random variables are extended to multi-class systems satisfying a natural partial exchangeability assumption. It is proved that the conditional law of a finite multi-class system, given the…