Related papers: Almost associative operations generating a minimal…
A near-group category is an additively semisimple category with a product such that all but one of the simple objects is invertible. We classify braided structures on near-group categories, and give explicit numerical formulas for their…
Terwilliger algebras are a subalgebra of a matrix algebra that are constructed from association schemes over finite sets. In 2010, Rie Tanaka defined what it means for a Terwilliger algebra to be almost commutative. In that paper she gave…
Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…
A good deal of science and technology concepts and methods rely on comparing and relating entities in quantitative terms. Among the several possible approaches, similarity indices allow some interesting features, especially the ability to…
An associative central simple algebra is a form of matrices, because a maximal \'{e}tale subalgebra acts on the algebra faithfully by left and right multiplication. In an attempt to extract and isolate the full potential of this point of…
Totally asymmetric simple exclusion processes, consisting of two coupled parallel lattice chains with particles interacting with hard-core exclusion and moving along the channels and between them, are considered. In the limit of strong…
Let $G$ be an additive group of order $v$. A $k$-element subset $D$ of $G$ is called a $(v, k, \lambda, t)$-almost difference set if the expressions $gh^{-1}$, for $g$ and $h$ in $D$, represent $t$ of the non-identity elements in $G$…
The purpose of this paper is twofold. First, basic concepts such as Gamma function, almost convergence, fractional order difference operator and sequence spaces are given as a survey character. Thus, the current knowledge about those…
We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…
Approximate Bayesian computation (ABC) is a widely used inference method in Bayesian statistics to bypass the point-wise computation of the likelihood. In this paper we develop theoretical bounds for the distance between the statistics used…
Proximity measures on graphs have a variety of applications in network analysis, including community detection. Previously they have been mainly studied in the context of networks without attributes. If node attributes are taken into…
We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities. These are arrived at by casting Bayesian networks as noisy AND-OR-NOT networks, and viewing the subnetworks that lead to a node…
We show that varietal techniques based on the existence of operations of a certain arity can be extended to n-permutable categories with binary coproducts. This is achieved via what we call approximate Hagemann-Mitschke co-operations, a…
A pairing function for the non-negative integers is said to be binary perfect if the binary representation of the output is of length 2k or less whenever each input has length k or less. Pairing functions with square shells, such as the…
This paper considers networks where relationships between nodes are represented by directed dissimilarities. The goal is to study methods for the determination of hierarchical clusters, i.e., a family of nested partitions indexed by a…
Action operads and cloning systems are, respectively, the main ingredients in two approaches for axiomatically constructing Thompson-like groups due to Thumann and Witzel-Zaremsky. In this paper, we prove that action operads are equivalent…
We study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show…
As an extension of positive or almost positive diagrams and links, we introduce a notion of successively almost positive diagrams and links, and good successively almost positive diagrams and links. We review various properties of positive…
Advocating for a sustainable, resilient and human-centric industry, the three pillars of Industry 5.0 call for an increased understanding of industrial processes and manufacturing systems, as well as their energy sustainability. One of the…
In correlation clustering, we are given $n$ objects together with a binary similarity score between each pair of them. The goal is to partition the objects into clusters so to minimise the disagreements with the scores. In this work we…