Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Chris Freiling
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
'''Christopher Francis Freiling''' is a mathematician responsible for [[Freiling's axiom of symmetry]] in [[set theory]].<ref>{{citation | last = Mumford | first = David | author-link = David Mumford | editor1-last = Arnold | editor1-first = V. | editor1-link = Vladimir Arnold | editor2-last = Atiyah | editor2-first = M. | editor2-link = Michael Atiyah | editor3-last = Lax | editor3-first = P. | editor3-link = Peter Lax | editor4-last = Mazur | editor4-first = B. | editor4-link = Barry Mazur | contribution = The dawning of the age of stochasticity | location = Providence, RI | mr = 1754778 | pages = 197β218 | publisher = American Mathematical Society | title = Mathematics: Frontiers and Perspectives | year = 2000}}. See in particular [https://books.google.com/books?id=qjVaD1OQbxEC&pg=PA208 p. 208]: "This leads us to the stunning result of Christopher Freiling (1986): using the idea of throwing darts, we can disprove the continuum hypothesis."</ref> He has also made significant contributions to [[coding theory]], in the process establishing connections between that field and [[matroid theory]].<ref>{{citation|title=Network Information Theory|first1=Abbas|last1=El Gamal|author1-link=Abbas El Gamal|first2=Young-Han|last2=Kim|publisher=Cambridge University Press|year=2011|isbn=9781139503143|page=171|url=https://books.google.com/books?id=Ack2AAAAQBAJ&pg=RA1-PA171|quote=Dougherty, Freiling, and Zeger (2005) showed via an ingenious counterexample that unlike the multicast case, linear network coding fails to achieve the capacity region of a general graphical multimessage network error-free. This counterexample hinges on a deep connection between linear network coding and matroid theory.}}</ref> Freiling obtained his Ph.D. in 1981 from the [[University of California, Los Angeles]] under the supervision of [[Donald A. Martin]].<ref>{{mathgenealogy|id=46539}}</ref> He is a member of the faculty of the Department of Mathematics at [[California State University, San Bernardino]].<ref>[http://www.math.csusb.edu/index.php?main=staffDirectory.html Faculty/staff directory] {{Webarchive|url=https://web.archive.org/web/20161011034838/http://www.math.csusb.edu/index.php?main=staffDirectory.html |date=2016-10-11 }}, CSUSB Mathematics Department, retrieved 2015-04-11.</ref> ==Selected publications== *{{Citation | last1=Freiling | first1=Chris | title=Axioms of symmetry: throwing darts at the real number line | doi=10.2307/2273955 | mr=830085 | year=1986 | journal=The Journal of Symbolic Logic | issn=0022-4812 | volume=51 | issue=1 | pages=190β200| jstor=2273955 | s2cid=38174418 }} *{{citation | last1 = Dougherty | first1 = Randall | author1-link = Randall Dougherty | last2 = Freiling | first2 = Christopher | last3 = Zeger | first3 = Kenneth | doi = 10.1109/TIT.2005.851744 | issue = 8 | journal = IEEE Transactions on Information Theory | pages = 2745β2759 | title = Insufficiency of linear coding in network information flow | volume = 51 | year = 2005| s2cid = 2543400 | citeseerx = 10.1.1.218.5329 }}. *{{citation | last1 = Dougherty | first1 = Randall | author1-link = Randall Dougherty | last2 = Freiling | first2 = Chris | last3 = Zeger | first3 = Kenneth | doi = 10.1109/TIT.2007.896862 | issue = 6 | journal = IEEE Transactions on Information Theory | mr = 2321860 | pages = 1949β1969 | title = Networks, matroids, and non-Shannon information inequalities | volume = 53 | year = 2007| s2cid = 27096 | citeseerx = 10.1.1.218.3066 }}. ==References== {{reflist}} ==External links== * [http://www.math.csusb.edu/faculty/freiling/index.php Home page] {{authority control}} {{DEFAULTSORT:Freiling, Chris}} [[Category:20th-century American mathematicians]] [[Category:21st-century American mathematicians]] [[Category:Set theorists]] [[Category:Coding theorists]] [[Category:University of California, Los Angeles alumni]] [[Category:California State University, San Bernardino faculty]] [[Category:Living people]] [[Category:Year of birth missing (living people)]] {{Mathematician-stub}}
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Templates used on this page:
Template:Authority control
(
edit
)
Template:Citation
(
edit
)
Template:Mathematician-stub
(
edit
)
Template:Mathgenealogy
(
edit
)
Template:Reflist
(
edit
)
Template:Webarchive
(
edit
)
Search
Search
Editing
Chris Freiling
Add topic