Difference between revisions of "Landon Rabern"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| (7 intermediate revisions by the same user not shown) | |||
| Line 2: | Line 2: | ||
'''Landon W. Rabern''',<br/> | '''Landon W. Rabern''',<br/> | ||
| − | an American mathematician and software engineer in the AI industry. His research interests | + | an American mathematician and software engineer in the AI industry. His research interests include [https://en.wikipedia.org/wiki/Combinatorics combinatorics] and [https://en.wikipedia.org/wiki/Graph_theory graph theory], such as [https://en.wikipedia.org/wiki/Clique_problem clique problems], [https://en.wikipedia.org/wiki/Graph_coloring graph coloring] and [https://en.wikipedia.org/wiki/Edge_coloring edge coloring]. |
He holds a B.Sc. from [https://en.wikipedia.org/wiki/Washington_University_in_St._Louis Washington University in St. Louis] in 2003, | He holds a B.Sc. from [https://en.wikipedia.org/wiki/Washington_University_in_St._Louis Washington University in St. Louis] in 2003, | ||
a M.Sc. from [https://en.wikipedia.org/wiki/University_of_California,_Santa_Barbara University of California, Santa Barbara] in 2005, and | a M.Sc. from [https://en.wikipedia.org/wiki/University_of_California,_Santa_Barbara University of California, Santa Barbara] in 2005, and | ||
| Line 18: | Line 18: | ||
* [[Landon Rabern]] ('''2007'''). ''[https://www.combinatorics.org/ojs/index.php/eljc/article/view/v14i1n22 The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge]''. [https://en.wikipedia.org/wiki/Electronic_Journal_of_Combinatorics Electronic Journal of Combinatorics], Vol. 14 | * [[Landon Rabern]] ('''2007'''). ''[https://www.combinatorics.org/ojs/index.php/eljc/article/view/v14i1n22 The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge]''. [https://en.wikipedia.org/wiki/Electronic_Journal_of_Combinatorics Electronic Journal of Combinatorics], Vol. 14 | ||
* [[Landon Rabern]] ('''2008'''). ''[https://epubs.siam.org/doi/abs/10.1137/060659193 A Note On Reed's Conjecture]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Discrete_Mathematics SIAM Journal on Discrete Mathematics], Vol. 22, No. 2 <ref>[https://en.wikipedia.org/wiki/Chv%C3%A1tal_graph Chvátal graph from Wikipedia]</ref> | * [[Landon Rabern]] ('''2008'''). ''[https://epubs.siam.org/doi/abs/10.1137/060659193 A Note On Reed's Conjecture]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Discrete_Mathematics SIAM Journal on Discrete Mathematics], Vol. 22, No. 2 <ref>[https://en.wikipedia.org/wiki/Chv%C3%A1tal_graph Chvátal graph from Wikipedia]</ref> | ||
| + | * [http://brianrabern.net/ Brian Rabern], [[Landon Rabern]] ('''2008'''). ''[https://academic.oup.com/analysis/article-abstract/68/2/105/2740445?redirectedFrom=fulltext A simple solution to the hardest logic puzzle ever]''. [https://en.wikipedia.org/wiki/Analysis_(journal) Analysis], Vol. 68, No. 2 <ref>[[Mathematician#GBoolos|George Boolos]] credits [[Raymond Smullyan]] as the originator of the puzzle and [[John McCarthy]] with adding the difficulty of not knowing what '''da''' and '''ja''' mean, [[Mathematician#GBoolos|George Boolos]] ('''1996'''). ''[https://www.pdcnet.org/harvardreview/content/harvardreview_1996_0006_0001_0062_0065 The Hardest Logic Puzzle Ever]''. [https://en.wikipedia.org/wiki/The_Harvard_Review_of_Philosophy The Harvard Review of Philosophy], Vol. 6, No. 1, [https://en.wikipedia.org/wiki/The_Hardest_Logic_Puzzle_Ever The Hardest Logic Puzzle Ever - Wikipedia]</ref> | ||
* [[Landon Rabern]] ('''2009'''). ''On hitting all maximum cliques with an independent set''. [https://arxiv.org/abs/0907.3705 arXiv:0907.3705] | * [[Landon Rabern]] ('''2009'''). ''On hitting all maximum cliques with an independent set''. [https://arxiv.org/abs/0907.3705 arXiv:0907.3705] | ||
==2010 ...== | ==2010 ...== | ||
| Line 25: | Line 26: | ||
* [[Landon Rabern]] ('''2012'''). ''A different short proof of Brooks' theorem''. [https://arxiv.org/abs/1205.3253 arXiv:1205.3253] | * [[Landon Rabern]] ('''2012'''). ''A different short proof of Brooks' theorem''. [https://arxiv.org/abs/1205.3253 arXiv:1205.3253] | ||
* [[Landon Rabern]] ('''2012'''). ''Coloring graphs with dense neighborhoods''. [https://arxiv.org/abs/1209.3646 arXiv:1209.3646] | * [[Landon Rabern]] ('''2012'''). ''Coloring graphs with dense neighborhoods''. [https://arxiv.org/abs/1209.3646 arXiv:1209.3646] | ||
| − | * [[Landon Rabern]] ('''2013'''). ''Coloring graphs from almost maximum degree sized palettes''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Arizona_State_University Arizona State University], advisor: [[Mathematician#HAKierstead|Henry A. Kierstead], [https://repository.asu.edu/attachments/110259/content/Rabern_asu_0010E_12641.pdf pdf] | + | * [[Landon Rabern]] ('''2013'''). ''Coloring graphs from almost maximum degree sized palettes''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Arizona_State_University Arizona State University], advisor: [[Mathematician#HAKierstead|Henry A. Kierstead]], [https://repository.asu.edu/attachments/110259/content/Rabern_asu_0010E_12641.pdf pdf] |
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2014'''). ''Brooks' Theorem and Beyond''. [https://arxiv.org/abs/1403.0479 arXiv:1403.0479] | * [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2014'''). ''Brooks' Theorem and Beyond''. [https://arxiv.org/abs/1403.0479 arXiv:1403.0479] | ||
* [[Mathematician#HAKierstead|Hal Kierstead]], [[Landon Rabern]] ('''2014'''). ''Improved lower bounds on the number of edges in list critical and online list critical graphs''. [https://arxiv.org/abs/1406.7355 arXiv:1406.7355] | * [[Mathematician#HAKierstead|Hal Kierstead]], [[Landon Rabern]] ('''2014'''). ''Improved lower bounds on the number of edges in list critical and online list critical graphs''. [https://arxiv.org/abs/1406.7355 arXiv:1406.7355] | ||
| + | * [[Landon Rabern]] ('''2014'''). ''[https://www.sciencedirect.com/science/article/pii/S0012365X13005116 A game generalizing Hall’s Theorem]''. [https://en.wikipedia.org/wiki/Discrete_Mathematics_(journal) Discrete Mathematics], Vol. 320 <ref>[https://en.wikipedia.org/wiki/Hall%27s_marriage_theorem Hall's marriage theorem - Wikipedia]</ref> | ||
==2015 ...== | ==2015 ...== | ||
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Subcubic edge chromatic critical graphs have many edges''. [https://arxiv.org/abs/1506.04225 arXiv:1506.04225] | * [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Subcubic edge chromatic critical graphs have many edges''. [https://arxiv.org/abs/1506.04225 arXiv:1506.04225] | ||
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Edge-coloring via fixable subgraphs''. [https://arxiv.org/abs/1507.05600 arXiv:1507.05600] | * [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Edge-coloring via fixable subgraphs''. [https://arxiv.org/abs/1507.05600 arXiv:1507.05600] | ||
| + | * [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Beyond Degree Choosability''. [https://arxiv.org/abs/1511.00350 arXiv:1511.00350] | ||
* [[Mathematician#HAKierstead|Hal Kierstead]], [[Landon Rabern]] ('''2015'''). ''Extracting list colorings from large independent sets''. [https://arxiv.org/abs/1512.08130 arXiv:1512.08130] | * [[Mathematician#HAKierstead|Hal Kierstead]], [[Landon Rabern]] ('''2015'''). ''Extracting list colorings from large independent sets''. [https://arxiv.org/abs/1512.08130 arXiv:1512.08130] | ||
* [[Landon Rabern]] ('''2016'''). ''A better lower bound on average degree of 4-list-critical graphs''. [https://arxiv.org/abs/1602.08532 arXiv:1602.08532] | * [[Landon Rabern]] ('''2016'''). ''A better lower bound on average degree of 4-list-critical graphs''. [https://arxiv.org/abs/1602.08532 arXiv:1602.08532] | ||
* [[Landon Rabern]] ('''2016'''). ''A better lower bound on average degree of k-list-critical graphs''. [https://arxiv.org/abs/1608.06989 arXiv:1608.06989] | * [[Landon Rabern]] ('''2016'''). ''A better lower bound on average degree of k-list-critical graphs''. [https://arxiv.org/abs/1608.06989 arXiv:1608.06989] | ||
| − | * [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] (''' | + | * [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2018'''). ''[https://www.sciencedirect.com/science/article/pii/S009589561830025X Planar graphs are 9/2-colorable]''. [https://en.wikipedia.org/wiki/Journal_of_Combinatorial_Theory Journal of Combinatorial Theory], Series B, Vol. 133, [https://arxiv.org/abs/1410.7233 arXiv:1410.7233] |
| + | * [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2019'''). ''[https://epubs.siam.org/doi/abs/10.1137/18M117056X The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Discrete_Mathematics SIAM Journal on Discrete Mathematics], Vol. 33, No. 3, [https://arxiv.org/abs/1703.00959 arXiv:1703.00959] | ||
=Forum Posts= | =Forum Posts= | ||
| + | * [https://www.stmintz.com/ccc/index.php?id=125117 Re: C or C++ for Chess Programming?] by [[Landon Rabern]], [[CCC]], August 18, 2000 | ||
* [https://www.stmintz.com/ccc/index.php?id=128512 Betsy 5.0 is now winboard compatable] by [[Landon Rabern]], [[CCC]], September 06, 2000 | * [https://www.stmintz.com/ccc/index.php?id=128512 Betsy 5.0 is now winboard compatable] by [[Landon Rabern]], [[CCC]], September 06, 2000 | ||
* [https://www.stmintz.com/ccc/index.php?id=178491 Betsy 5.26] by [[Landon Rabern]], [[CCC]], July 06, 2001 | * [https://www.stmintz.com/ccc/index.php?id=178491 Betsy 5.26] by [[Landon Rabern]], [[CCC]], July 06, 2001 | ||
| + | * [https://www.stmintz.com/ccc/index.php?id=302797 Re: FRC_TheBaron_101 Vs Fritz8 (Castling vs Not Castling rules)] by [[Landon Rabern]], [[CCC]], June 24, 2003 | ||
=External Links= | =External Links= | ||
| + | * [https://landon.github.io/ landon rabern] | ||
* [https://www.linkedin.com/in/landon-rabern-421a3173 landon rabern | LinkedIn] | * [https://www.linkedin.com/in/landon-rabern-421a3173 landon rabern | LinkedIn] | ||
* [https://scholar.google.com/citations?user=aZg5kIEAAAAJ&hl=en landon rabern - Google Scholar Citations] | * [https://scholar.google.com/citations?user=aZg5kIEAAAAJ&hl=en landon rabern - Google Scholar Citations] | ||
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=176173 Landon Rabern - The Mathematics Genealogy Project] | * [https://genealogy.math.ndsu.nodak.edu/id.php?id=176173 Landon Rabern - The Mathematics Genealogy Project] | ||
| + | * [https://github.com/landon landon (landon rabern) · GitHub] | ||
| + | * [https://github.com/landon/Chess GitHub - landon/Chess: Beginnings of a port of Betsy to C#] | ||
=References= | =References= | ||
Latest revision as of 11:31, 6 January 2020
Landon W. Rabern,
an American mathematician and software engineer in the AI industry. His research interests include combinatorics and graph theory, such as clique problems, graph coloring and edge coloring.
He holds a B.Sc. from Washington University in St. Louis in 2003,
a M.Sc. from University of California, Santa Barbara in 2005, and
a Ph.D. from Arizona State University in 2013.
As a computer chess programmer, Landon Rabern is author the WinBoard compatible chess engine Betsy [1], which was the first published chess engine able to play Chess960 [2].
Contents
Selected Publications
2003
- Landon W. Rabern (2003). Properties of Magic Squares of Squares. Rose-Hulman Undergraduate Mathematics Journal, Vol. 4, No. 1
2005 ...
- Landon Rabern (2005). Some bounds on convex combinations of ω and χ for decompositions into many parts. arXiv:math/0512291
- Landon Rabern (2006). New upper bounds on the chromatic number of a graph. arXiv:math/0606632
- Landon Rabern (2006). On Graph Associations. SIAM Journal on Discrete Mathematics, Vol. 20, No. 2
- Landon Rabern (2007). The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge. Electronic Journal of Combinatorics, Vol. 14
- Landon Rabern (2008). A Note On Reed's Conjecture. SIAM Journal on Discrete Mathematics, Vol. 22, No. 2 [4]
- Brian Rabern, Landon Rabern (2008). A simple solution to the hardest logic puzzle ever. Analysis, Vol. 68, No. 2 [5]
- Landon Rabern (2009). On hitting all maximum cliques with an independent set. arXiv:0907.3705
2010 ...
- Landon Rabern (2011). An improvement on Brooks' Theorem. arXiv:1102.1021 [6]
- Landon Rabern (2011). A note on vertex partitions. arXiv:1107.1735
- Landon Rabern (2012). Partitioning and coloring with degree constraints. arXiv:1202.5855
- Landon Rabern (2012). A different short proof of Brooks' theorem. arXiv:1205.3253
- Landon Rabern (2012). Coloring graphs with dense neighborhoods. arXiv:1209.3646
- Landon Rabern (2013). Coloring graphs from almost maximum degree sized palettes. Ph.D. thesis, Arizona State University, advisor: Henry A. Kierstead, pdf
- Daniel W. Cranston, Landon Rabern (2014). Brooks' Theorem and Beyond. arXiv:1403.0479
- Hal Kierstead, Landon Rabern (2014). Improved lower bounds on the number of edges in list critical and online list critical graphs. arXiv:1406.7355
- Landon Rabern (2014). A game generalizing Hall’s Theorem. Discrete Mathematics, Vol. 320 [7]
2015 ...
- Daniel W. Cranston, Landon Rabern (2015). Subcubic edge chromatic critical graphs have many edges. arXiv:1506.04225
- Daniel W. Cranston, Landon Rabern (2015). Edge-coloring via fixable subgraphs. arXiv:1507.05600
- Daniel W. Cranston, Landon Rabern (2015). Beyond Degree Choosability. arXiv:1511.00350
- Hal Kierstead, Landon Rabern (2015). Extracting list colorings from large independent sets. arXiv:1512.08130
- Landon Rabern (2016). A better lower bound on average degree of 4-list-critical graphs. arXiv:1602.08532
- Landon Rabern (2016). A better lower bound on average degree of k-list-critical graphs. arXiv:1608.06989
- Daniel W. Cranston, Landon Rabern (2018). Planar graphs are 9/2-colorable. Journal of Combinatorial Theory, Series B, Vol. 133, arXiv:1410.7233
- Daniel W. Cranston, Landon Rabern (2019). The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4. SIAM Journal on Discrete Mathematics, Vol. 33, No. 3, arXiv:1703.00959
Forum Posts
- Re: C or C++ for Chess Programming? by Landon Rabern, CCC, August 18, 2000
- Betsy 5.0 is now winboard compatable by Landon Rabern, CCC, September 06, 2000
- Betsy 5.26 by Landon Rabern, CCC, July 06, 2001
- Re: FRC_TheBaron_101 Vs Fritz8 (Castling vs Not Castling rules) by Landon Rabern, CCC, June 24, 2003
External Links
- landon rabern
- landon rabern | LinkedIn
- landon rabern - Google Scholar Citations
- Landon Rabern - The Mathematics Genealogy Project
- landon (landon rabern) · GitHub
- GitHub - landon/Chess: Beginnings of a port of Betsy to C#
References
- ↑ landon_resume.pdf
- ↑ Der Chess960-Express ist nicht mehr aufzuhalten, Chess Tigers Training Center, July 20, 2005 (German)
- ↑ dblp: Landon Rabern
- ↑ Chvátal graph from Wikipedia
- ↑ George Boolos credits Raymond Smullyan as the originator of the puzzle and John McCarthy with adding the difficulty of not knowing what da and ja mean, George Boolos (1996). The Hardest Logic Puzzle Ever. The Harvard Review of Philosophy, Vol. 6, No. 1, The Hardest Logic Puzzle Ever - Wikipedia
- ↑ Brooks' theorem from Wikipedia
- ↑ Hall's marriage theorem - Wikipedia
