Related papers: The Relation between Composability and Splittabili…

We show that a plane continuum X is indecomposable iff X has a sequence (U_n) of not necessarily distinct complementary domains satisfying what we call the double-pass condition: If one draws an open arc A_n in each U_n whose ends limit…

We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two…

A group is said to be cube-free if its order is not divisible by the cube of any prime. Let $f_{cf,sol}(n)$ denote the isomorphism classes of solvable cube-free groups of order $n$. We find asymptotic bounds for $f_{cf,sol}(n)$ in this…

Assuming $\mathfrak b = \mathfrak c$ (or some weaker statement), we construct a compactification $\gamma\omega$ of $\omega$ such that its remainder $\gamma\omega\setminus\omega$ is nonseparable and carries a strictly positive measure.

A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that…

A graph $G$ is said to be $2$-divisible if for all (nonempty) induced subgraphs $H$ of $G$, $V(H)$ can be partitioned into two sets $A,B$ such that $\omega(A) < \omega(H)$ and $\omega(B) < \omega(H)$. A graph $G$ is said to be perfectly…

The conditions under which a general two-dimensional non-linear sigma model is classically integrable are given. These requirements are found by demanding that the equations of motion of the theory are expressible as a zero curvature…

Suppose that $\mathcal{C}$ is a root class of groups (i.e., a class of groups that contains non-trivial groups and is closed under taking subgroups and unrestricted wreath products), $G$ is the free product of residually…

Diestel, et al. (see Order 35 (2017), JCT-A 167 (2019), arXiv:1805.01439) introduced the notion of abstract separation systems that satisfy a submodularity property, and they call this structural submodularity. Williamson, Goemans, Mihail,…

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

A graph $G$ is perfectly divisible if every induced subgraph $H$ of $G$ contains a set $X$ of vertices such that $X$ meets all largest cliques of $H$, and $X$ induces a perfect graph. The chromatic number of a perfectly divisible graph $G$…

We describe $\sigma$-matching, interchangeable and, as a consequence, totally compatible products on some classes of associative algebras, including unital algebras, the semigroup algebras of rectangular bands, algebras with enough…

This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is…

Many logical properties are known to be undecidable for normal modal logics, with few exceptions such as consistency and coincidence with $\mathsf{K}$. This paper shows that the property of being a union-splitting in…

The necessary and sufficient condition of separability of a mixed state of any systems is presented, which is practical in judging the separability of a mixed state. This paper also presents a method of finding the disentangled…

We study the notion of irreducibility of semigroup morphisms. Given an alphabet $\Sigma$, a morphism $\varphi:\Sigma^+\rightarrow\Sigma^+$ is irreducible if any factorisation $\varphi=\psi_2\circ\psi_1$ can only be satisfied if $\psi_1$ or…

We derive a necessary and sufficient condition for the separability of tripartite three mode Gaussian states, that is easy to check for any such state. We give a classification of the separability properties of those systems and show how to…

Given a class C of word languages, the C-separation problem asks for an algorithm that, given as input two regular languages, decides whether there exists a third language in C containing the first language, while being disjoint from the…

Assume $ k $ is a positive integer, $ \lambda=\{k_1,k_2,...,k_q\} $ is a partition of $ k $ and $ G $ is a graph. A $\lambda$-assignment of $ G $ is a $ k $-assignment $ L $ of $ G $ such that the colour set $ \bigcup_{v\in V(G)} L(v) $ can…

Two permutations $s$ and $t$ are $k$-similar if they can be decomposed into subpermutations $s^1, \ldots, s^k$ and $t^1, \ldots, t^k$ such that $s^i$ is order-isomorphic to $t^i$ for all $i$. Recently, Dudek, Grytczuk and Ruci\'nski posed…