Results 171 to 180 of about 19,319 (303)

Commuting Pairs in Quasigroups

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT A quasigroup is a pair (Q,∗) $(Q,\ast )$, where Q $Q$ is a nonempty set and ∗ $\ast $ is a binary operation on Q $Q$ such that for every (a,b)∈Q2 $(a,b)\in {Q}^{2}$, there exists a unique (x,y)∈Q2 $(x,y)\in {Q}^{2}$ such that a∗x=b=y∗a $a\ast x=b=y\ast a$. Let (Q,∗) $(Q,\ast )$ be a quasigroup. A pair (x,y)∈Q2 $(x,y)\in {Q}^{2}$ is a commuting
Jack Allsop, Ian M. Wanless
wiley   +1 more source

Pneumonia detection with QCSA network on chest X-ray. [PDF]

open access: yesSci Rep, 2023
Singh S   +4 more
europepmc   +1 more source

Symmetric 2‐( 35 , 17 , 8 ) $(35,17,8)$ Designs With an Automorphism of Order 2

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT The largest prime p $p$ that can be the order of an automorphism of a 2‐( 35 , 17 , 8 ) $(35,17,8)$ design is p = 17 $p=17$, and all 2‐( 35 , 17 , 8 ) $(35,17,8)$ designs with an automorphism of order 17 were classified by Tonchev. The symmetric 2‐( 35 , 17 , 8 ) $(35,17,8)$ designs with automorphisms of an odd prime order p < 17 $p\lt 17 ...
Sanja Rukavina, Vladimir D. Tonchev
wiley   +1 more source

Levels of quaternion algebras [PDF]

open access: yesRocky Mountain Journal of Mathematics, 1989
openaire   +2 more sources

Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy