Related papers: Bioperational Multisets in Various Semi-rings

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 consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

This is the central article of a series of three papers on cross product bialgebras. We present a universal theory of bialgebra factorizations (or cross product bialgebras) with cocycles and dual cocycles. We also provide an equivalent…

Work in progress concerning alternative formalizations of arithmetic.

We consider multiple sums and multi-integrals as tau functions of the BKP hierarchy using neutral fermions as the simplest tool for deriving these. The sums are over projective Schur functions $Q_\alpha$ for strict partitions $\alpha$. We…

Sumterms are introduced as syntactic entities, and sumtuples are introduced as semantic entities. Equipped with these concepts a new description is obtained of the notion of a sum as (the name for) a role which can be played by a number.…

It is shown that the category of semi-biproducts in monoids is equivalent to a category of pseudo-actions. A semi-biproduct in monoids is at the same time a generalization of a semi-direct product in groups and a biproduct in commutative…

Biclustering involves the simultaneous clustering of objects and their attributes, thus defining local two-way clustering models. Recently, efficient algorithms were conceived to enumerate all biclusters in real-valued datasets. In this…

Using an extension of the abundancy index to imaginary quadratic rings that are unique factorization domains, we investigate what we call $n$-powerfully $t$-perfect numbers in these rings. This definition serves to extend the concept of…

There are many examples of `binary' partial groups in the literature: sets equipped an identity and a partially-defined binary operation, such that each element admits an inverse. We show that many of these may be regarded as partial groups…

We establish a general result on the existence of partially defined semiconjugacies between rational functions acting on the Riemann sphere. The semiconjugacies are defined on the complements to at most one-dimensional sets. They are…

We give a comprehensive study of the so-called \textit{semi-tripotent rings} obtaining their new and non-trivial characterization as well as a complete description in terms of sums and products of some special elements. Particularly, we…

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…

Two successive generalizations of the usual tensor products are given. One can be constructed for arbitrary binary operations, and not only for semigroups, groups or vector spaces. The second one, still more general, is constructed for…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

This paper studies Young diagrams of symmetric and pseudo-symmetric numerical semigroups and describes new operations on Young diagrams as well as numerical semigroups. These provide new decompositions of symmetric and pseudo-symmetric…

Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…

Semigroups generated by topological operations such as closure, interior or boundary are considered. It is noted that some of these semigroups are in general finite and noncommutative. The problem is formulated whether they are always…

A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…