Results 11 to 20 of about 553,680 (181)

Completing Partial Transversals of Cayley Tables of Abelian Groups [PDF]

The Electronic Journal of Combinatorics, 2021
In 2003 Grüttmüller proved that if $n\geqslant 3$ is odd, then a partial transversal of the Cayley table of $\mathbb{Z}_n$ with length $2$ is completable to a transversal. Additionally, he conjectured that a partial transversal of the Cayley table of $\mathbb{Z}_n$ with length $k$ is completable to a transversal if and only if $n$ is odd and either $n \
Jaromy Kuhl, Donald McGinn, Michael W. Schroeder   +2 more
openaire   +5 more sources

Adapting Logic to Physics: The Quantum-Like Eigenlogic Program [PDF]

Entropy, 2020
Considering links between logic and physics is important because of the fast development of quantum information technologies in our everyday life. This paper discusses a new method in logic inspired from quantum theory using operators, named Eigenlogic ...
Zeno Toffano, François Dubois
doaj   +2 more sources

Terwilliger $\mathbb{F}$-algebras of certain Cayley tables [PDF]

, 2023
Let $\mathbb{F}$ be an arbitrary field. In this paper, we continue studying the Terwilliger algebras of association schemes over $\mathbb{F}$ that were called the Terwilliger $\mathbb{F}$-algebras of association schemes in [8]. We determine the algebraic structures of the Terwilliger $\mathbb{F}$-algebras of the association schemes induced from the ...
Jiang, Yu
openaire   +3 more sources

Terwilliger algebras constructed from Cayley tables of finite Bol loops [PDF]

Journal of Algebraic Combinatorics
We describe the Terwilliger algebras of the four-class Latin-square association schemes arising from Cayley tables of Bol loops. We give some necessary conditions involving Terwilliger algebras for a quasigroup to be a Bol loop.
Curtin, Brian
openaire   +4 more sources

Cosets and Cayley-Sudoku Tables

Mathematics Magazine, 2010
SummaryThe popular Sudoku puzzles are 9 by 9 tables divided into nine 3 by 3 sub-tables or blocks. Digits 1 through 9 appear in some of the entries. Other entries are blank. The goal is to fill the blank entries with digits 1 through 9 in such a way that each digit appears exactly once in each row and in each column and in each block. Cayley tables are
Jennifer Carmichael, Keith Schloeman, Michael B. Ward   +2 more
  +7 more sources

Algebras of Binary Isolating Formulas for Strong Product Theories

Известия Иркутского государственного университета: Серия "Математика", 2023
Algebras of distributions of binary isolating and semi-isolating formulas are objects that are derived for a given theory, and they specify the relations between binary formulas of the theory.
D.Yu. Emelyanov
doaj   +1 more source

Algebras of Binary Isolating Formulas for Tensor Product Theories

Известия Иркутского государственного университета: Серия "Математика", 2022
Algebras of distributions of binary isolating and semi-isolating formulae are derived objects for a given theory and reflect binary formula relations between 1-type realizations.
D.Yu. Emel’yanov
doaj   +1 more source

Algebras of Binary Isolating Formulas for Theories of Root Products of Graphs

Известия Иркутского государственного университета: Серия "Математика", 2021
Algebras of distributions of binary isolating and semi-isolating formulas are derived objects for given theory and reflect binary formula relations between realizations of 1-types.
D.Yu. Emel’yanov
doaj   +1 more source

The Chromatic Number of Finite Group Cayley Tables [PDF]

The Electronic Journal of Combinatorics, 2019
The chromatic number of a latin square $L$, denoted $\chi(L)$, is the minimum number of partial transversals needed to cover all of its cells. It has been conjectured that every latin square satisfies $\chi(L) \leq |L|+2$. If true, this would resolve a longstanding conjecture—commonly attributed to Brualdi—that every latin square has a partial ...
Luis A. Goddyn, Kevin Halasz, Ebadollah S. Mahmoodian   +2 more
openaire   +3 more sources

Cayley automaton semigroups [PDF]

, 2015
Let S be a semigroup, C(S) the automaton constructed from the right Cayley graph of S with respect to all of S as the generating set and ∑(C(S)) the automaton semigroup constructed from C(S). Such semigroups are termed Cayley automaton semigroups. For
McLeman, Alexander Lewis Andrew
core   +2 more sources