Related papers: Cayley Integers (long version)
An element a in A_n, the Cayley-Dickson algebra is alternative if (a,a,x)=0 for all x. In this paper we characterise such elements for n>3.To do so,we prove first the so called Yui's conjecture:For a and b pure elements in A_n. If (a,x,b)=0…
In this paper we model a class of stream and block ciphers as systems of (ordinary) explicit difference equations over a finite field. We call this class "difference ciphers" and we show that ciphers of application interest, as for example…
Macaulay's Inverse System gives an effective method to construct Artinian Gorenstein k-algebras. To date a general structure for Gorenstein k-algebras of any dimension (and codimension) is not understood. In this paper we extend Macaulay's…
This is a short survey on the recent developments made in the integration theory with effective formulas of algebraic structures stronger or higher than Lie algebras.
We introduce the notions of alternating roots of polynomials and alternating polynomials over a Cayley-Dickson algebra, and prove a connection between the alternating roots of a given polynomial and the roots of the corresponding…
In this article we survey recent results on rigid dualizing complexes over commutative algebras. We begin by recalling what are dualizing complexes. Next we define rigid complexes, and explain their functorial properties. Due to the…
We propose a new cryptosystem based on polycyclic groups. The cryptosystem is based on the fact that the word problem can be solved effectively in polycyclic groups, while the known solutions to the conjugacy problem are far less efficient.
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…
This paper concerns the computation and identification of the (homological) Conley index over the integers, in the context of discrete dynamical systems generated by continuous maps. We discuss the significance with respect to nonlinear…
Computer Algebra systems are widely spread because of some of their remarkable features such as their ease of use and performance. Nonetheless, this focus on performance sometimes leads to unwanted consequences: algorithms and computations…
We construct a graded cluster algebra structure on the Cox ring of a smooth complex variety $Z$, depending on a base cluster structure on the ring of regular functions of an open subset $Y$ of $Z$. After considering some elementary examples…
The Cayley-Dickson loop Q_n is the multiplicative closure of basic elements of the algebra constructed by n applications of the Cayley-Dickson doubling process (the first few examples of such algebras are real numbers, complex numbers,…
We give a brief introduction to computational algebraic number theory in OSCAR. Our main focus is on number fields, rings of integers and their invariants. After recalling some classical results and their constructive counterparts, we…
Cryptographic systems are derived using units in group rings. Combinations of types of units in group rings give units not of any particular type. This includes cases of taking powers of units and products of such powers and adds the…
Eulerian polynomials record the distribution of descents over permutations. Caylerian polynomials likewise record the distribution of descents over Cayley permutations, where a Cayley permutation is a word of positive integers such that if…
The article is devoted to the investigation of transformation groups of polynomials over Cayley-Dickson algebras and their manifolds of zeros. The problems about expressibility of zeros with the help of roots and decomposibility of…
In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…
Functions of several octonion variables are investigated and integral representation theorems for them are proved. With the help of them solutions of the ${\tilde {\partial}}$-equations are studied. More generally functions of several…
In this paper, rough approximations of Cayley graphs are studied and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition called pseudo-Cayley graphs containing Cayley graphs is proposed. Rough approximation is…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…