Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Adrian M. Nelson"'
Autor:
Adrian M. Nelson
Publikováno v:
Discrete Mathematics. 342:697-714
There are extensive results known for the existence of generalized Bhaskar Rao designs signed over solvable groups, and particularly for designs with block size 3. There have so far been no comparable results for any non-solvable groups and in partic
Publikováno v:
Discrete Mathematics. 340:2925-2940
We introduce a new piecewise construction technique for generalised Bhaskar Rao designs and the concepts of generalised Bhaskar Rao block design pieces and holey generalised Bhaskar Rao block designs. We prove composition theorems for these designs.
Publikováno v:
Designs, Codes and Cryptography. 69:189-201
We show that the established necessary conditions for a GBRD $${(v,3,\lambda; \mathbb {G})}$$ are sufficient (i) when $${\mathbb {G}}$$ is supersolvable and (ii) when $${\mathbb {G}}$$ is solvable with $${\vert \mathbb {G} \vert }$$ prime to 3.
Publikováno v:
Discrete Mathematics. 310:1080-1088
There are well-known necessary conditions for the existence of a generalized Bhaskar Rao design over a group G, with block size k=3. It has been conjectured that these necessary conditions are indeed sufficient. We prove that they are sufficient for
Publikováno v:
The Electronic Journal of Combinatorics. 18
There are well known necessary conditions for the existence of a generalized Bhaskar Rao design over a group $\mathbb{G}$, with block size $k=3$. We prove that they are sufficient for nilpotent groups $\mathbb{G}$ of even order, and in particular for
Autor:
Adrian M. Nelson
Publikováno v:
Advances in Mathematics. 83:1-29
In this paper we prove a generalization of the cyclotomic identity for each group G satisfying suitable finiteness conditions. We prove this generalized cyclotomic identity by counting coloured G -set structures. The cyclotomic identity corresponds t
Publikováno v:
The Electronic Journal of Combinatorics. 13
We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers ${\Bbb Z}$, there is such a labelling whenever the graph has an infinit
Publikováno v:
Finite Fields and Their Applications. (3):294-303
Let P be a partial latin square of prime order p>7 consisting of three cyclically generated transversals. Specifically, let P be a partial latin square of the form:P={(i,c+i,s+i),(i,c′+i,s′+i),(i,c″+i,s″+i)|0⩽i7, every partial transversal o