Related papers: Strolling through common meadows
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
A semiring generalises the notion of a ring, replacing the additive abelian group structure with that of a commutative monoid. In this paper, we study a notion positioned between a ring and a semiring -- a semiring whose additive monoid is…
In this paper using the connections between some subvarieties of residuated lattices, we investigated some properties of the lattice of ideals in commutative and unitary rings. We give new characterizations for commutative rings $A$ in…
One of the most studied algebraic structures with one operation is the Abelian group, which is defined as a structure whose operation satisfies the associative and commutative properties, has identical element and every element has an…
The set of periodic distributions, with usual addition and convolution, forms a ring, which is isomorphic, via taking a Fourier series expansion, to the ring ${\mathcal{S}}'({\mathbb{Z}}^d)$ of sequences of at most polynomial growth with…
We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary sequences. On the combinatorial side, we study the rotation lattices on permutrees and their lattice homomorphisms, unifying the weak order,…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
In analogy with flasque sheaves, we introduce the notion of flasque meadow as a common meadow where the transition maps are all surjective. We study some properties of flasque meadows and illustrate them with many examples and…
Information algebras arise from the idea that information comes in pieces which can be aggregated or combined into new pieces, that information refers to questions and that from any piece of information, the part relevant to a given…
We begin by introducing an algebraic structure with three constants and one ternary operation to which we call mobi algebra. This structure has been designed to capture the most relevant properties of the unit interval that are needed in…
In this paper I consider all possible properties from commutative algebra for polynomial composites and monoid domains. The aim is full characterization of these structures. I start with the examination of group, ring, modules properties,…
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
In this article several properties of the inverse along an element will be studied in the context of unitary rings. New characterizations of the existence of this inverse will be proved. Moreover, the set of all invertible elements along a…
We introduce the notion of an ACP process algebra and the notion of a meadow enriched ACP process algebra. The former notion originates from the models of the axiom system ACP. The latter notion is a simple generalization of the former…
Probability maps are additive and normalised maps taking values in the unit interval of a lattice ordered Abelian group. They appear in theory of affine representations and they are also a semantic counterpart of Hajek's probability logic.…
The aim of this note is to describe the structure of finite meadows. We will show that the class of finite meadows is the closure of the class of finite fields under finite products. As a corollary, we obtain a unique representation of…
The Fundamental Theorem of Algebra can be thought of as a statement about the real numbers as a space, considered as an algebraic set over the real numbers as a field. This paper introduces what it means for an algebraic set or affine…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…