Related papers: Bioperational Multisets in Various Semi-rings
It is well known that for a non pseudocompact space X, the family (X) of all intermediate subrings of C(X) which contain bounded real valued continuous functions contains at least 2c many distinct rings. We show that if in addition X is…
The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial $p \in \mathbb{N}[x]$, and any directed finite bipartite graph can be considered as a polynomial $p\in\mathbb{N}[x,y]$, and vise…
By considering a discrete tape where each cell corresponds to an integer, thus to a possible sum, a pseudo-polynomial solution can be given to subset sum problem, which is an NP-complete problem and a cornerstone application for this study,…
We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine…
Loosely speaking, a semi-frame is a generalized frame for which one of the frame bounds is absent. More precisely, given a total sequence in a Hilbert space, we speak of an upper (resp. lower) semi-frame if only the upper (resp. lower)…
The roots of -1 in the set of biquaternions (quaternions with complex components, or complex numbers with quaternion real and imaginary parts) are studied and it is shown that there is an infinite number of non-trivial complexified…
Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…
We modify the well-known tensor product of modules over a semiring, in order to treat modules over hyperrings, and, more generally, for bimodules (and bimagmas) over monoids. The tensor product of residue hypermodules is functorial. Special…
The rational homology group of the order complex of non-even partitions of a finite set is calculated. A twisted version of the Goresky-MacPherson approach to similar homology calculations is proposed.
We survey theory developed over the past 10 years of semirings which need not be additively cancellative. The main feature is a specified ``null ideal'' $\mcA_0$ of a semiring $\mcA,$ taking the place of a zero element, which permits…
In this paper, we are mainly interested in the two questions "which are the commutative rings on which every finitely presented modules is [Formula: see text]-periodic (respectively, [Formula: see text]-periodic)?". It is proved that these…
An ordered semiring is a commutative semiring equipped with a compatible preorder. Ordered semirings generalise both distributive lattices and commutative rings, and provide a convenient framework to unify certain aspects of lattice theory…
Given an ideal of forms in an algebra (polynomial ring, tensor algebra, exterior algebra, Lie algebra, bigraded polynomial ring), we consider the Hilbert series of the factor ring. We concentrate on the minimal Hilbert series, which is…
We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B_2[g]-set is a set A of integers such that no integer has…
Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…
Biclustering has proved to be a powerful data analysis technique due to its wide success in various application domains. However, the existing literature presents efficient solutions only for enumerating maximal biclusters with constant…
Given a subset of size $k$ of a very large universe a randomized way to find this subset could consist of deleting half of the universe and then searching the remaining part. With a probability of $2^{-k}$ one will succeed. By probability…
We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…