Related papers: A Note On Square-free Sequences and Anti-unificati…
The representation theorem for odd or even involutive FLe-chains by bunches of layer groups, as discussed in [10], is redefined to demonstrate a more straightforward constructional relationship between odd or even involutive FLe-chains and…
A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…
Last years a number of papers were devoted to describing automorphisms of semigroups of endomorphisms of free finitely generated universal algebras of some varieties: groups, semigroups, associative commutative algebras, inverse semigroups,…
A cuf space (set, resp.) is a space (set, resp.) which is a countable union of finite subspaces (subsets, resp.). It is proved in $\mathbf{ZF}$ (with the absence of the axiom of choice) that all countable unions of cuf (denumerable, resp.)…
Given partial information about a set, we are interested in fully recovering the original set from what is given. If a set encodes itself robustly, any partial information about the set suffices to fully recover the information about the…
Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…
An anti-associative algebra is a nonassociative algebra whose multiplication satisfies the identity a(bc)+(ab)c=0. Such algebras are nilpotent. We describe the free anti-associative algebras with a finite number of generators. Other types…
Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which…
We introduce semiframes (an algebraic structure) and investigate their duality with semitopologies (a topological one). Both semitopologies and semiframes are relatively recent developments, arising from a novel application of topological…
Let $G$ be a finite group and $f:G \to {\mathbb C}$ be a function. For a non-empty finite subset $Y\subset G$, let $I_Y(f)$ denote the average of $f$ over $Y$. Then, $I_G(f)$ is the average of $f$ over $G$. Using the decomposition of $f$…
Symbolic (or Literal) Neutrosophic Theory is referring to the use of abstract symbols (i.e. the letters T, I, F, or their refined indexed letters Tj, Ik, Fl) in neutrosophics. We extend the dialectical triad thesis-antithesis-synthesis to…
We study the structure of nilpotent subsemigroups in the semigroup $M(n,\mathbb{F})$ of all $n\times n$ matrices over a field, $\mathbb{F}$, with respect to the operation of the usual matrix multiplication. We describe the maximal…
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…
We have shown recently that, given a metric space $X$, the coarse equivalence classes of metrics on the two copies of $X$ form an inverse semigroup $M(X)$. Here we study the property of idempotents in $M(X)$ of being finite or infinite,…
We characterize and construct linearly ordered sets, abelian groups and fields that are {\emph symmetrically complete}, meaning that the intersection over any chain of closed bounded intervals is nonempty. Such ordered abelian groups and…
We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite…
We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…
Symmetric functions, which take as input an unordered, fixed-size set, are known to be universally representable by neural networks that enforce permutation invariance. These architectures only give guarantees for fixed input sizes, yet in…