John Caughman

  • Citations Per Year
Learn More
Let denote a distance-regular graph with vertex set X , diameter D ≥ 3, valency k ≥ 3, and assume supports a spin model W . Write W = ∑D i=0 ti Ai where Ai is the i th distance-matrix of . To avoid degenerate situations we assume is not a Hamming graph and ti ∈ {t0, −t0} for 1 ≤ i ≤ D. In an earlier paper Curtin and Nomura determined the intersection(More)
This paper presents a synthesis algorithm, Covering Set Partitions (CSP), for reversible binary functions with no ancillary (garbage) bits. Existing algorithms are constrained to functions of small number of variables because they store the entire truth table of 2n terms in memory or require a huge amount of time to yield results because they must calculate(More)
T follicular helper (Tfh) cells are a highly plastic subset of CD4+ T cells specialized in providing B cell help and promoting inflammatory and effector responses during infectious and immune-mediate diseases. Helicobacter pylori is the dominant member of the gastric microbiota and exerts both beneficial and harmful effects on the host. Chronic inflammation(More)
May 18, Wednesday 09:00 Opening Room: Akira Suzuki Hall (ASH) Symposium Chair: T. Hanyu and Program Chair: Y. Yuminaka 09:15 [Keynote Address I] Chair: T. Hanyu Room: ASH Elucidation of Brain Activities by Electroencephalograms and its Application to Brain Computer Interface Takahiro Yamanoi (Hokkai-Gakuen University, Japan) 10:00 Coffee/Tea Break Entrance(More)
Alternate numeration systems are common in preservice teacher (PST) mathematics curricula, but there is limited research on how to leverage alternate systems to promote the development of mathematical knowledge for teaching. I analyzed the role of alternate numeration systems in three ways. I conducted a thematic analysis of current PST textbooks to(More)
Following the article “On the maximum number of edges in a k-uniform hypergraph with a unique perfect matching” by Deepak Bal, Andrzej Dudek, and Zelealem B. Yilma, this paper states and proves a tight upper bound for the number of edges in a hypergraph that has a unique perfect matching. The two main focuses of this paper are constructing a hypergraph(More)