Related papers: A new Boolean matrix representation for Catalan se…

We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean $n\times n$-matrices and apply the characterization to computational complexity of identity checking, finite axiomatizability…

We extend the notion of matroid representations by matrices over fields and consider new representations of matroids by matrices over finite semirings, more precisely over the boolean and the superboolean semirings. This idea of…

We show that the following semirings satisfy the same identities: the semiring $\mathcal{R}_n$ of all reflexive binary relations on a set with $n$ elements, the semiring $\mathcal{U}_n$ of all $n\times n$ upper triangular matrices over the…

Let $[n]=\{1,\ldots,n\}$ be the $n$-chain. We give presentations for the following transformation semigroups: the semigroup of full order-decreasing mappings of $[n]$, the semigroup of partial one-to-one order-decreasing mappings of $[n]$,…

Here we characterize the linear operators that preserve rank of matrices over additively idempotent and multiplicatively cancellative semirings. The main results in this article generalize the corresponding results on the two element…

This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional…

We continue the investigation of Boolean-like algebras of dimension n (nBA) having n constants e1,...,en, and an (n+1)-ary operation q (a "generalised if-then-else") that induces a decomposition of the algebra into n factors through the…

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

The new class of integrable mappings and chains is introduced. Corresponding (1+2) integrable systems invariant with respect to such discrete transformations are represented in explicit form. Soliton like solutions of them are represented…

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

In this paper we characterize those linear bijective maps on the monoid of all $n \times n$ square matrices over an anti-negative semifield which preserve and strongly preserve each of Green's equivalence relations $\mathcal{L},…

Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…

We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to…

In this paper we study the representation theory of three monoids of partial functions on an $n$-set. The monoid of all order-preserving functions (i.e., functions satisfying $f(x)\leq f(y)$ if $x\leq y$) the monoid of all order-decreasing…

We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…

The author constructs the moduli of representations whose images generate the subalgebra of upper triangular matrices (up to inner automorphisms) of the full matrix ring for any groups and any monoids.

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

We propose an explicit representation of central $(2k+1)$-nomial coefficients in terms of finite sums over trigonometric constructs. The approach utilizes the diagonalization of circulant boolean matrices and is generalizable to all…

An arbitrary $m\times n$ Boolean matrix $M$ can be decomposed {\em exactly} as $M =U\circ V$, where $U$ (resp. $V$) is an $m\times k$ (resp. $k\times n$) Boolean matrix and $\circ$ denotes the Boolean matrix multiplication operator. We…

We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class. Our algorithms work on a {\em generic} representation that we illustrate on…