Non-associative geometry and discrete structure of spacetime
A new mathematical theory, non-associative geometry, providing a unified algebraic description of continuous and discrete spacetime, is introduced.
A new mathematical theory, non-associative geometry, providing a unified algebraic description of continuous and discrete spacetime, is introduced.
A loop of order possesses at least associative triples. However, no loop of order that achieves this bound seems to be known. If the loop is involutory, then it possesses at least associative triples. Involutory loops with associative triples can be obtained by prolongation of certain maximally nonassociative quasigroups whenever is a prime greater than or equal to or , an odd prime. For orders the minimum number of associative triples is reported for both general and involutory...
We discuss some examples of nonassociative algebras which occur in VOA (vertex operator algebra) theory and finite group theory. Methods of VOA theory and finite group theory provide a lot of nonassociative algebras to study. Ideas from nonassociative algebra theory could be useful to group theorists and VOA theorists.
This is an introductory paper about our recent merge of a noncommutative de Finetti type result with representations of the infinite braid and symmetric group which allows us to derive factorization properties from symmetries. We explain some of the main ideas of this approach and work out a constructive procedure to use in applications. Finally we illustrate the method by applying it to the theory of group characters.
A new formula is established for the asymptotic expansion of a matrix integral with values in a finite-dimensional von Neumann algebra in terms of graphs on surfaces which are orientable or non-orientable.
The question of whether two parabolic elements A, B of SL2(C) are a free basis for the group they generate is considered. Some known results are generalized, using the parameter τ = tr(AB) - 2. If τ = a/b ∈ Q, |τ| < 4, and |a| ≤ 16, then the group is not free. If the subgroup generated by b in Z / aZ has a set of representatives, each of which divides one of b ± 1, then the subgroup of SL2(C) will not be free.
In this paper we prove that random d-regular graphs with d ≥ 3 have traffic congestion of the order O(n logd−13 n) where n is the number of nodes and geodesic routing is used. We also show that these graphs are not asymptotically δ-hyperbolic for any non-negative δ almost surely as n → ∞.
Subdirectly irreducible non-idempotent groupoids satisfying and are studied.