Related papers: Advancing Computational Tools for Analyzing Commut…
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
This paper is concerned with the construction of a small, but non-trivial, example of a polynomial identity algebra, which we call the \emph{Jackson algebra}, that will be used in sequels to this paper to study non-commutative arithmetic…
Hypercomplex algebras have recently been gaining prominence in the field of deep learning owing to the advantages of their division algebras over real vector spaces and their superior results when dealing with multidimensional signals in…
This document presents the solutions to the exercises in the book "Albert algebras over commutative rings" published by Cambridge University Press, 2024, as well as errata and addenda. The addenda include proofs, in the style of the book,…
Cylindrical algebraic decompositions (CADs) are a key tool in real algebraic geometry, used primarily for eliminating quantifiers over the reals and studying semi-algebraic sets. In this paper we introduce cylindrical algebraic…
We define a formal framework for the study of algebras of type Max-plus, Min-Plus, tropical algebras, and more generally algebras over a commutative idempotent semi-field. This work is motivated by the increasingly diversified use of these…
We define algebras of quasi-quaternion type, which are symmetric algebras of tame representation type whose stable module category has certain structure similar to that of the algebras of quaternion type introduced by Erdmann. We observe…
OpenTensor is a reproduction of AlphaTensor, which discovered a new algorithm that outperforms the state-of-the-art methods for matrix multiplication by Deep Reinforcement Learning (DRL). While AlphaTensor provides a promising framework for…
S. Baker (2019), B. B\'ar\'any and A. K\"{a}enm\"{a}ki (2019) independently showed that there exist iterated function systems without exact overlaps and there are super-exponentially close cylinders at all small levels. We adapt the method…
A commutative order in a quaternion algebra is called selective if it is embeds into some, but not all, the maximal orders in the algebra. It is known that a given quadratic order over a number field can be selective in at most one…
This paper aims to establish a framework for extreme learning machines (ELMs) on general hypercomplex algebras. Hypercomplex neural networks are machine learning models that feature higher-dimension numbers as parameters, inputs, and…
We relate commutative algebras in braided tensor categories to braid-reversed tensor equivalences, motivated by vertex algebra representation theory. First, for $\mathcal{C}$ a braided tensor category, we give a detailed construction of the…
Let $L$ be a separable quadratic extension of either $\mathbb{Q}$ or $\mathbb{F}_q(t)$. We propose efficient algorithms for finding isomorphisms between quaternion algebras over $L$. Our techniques are based on computing maximal one-sided…
We parametrize quartic commutative algebras over any base ring or scheme (equivalently finite, flat degree four $S$-schemes), with their cubic resolvents, by pairs of ternary quadratic forms over the base. This generalizes Bhargava's…
In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…
The class of non-commutative hypercomplex number systems (HNS) of 4-dimension, constructed by using of non-commutative Grassmann-Clifford procedure of doubling of 2-dimensional systems is investigated in the article and established here are…
Many conforming finite elements on squares and cubes are elegantly classified into families by the language of finite element exterior calculus and presented in the Periodic Table of the Finite Elements. Use of these elements varies, based…
We explore new approaches for finding matrix multiplication algorithms in the commutative setting by adapting the flip graph technique: a method previously shown to be effective for discovering fast algorithms in the non-commutative case.…
We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the…
We assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…