Results 51 to 60 of about 1,397 (124)

Density of maximal nonassociativity in quadratic nearfields

open access: yesJournal of Computational Algebra
A quasigroup (Q,⋅) is called maximally nonassociative if for all (x,y,z)∈Q3, the equality (x⋅y)⋅z=x⋅(y⋅z) implies that x=y=z. We follow up on the 2020 article “Maximal nonassociativity via nearfields” by Drápal and Lisoněk, in which the authors first ...
Martina Lehká
doaj   +1 more source

How Nonassociative Geometry Describes a Discrete Spacetime

open access: yesFrontiers in Physics, 2019
Nonassociative geometry, providing a unified description of discrete and continuum spaces, is a valuable candidate for the study of discrete models of spacetime. Within the framework of nonassociative geometry we propose a model of emergent spacetime. In
Alexander I. Nesterov, Héctor Mata
doaj   +1 more source

Pseudococyclic Partial Hadamard Matrices over Latin Rectangles

open access: yesMathematics, 2021
The classical design of cocyclic Hadamard matrices has recently been generalized by means of both the notions of the cocycle of Hadamard matrices over Latin rectangles and the pseudococycle of Hadamard matrices over quasigroups.
Raúl M. Falcón   +4 more
doaj   +1 more source

Linking Bipartiteness and Inversion in Algebra via Graph‐Theoretic Methods and Simulink

open access: yesComplexity, Volume 2025, Issue 1, 2025.
Research for decades has concentrated on graphs of algebraic structures, which integrate algebra and combinatorics in an innovative way. The goal of this study is to characterize specific aspects of bipartite and inverse graphs that are associated with specific algebraic structures, such as weak inverse property quasigroups and their isotopes ...
Mohammad Mazyad Hazzazi   +6 more
wiley   +1 more source

Leveraging Nonassociative Algebra for Spectral Analysis of Anomalies in IoT

open access: yesJournal of Applied Mathematics, Volume 2025, Issue 1, 2025.
The constantly changing characteristics of distributed networks and Internet of Things and additionally their susceptibility to anomalies render maintaining security and resilience complicated. This research provides a spectral‐based anomaly detection framework connected with nonassociative algebra, inverse property quasigroup.
Faizah D. Alanazi, Chong Lin
wiley   +1 more source

Smarandache mukti-squares [PDF]

open access: yes, 2007
We have introduced Smarandache quasigroups which are Smarandache non-associative structures. A quasigroup is a groupoid whose composition table is a Latin square.
Muktibodh, Arun S.
core   +1 more source

An encryption algorithm using a generalization of the Markovski algorithm and T-quasigroups

open access: yesActa et Commentationes: Ştiinţe Exacte şi ale Naturii
Here is a more detailed description of the algorithm proposed in [1]. This algorithm simultaneously uses two cryptographic procedures: encryption using a generalization of the Markovski algorithm [2] and encryption using a system of orthogonal ...
Nadezhda Malyutina, Victor Shcherbacov
doaj   +1 more source

Newton da Costa and the school of Curitiba

open access: yesManuscrito, 2011
This paper intends to report on the beginning of the publications of Newton da Costa outside Brazil. Two mathematicians played an important role in this beginning: Marcel Guillaume from the University of Clermont-Ferrand and Paul Dedecker from the ...
Artibano Micali
doaj   +1 more source

Inverse Spectrum and Structure of Topological Metagroups

open access: yesMathematics
In this article, a structure of topological metagroups is scrutinized. Their inverse spectra are studied. This also permits us to construct abundant families of topological metagroups and quasigroups.
Sergey Victor Ludkowski
doaj   +1 more source

Row‐Hamiltonian Latin squares and Falconer varieties

open access: yesProceedings of the London Mathematical Society, Volume 128, Issue 1, January 2024.
Abstract A Latin square is a matrix of symbols such that each symbol occurs exactly once in each row and column. A Latin square L$L$ is row‐Hamiltonian if the permutation induced by each pair of distinct rows of L$L$ is a full cycle permutation. Row‐Hamiltonian Latin squares are equivalent to perfect 1‐factorisations of complete bipartite graphs.
Jack Allsop, Ian M. Wanless
wiley   +1 more source

Home - About - Disclaimer - Privacy