Related papers: Digital semigroups
We give extensions of results on nonnegative matrix semigroups which deduce finiteness or boundedness of such semigroups from the corresponding local properties, e.g., from finiteness or boundedness of values of certain linear functionals…
Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
There has been always an ambiguity in division when zero is present in the denominator. So far this ambiguity has been neglected by assuming that division by zero as a non-allowed operation. In this paper, I have derived the new set of…
Similarly to Parry's characterization of $\beta$-expansions of real numbers in real bases $\beta > 1$, Ito and Sadahiro characterized digital expansions in negative bases, by the expansions of the endpoints of the fundamental interval.…
We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…
In this note, we introduce a new concept of a {\it generalized algebraic rational identity} to investigate the structure of division rings. The main theorem asserts that if a non-central subnormal subgroup $N$ of the multiplicative group…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.
In DOI:10.1017/etds.2022.2 the author proved that for each integer $k$ there is an implicit number $M > 0$ such that if $b_1, \cdots , b_k$ are multiplicatively independent integers greater than $M$, there are infinitely many integers whose…
A subset $S$ of an integral domain $R$ is called a semidomain if the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities; additionally, we say that $S$ is additively reduced provided that $S$ contains no additive inverses. Given…
We describe and count the maximal subsemigroups of many well-known monoids of transformations and monoids of partitions. More precisely, we find the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving…
We develop a general axiomatic theory of algebraic pairs, which simultaneously generalizes several algebraic structures, in order to bypass negation as much as feasible. We investigate several classical theorems and notions in this setting…
In this work we construct an extension for the category of 0-modules by analogy with [H.-J. Baues and G. Wirshing, Cohomology of small categories, J. Pure Appl. Algebra, 38(1985), 187-211]. The 0-cohomology functor becomes a derived functor…
We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are "symmetric" while the outputs are drawn from a…
We develop layered monoidal theories -- a generalisation of monoidal theories combining formal descriptions of a system at different levels of abstraction. Via their representation as string diagrams, monoidal theories provide a graphical…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
Cosetal extensions of monoids generalise extensions of groups, special Schreier extensions of monoids and Leech's normal extensions of groups by monoids. They share a number of properties with group extensions, including a notion of Baer…
The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…