Related papers: Associativity conditions for linear quasigroups an…

Non-Abelian strings are considered in {\em non}-supersymmetric theories with fermions in various appropriate representations of the gauge group U($N$). We derive the electric charge quantization conditions and the index theorems counting…

Motivated by M-theory, we define a new type of non-associative algebra involving usual and cubic matrices at the same time. The resulting algebra can be regarded as a two-term truncated $L_\infty$ algebra giving rise to a fundamental…

We describe $\sigma$-matching, interchangeable and, as a consequence, totally compatible products on some classes of associative algebras, including unital algebras, the semigroup algebras of rectangular bands, algebras with enough…

We classify, up to isomorphism, the group gradings on the non-exceptional classical simple Lie superalgebras, except for type A(1,1), over an algebraically closed field of characteristic zero. To this end, we study graded-simple and…

With this paper, we gain a better understanding of the set of near-field structures on a fixed scalar group. If we were able to describe all near-field structures on a fixed scalar group, we could describe all near-vector spaces. The…

We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…

We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…

Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from genetic data. Here equivariant refers to a symmetry group imposed on the root distribution and on the transition matrices in the model. We…

Ensemble of regression trees have become popular statistical tools for the estimation of conditional mean given a set of predictors. However, quantile regression trees and their ensembles have not yet garnered much attention despite the…

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementation. The algorithms can be viewed as generating a set…

Given two elements $x,y$ of a semigroup $X$ we write $x\lesssim y$ if for every homomorphism $\chi:X\to\{0,1\}$ we have $\chi(x)\le\chi(y)$. The quasiorder $\lesssim$ is called the $binary$ $quasiorder$ on $X$. It induces the equivalence…

In general terms, we establish algebraic relations that numbers must satisfy in order for their images to match after one or several transformations. Some groups associated with these relationships are identified, such as the Klein group.…

For any integer $n$, we classify all trees whose $n$-path ideals have linear quotients.

The dual Lie bialgebra of a certain ``quasitriangular'' Lie bialgebra structure on the Heisenberg Lie algebra determines a (non-compact) Poisson--Lie group G. The compatible Poisson bracket on G is non-linear, but it can still be realized…

We exhibit the joint symmetric distribution of the following two parameters on the set of unlabeled, simple, connected graphs with $n$ vertices. The first parameter is the maximal number of leaves attached to a vertex. The second parameter…

We introduce the concept of a semigroup coupled cell network and show that the collection of semigroup network vector fields forms a Lie algebra. This implies that near a dynamical equilibrium the local normal form of a semigroup network is…

In this paper, we study combinatorial properties of quasi-Cartan companions defined by the c-vectors of acyclic skew-symmetrizable cluster algebras. In particular, we show that the diagram of any skew-symmetrizable matrix associated with an…

Classification of datasets into two or more distinct classes is an important machine learning task. Many methods are able to classify binary classification tasks with a very high accuracy on test data, but cannot provide any easily…

For an associative algebra $A$ a skew-symmetric sum of $n!$ products of $n$ elements of $A$ in all possible order is called $n$-commutator. We consider $A$ as $n$-ary algebra under $n$-commutator. We prove that it has an identity of…