Chris Freiling

Christopher Francis Freiling is a mathematician responsible for Freiling's axiom of symmetry in set theory.^[1] He has also made significant contributions to coding theory, in the process establishing connections between that field and matroid theory.^[2]

Freiling obtained his Ph.D. in 1981 from the University of California, Los Angeles under the supervision of Donald A. Martin.^[3] He is a member of the faculty of the Department of Mathematics at California State University, San Bernardino.^[4]

Selected publications[]

Freiling, Chris (1986), "Axioms of symmetry: throwing darts at the real number line", The Journal of Symbolic Logic, 51 (1): 190–200, doi:10.2307/2273955, ISSN 0022-4812, JSTOR 2273955, MR 0830085
Dougherty, Randall; Freiling, Christopher; Zeger, Kenneth (2005), "Insufficiency of linear coding in network information flow", IEEE Transactions on Information Theory, 51 (8): 2745–2759, doi:10.1109/TIT.2005.851744, S2CID 2543400.
Dougherty, Randall; Freiling, Chris; Zeger, Kenneth (2007), "Networks, matroids, and non-Shannon information inequalities", IEEE Transactions on Information Theory, 53 (6): 1949–1969, doi:10.1109/TIT.2007.896862, MR 2321860, S2CID 27096.

References[]

^ Mumford, David (2000), "The dawning of the age of stochasticity", in Arnold, V.; Atiyah, M.; Lax, P.; Mazur, B. (eds.), Mathematics: Frontiers and Perspectives, Providence, RI: American Mathematical Society, pp. 197–218, MR 1754778. See in particular 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."
^ El Gamal, Abbas; Kim, Young-Han (2011), Network Information Theory, Cambridge University Press, p. 171, ISBN 9781139503143, 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.
^ Chris Freiling at the Mathematics Genealogy Project
^ Faculty/staff directory, CSUSB Mathematics Department, retrieved 2015-04-11.

External links[]

Home page

This article about a mathematician is a stub. You can help Wikipedia by .

[1] Mumford, David (2000), "The dawning of the age of stochasticity", in Arnold, V.; Atiyah, M.; Lax, P.; Mazur, B. (eds.), Mathematics: Frontiers and Perspectives, Providence, RI: American Mathematical Society, pp. 197–218, MR 1754778. See in particular 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."

[2] El Gamal, Abbas; Kim, Young-Han (2011), Network Information Theory, Cambridge University Press, p. 171, ISBN 9781139503143, 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.

[3] Chris Freiling at the Mathematics Genealogy Project

[4] Faculty/staff directory, CSUSB Mathematics Department, retrieved 2015-04-11.

[1]

[2]

[3]

[4]