Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Philip DeOrsey"'
Autor:
Christine von Renesse, Philip DeOrsey
Publikováno v:
PRIMUS. 32:74-89
We introduce a ruler and compass activity designed around Islamic Geometry and provide a detailed description of the various components of the activity along with ideas for students exhibitions in ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ab306ba2f87142d71fc22581da8dc35
https://doi.org/10.1080/10511970.2020.1827326
https://doi.org/10.1080/10511970.2020.1827326
Publikováno v:
Discrete & Computational Geometry. 64:542-565
A cyclic $$(n_{3})$$ configuration is a combinatorial configuration whose automorphism group contains a cyclic permutation of the points of the configuration; that is, the points of the configuration may be considered to be elements of $${\mathbb {Z}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27446ae605558b1ea273762d9abef63f
https://doi.org/10.1007/s00454-020-00203-1
https://doi.org/10.1007/s00454-020-00203-1
A $k$-arc in PG($2,q$) is a set of $k$ points no three of which are collinear. A hyperfocused $k$-arc is a $k$-arc in which the $k \choose 2$ secants meet some external line in exactly $k-1$ points. Hyperfocused $k$-arcs can be viewed as 1-factorizat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1b236edfabb9ebe757b702b84528f64
http://arxiv.org/abs/2105.08300
http://arxiv.org/abs/2105.08300
Autor:
Josh Tobin, Franklin H. J. Kenter, Troy Retter, Philip DeOrsey, Christopher Cox, Jessica De Silva
Publikováno v:
Mathematics Magazine. 88:323-336
The game of Hanabi is a multiplayer cooperative card game that has many similarities to a mathematical “hat guessing game.” In Hanabi, a player does not see the cards in her own hand and must rely ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aae1c968ecb4576818556c669a20e535
https://doi.org/10.4169/math.mag.88.5.323
https://doi.org/10.4169/math.mag.88.5.323
Autor:
Bernard Lidicky, Philip DeOrsey, Michael Ferrara, Jennifer Diemunsch, Stephen G. Hartke, Luke L. Nelsen, Sogol Jahanbekam, Derrick Stolee, Nathan Graber, Eric Sullivan
Publikováno v:
Scopus-Elsevier
The strong chromatic index of a graph $G$, denoted $\chi_s'(G)$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors. The strong list chromatic index, denoted $\chi_{s,\ell}'(G)$, is th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a685e061c1d393ed754746dae11c2208
http://www.scopus.com/inward/record.url?eid=2-s2.0-85051201191&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-85051201191&partnerID=MN8TOARS