Related papers: Ordinal semigroups
These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…
Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…
We prove that the strong polarized relation of $\theta$ above $\omega$ applied simultaneously for every cardinal in the interval $[\aleph_1,\aleph]$ is consistent. We conclude that this positive relation is consistent for every cardinal…
A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…
We investigate the relationship between (countable) transfinite iteration and ordinal arithmetic. The nice connection between finite iteration and addition, multiplication, and exponentiation is lost when passing to the transfinite. In this…
Let $A\subseteq B$ be a ring extension and $\mathcal{G}$ be a set of $A$-submodules of $B$. We introduce a class of closure operations on $\mathcal{G}$ (which we call \emph{multiplicative operations on $(A,B,\mathcal{G})$}) that generalizes…
We describe the associative multilinear polynomial functions over commutative integral domains. This extends Marichal and Mathonet's result on infinite integral domains and provides a new proof of Andres's classification of two-element…
We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a…
We investigate the behavior of extension monads, introduced in the 1990s by the second author, in terms of structure results for infinitely many finitary operations and common constructions in varieties or categories of algebras.…
Let $\mathscr{A}$ be a nonempty set of infinite matrices of linear operators between two topological vector spaces. We show that a sequence is uniformly $\mathscr{A}$-summable if and only if it is $B$-summable for all matrices $B$ of linear…
We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…
Although inverse limits with factor spaces indexed by the positive integers are most commonly studied, Ingram and Mahavier have defined inverse limits with set-valued functions broadly enough for any directed index set to be used. In this…
We have defined and established a theory of cofinite connectedness of a cofinite graph. Many of the properties of connectedness of topological spaces have analogs for cofinite connectedness. We have seen that if $G$ is a cofinite group and…
For a finite group $G$ denote by $\gamma(L(G))$ the genus of the subgroup graph of $G.$ We prove that $\gamma(L(G))$ tends to infinity as either the rank of $G$ or the number of prime divisors of $|G|$ tends to infinity.
Array programming languages allow for concise and generic formulations of numerical algorithms, thereby providing a huge potential for program optimisation such as fusion, parallelisation, etc. One of the restrictions that these languages…
Consider a commutative monoid $(M,+,0)$ and a biadditive binary operation $\mu \colon M \times M \to M$. We will show that under some additional general assumptions, the operation $\mu$ is automatically both associative and commutative. The…
Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…
A holomorphic function f on a simply connected domain {\Omega} is said to possess a universal Taylor series about a point in {\Omega} if the partial sums of that series approximate arbitrary polynomials on arbitrary compacta K outside…
Given the congruence lattice L of a finite algebra A with a Mal'cev term, we look for those sequences of operations on L that are sequences of higher commutator operations of expansions of A. The properties of higher commutators proved so…
We employ the theory of canonical extensions to study residuation algebras whose associated relational structures are functional, i.e., for which the ternary relations associated to the expanded operations admit an interpretation as…