Related papers: Generalizations of Laver tables
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
We present some general theorems about operator algebras that are algebras of functions on sets, including theories of local algebras, residually finite dimensional operator algebras and algebras that can be represented as the scalar…
We define nonselfadjoint operator algebras with generators $L_{e_1},..., L_{e_n}, L_{f_1},...,L_{f_m}$ subject to the unitary commutation relations of the form \[ L_{e_i}L_{f_j} = \sum_{k,l} u_{i,j,k,l} L_{f_l}L_{e_k}\] where $u=…
By considering generalized logarithm and exponential functions used in nonextensive statistics, the four usual algebraic operators : addition, subtraction, product and division, are generalized. The properties of the generalized operators…
We consider algebras with one binary operation $\cdot$ and one generator ({\it monogenic}) and satisfying the left distributive law $a\cdot (b\cdot c)=(a\cdot b)\cdot (a\cdot c)$. One can define a sequence of finite left-distributive…
We introduce tabular algebras, which are simultaneous generalizations of cellular algebras (in the sense of Graham-Lehrer) and table algebras (in the sense of Arad-Blau). We show that if a tabular algebra is equipped with a certain kind of…
Conjunctive table algebras are introduced and axiomatically characterized. A conjunctive table algebra is a variant of SPJR algebra (a weaker form of relational algebra), which corresponds to conjunctive queries with equality. The table…
On the one hand the algebras of linear operators here act on finite-dimensional vector spaces, and on the other hand the point of view is generally an analysts'. Also, one might think of algebras as being used to add more data to basic…
Data processing systems roughly group into families such as relational, array, graph, and key-value. Many data processing tasks exceed the capabilities of any one family, require data stored across families, or run faster when partitioned…
Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite product theories) or using monads, and the category of Lawvere theories is equivalent to the category of finitary monads on Set. We show how…
In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. We define a notion of diagonalization of square matrices whose coefficients are intervals. But in this case, with…
In this paper we generalize cellular algebras by allowing different partial orderings relative to fixed idempotents. For these relative cellular algebras we classify and construct simple modules, and we obtain other characterizations in…
A topological description of various generalized function algebras over corresponding basic locally convex algebras is given. The framework consists of algebras of sequences with appropriate ultra(pseudo)metrics defined by sequences of…
In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…
Enriched Lawvere theories are a generalization of Lawvere theories that allow us to describe the operational semantics of formal systems. For example, a graph enriched Lawvere theory describes structures that have a graph of operations of…
The set-theoretic large cardinal axiom known as I3 posits the existence of a non-trivial rank-to-rank embedding from an initial segment of the universe of sets into itself. Laver showed that the algebra generated by a single such embedding…
The so called generalized down-up algebras are revisited from a viewpoint of Gr\"obner basis theory. Particularly it is shown explicitly that generalized down-up algebras are solvable polynomial algebras (provided $\lambda\omega\ne 0$), and…
We define a generalized form of $L_\infty$-algebras called $E_2L_\infty$-algebras. As we show, these provide the natural algebraic framework for generalized geometry and the symmetries of double field theory as well as the gauge algebras…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…