Zobrazeno 1 - 10
of 462
pro vyhledávání: '"Hawtin P"'
Autor:
Hawtin, Daniel R.
A code ${\mathcal C}$ is a subset of the vertex set of a Hamming graph $H(n,q)$, and ${\mathcal C}$ is $2$-neighbour-transitive if the automorphism group $G={\rm Aut}({\mathcal C})$ acts transitively on each of the sets ${\mathcal C}$, ${\mathcal C}_
Externí odkaz:
http://arxiv.org/abs/2411.08351
Autor:
Hawtin, Daniel R., Praeger, Cheryl E.
This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group acting on
Externí odkaz:
http://arxiv.org/abs/2407.09803
Autor:
Hawtin, Daniel R.
A $t$-fold packing of a projective space $\rm{PG}_n(q)$ is a collection $\mathcal{P}$ of line-spreads such that each line of $\rm{PG}_n(q)$ occurs in precisely $t$ spreads in $\mathcal{P}$. A $t$-fold packing $\mathcal{P}$ is transitive if a subgroup
Externí odkaz:
http://arxiv.org/abs/2402.00780
A code $C$ is a subset of the vertex set of a graph and $C$ is $s$-neighbour-transitive if its automorphism group ${\rm Aut}(C)$ acts transitively on each of the first $s+1$ parts $C_0,C_1,\ldots,C_s$ of the distance partition $\{C=C_0,C_1,\ldots,C_\
Externí odkaz:
http://arxiv.org/abs/2307.09752
A \emph{mixed dihedral group} is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper we give a sufficient condition such that t
Externí odkaz:
http://arxiv.org/abs/2304.10633
Autor:
Peter C. Taylor, Bryan Downie, Ling Han, Rachael Hawtin, Angie Hertz, Robert J. Moots, Tsutomu Takeuchi
Publikováno v:
Rheumatology and Therapy, Vol 11, Iss 5, Pp 1383-1392 (2024)
Abstract Introduction High baseline neutrophil-to-lymphocyte ratio (NLR) in rheumatoid arthritis (RA) has been associated with positive responses to biologic tumor necrosis factor inhibition and negative responses to conventional synthetic disease-mo
Externí odkaz:
https://doaj.org/article/8791698927c94580b5379123fd399380
A mixed dihedral group is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper, for each $n\geq 2$, we construct a mixed dihedra
Externí odkaz:
http://arxiv.org/abs/2303.00305
We introduce the notion of an \emph{$n$-dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is an $n$-dimensional mixed dihedral group then the we construct an edge-
Externí odkaz:
http://arxiv.org/abs/2211.16809
Autor:
Jeffrey R. Curtis, Paul Emery, Bryan Downie, Yan Zhong, Jinfeng Liu, Ling Han, Rachael E. Hawtin, Gerd Rüdiger Burmester
Publikováno v:
Rheumatology and Therapy, Vol 11, Iss 1, Pp 177-189 (2023)
Abstract Objectives To assess cigarette smoking’s effects on efficacy of the preferential Janus kinase (JAK) 1 inhibitor filgotinib and drug persistence in patients with rheumatoid arthritis (RA). Methods Efficacy in non-smokers, former smokers, an
Externí odkaz:
https://doaj.org/article/e8bc03cbee46488dacc4d9c58186f5de
A code $C$ in a generalised quadrangle ${\mathcal Q}$ is defined to be a subset of the vertex set of the point-line incidence graph $\varGamma$ of ${\mathcal Q}$. The minimum distance $\delta$ of $C$ is the smallest distance between a pair of distinc
Externí odkaz:
http://arxiv.org/abs/2105.05833