Related papers: Tokens: An Algebraic Construction Common in Combin…
An algebraic structure with two constants and one ternary operation, which is not completely commutative, is put forward to accommodate ternary Boolean algebras. When the ternary operation is interpreted as Church's conditioned disjunction,…
Monads can be interpreted as encoding formal expressions, or formal operations in the sense of universal algebra. We give a construction which formalizes the idea of "evaluating an expression partially": for example, "2+3" can be obtained…
Much like in the theory of algebraic geometry, we develop a correspondence between certain types of algebraic and geometric objects. The basic algebraic environment we work in is the a semifield of fractions H(x1,...,xn) of the polynomial…
We introduce a concept called a collective: an interface with a protocol for aggregating contributions and distributing returns. Through such a protocol, many members may participate in a mutual endeavor. We present a variety of real-world…
Group convolutions and cross-correlations, which are equivariant to the actions of group elements, are commonly used in mathematics to analyze or take advantage of symmetries inherent in a given problem setting. Here, we provide efficient…
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…
In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…
The algebra of so-called shifted symmetric functions on partitions has the property that for all elements a certain generating series, called the $q$-bracket, is a quasimodular form. More generally, if a graded algebra $A$ of functions on…
We introduce the notion of numerical semigroups generated by concatenation of arithmetic sequences and show that this class of numerical semigroups exhibit multiple interesting behaviours.
Tensors or {\em multi-way arrays} are functions of three or more indices $(i,j,k,\cdots)$ -- similar to matrices (two-way arrays), which are functions of two indices $(r,c)$ for (row,column). Tensors have a rich history, stretching over…
Although algebraic structures are frequently analyzed using unary and binary operations, they can also be effectively defined and unified through ternary operations. In this context, we introduce structures that contain two constants and a…
Our research builds upon Halmos's foundational work on functional monadic Boolean algebras and our previous work on tense operators to develop three essential constructions, including the important concepts of fuzzy sets and powerset…
The sets used to construct other mathematical objects are pure sets, which means that all of their elements are sets, which are themselves pure. One set may therefore be within another, not as an element, but as an element of an element, or…
Though algebraic geometry over $\mathbb C$ is often used to describe the closure of the tensors of a given size and complex rank, this variety includes tensors of both smaller and larger rank. Here we focus on the $n\times n\times n$…
We are interested in formulas for the number of elements in certain classes of numerical semigroups
Utilizing transformer architectures for semantic segmentation of high-resolution images is hindered by the attention's quadratic computational complexity in the number of tokens. A solution to this challenge involves decreasing the number…
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…
We use the Poisson kernel of the continuous $q$-Hermite polynomials to introduces families of integral operators, which are semigroups of linear operators. We describe the eigenvalues and eigenfunctions of one family of operators. The…
Let X be an affine real algebraic set . We investigate on the theory of algebraically constructible functions on X and the description of the semi-algebraic subsets of X when we replace the polynomial functions on X by some rational…
Due to the increased complexity of software development projects more and more systems are described by models. The sheer size makes it impractical to describe these systems by a single model. Instead many models are developed that provide…