Results 41 to 50 of about 166 (137)

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

Napoleon’s quasigroups

open access: yesMathematica Slovaca, 2011
Abstract Napoleon’s quasigroups are idempotent medial quasigroups satisfying the identity (ab·b)(b·ba) = b. In works by V. Volenec geometric terminology has been introduced in medial quasigroups, enabling proofs of many theorems of plane geometry to be carried out by formal calculations in a quasigroup.
openaire   +3 more sources

Extensions of Steiner Triple Systems

open access: yesJournal of Combinatorial Designs, Volume 33, Issue 3, Page 94-108, March 2025.
ABSTRACT In this article, we study extensions of Steiner triple systems by means of the associated Steiner loops. We recognize that the set of Veblen points of a Steiner triple system corresponds to the center of the Steiner loop. We investigate extensions of Steiner loops, focusing in particular on the case of Schreier extensions, which provide a ...
Giovanni Falcone   +2 more
wiley   +1 more source

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

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

Characters of Finite Quasigroups

open access: yesEuropean Journal of Combinatorics, 1984
In this paper the authors study some of the basics of a character theory for finite non-empty quasigroups, generalizing the traditional ordinary character theory for groups. The authors present the relevant notions from quasigroup theory (the multiplication group, quasigroup conjugacy classes, and the space of class functions) which enable one to apply
Kenneth W. Johnson, Jonathan D. H. Smith
openaire   +2 more sources

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

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

ARH - quasigroups

open access: yesMathematical Communications, 2011
In this paper, the concept of an ARH--quasigroup is introduced and identities valid in that quasigroup are studied. The geometrical concept of an affine--regular heptagon is defined in a general ARH--quasigroup and geometrical representation in the quasigroup $\mathbb{C}(2 \cos \frac{\pi}{7})$ is given.
Volenec, Vladimir   +2 more
openaire   +4 more sources

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

Home - About - Disclaimer - Privacy