Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Keith E. Mellinger"'
Autor:
Jeremy M. Dover, Keith E. Mellinger
Publikováno v:
Advances in Geometry. 15:333-338
The finite field Kakeya problem asks both the minimum size of a point set inAG(2, q)which contains a line in every direction, as well as a characterization of the examples. Blokhuis and Mazzocca [2] solved this problem, and a subsequent paper [1] add
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e670b4e502d3394ac6a8c3b6d16b7f6e
https://doi.org/10.1515/advgeom-2015-0013
https://doi.org/10.1515/advgeom-2015-0013
Autor:
Keith E. Mellinger, Jeremy M. Dover
Publikováno v:
European Journal of Combinatorics. 47:95-102
The finite field analog of the classical Kakeya problem asks the smallest possible size for a set of points in the Desarguesian affine plane which contains a line in every direction. This problem has been definitively solved by Blokhuis and Mazzocca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b479750eaa029a3eea3c0ded002f0eb9
https://doi.org/10.1016/j.ejc.2015.01.012
https://doi.org/10.1016/j.ejc.2015.01.012
Publikováno v:
Journal of Geometry. 107:119-123
A blocking semioval is a set of points in a projective plane that is both a blocking set (i.e., every line meets the set, but the set contains no line) and a semioval (i.e., there is a unique tangent line at each point). The minimum size of a blockin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26f977888e4a844e1f8ebf5d658df2a5
https://doi.org/10.1007/s00022-015-0278-y
https://doi.org/10.1007/s00022-015-0278-y
Publikováno v:
Journal of Combinatorial Designs. 22:95-104
Blokhuis and Mazzocca (A. Blokhuis and F. Mazzocca, The finite field Kakeya problem (English summary). Building bridges. Bolyai Soc Math Stud 19 (2008) 205–218) provide a strong answer to the finite field analog of the classical Kakeya problem, whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::465bcad94acd615b80085a5e1a1b8f13
https://doi.org/10.1002/jcd.21344
https://doi.org/10.1002/jcd.21344
Publikováno v:
advg. 13:29-40
A blocking semioval is a set of points in a projective plane that is both a blocking set (i.e., every line meets the set, but the set contains no line) and a semioval (i.e., there is a unique tangent line at each point). Sz˝onyi investigated an infi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4996f9dc18fa4430d94905fe58711f3
https://doi.org/10.1515/advgeom-2012-0025
https://doi.org/10.1515/advgeom-2012-0025
Publikováno v:
Finite Fields and Their Applications. 18:946-955
A cap in a projective or affine geometry is a set of points with the property that no line meets the set in more than two points. Barwick et al. [S.G. Barwick, W.-A. Jackson, C.T. Quinn, Conics and caps, J. Geom. 100 (2011) 15–28] provide a constru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f23b152e1d17f5ab4b38a17ec53870fe
https://doi.org/10.1016/j.ffa.2012.05.006
https://doi.org/10.1016/j.ffa.2012.05.006
Autor:
Keith E. Mellinger, Raymond Viglione
Publikováno v:
The College Mathematics Journal. 43:169-172
The Spider and the Fly puzzle, originally attributed to the great puzzler Henry Ernest Dudeney, and now over 100 years old, asks for the shortest path between two points on a particular square pris...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d6cac1eb51ba4f486c8d7743315380e
https://doi.org/10.4169/college.math.j.43.2.169
https://doi.org/10.4169/college.math.j.43.2.169
Autor:
Jeremy M. Dover, Keith E. Mellinger
Publikováno v:
Innov. Incidence Geom. 12, no. 1 (2011), 61-83
A semioval in a projective plane [math] is a collection of points [math] with the property that for every point [math] of [math] , there exists exactly one line of [math] meeting [math] precisely in the point [math] . There are many known constructio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c083231a672a2cf7a591d8a6959503cb
https://doi.org/10.2140/iig.2011.12.61
https://doi.org/10.2140/iig.2011.12.61
Autor:
Keith E. Mellinger, Ezra Brown
Publikováno v:
Mathematics Magazine. 82:3-15
Imagine fifteen young ladies at the Emmy Noether Boarding School—Anita, Barb, Carol, Doris, Ellen, Fran, Gail, Helen, Ivy, Julia, Kali, Lori, Mary, Noel, and Olive. Every day, they walk to school in the Official ENBS Formation, namely, in five rows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc9041cea4b415e3eb94ecbeab95aeef
https://doi.org/10.1080/0025570x.2009.11953586
https://doi.org/10.1080/0025570x.2009.11953586
Autor:
Keith E. Mellinger, T. L. Alderson
Publikováno v:
Discrete Mathematics. 308(7):1093-1101
We present new constructions for (n,w,λ) optical orthogonal codes (OOC) using techniques from finite projective geometry. In one case codewords correspond to (q-1)-arcs contained in Baer subspaces (and, in general, kth-root subspaces) of a projectiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::359a48a14f09602d7f0331de94cf546a