Background
Gross, Jonathan Light was born on June 11, 1941 in Philadelphia, Pennsylvania, United States. Son of Nathan K. and Henrietta E. (Light) Gross.
( Combinatorial Methods with Computer Applications provide...)
Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinatorial methods course or in a combined graph theory and combinatorics course. After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating summation expressions, binomial coefficients, partitions and permutations, and integer methods. The author then focuses on graph theory, covering topics such as trees, isomorphism, automorphism, planarity, coloring, and network flows. The final chapters discuss automorphism groups in algebraic counting methods and describe combinatorial designs, including Latin squares, block designs, projective planes, and affine planes. In addition, the appendix supplies background material on relations, functions, algebraic systems, finite fields, and vector spaces. Paving the way for students to understand and perform combinatorial calculations, this accessible text presents the discrete methods necessary for applications to algorithmic analysis, performance evaluation, and statistics as well as for the solution of combinatorial problems in engineering and the social sciences.
http://www.amazon.com/gp/product/1584887435/?tag=2022091-20
(This work by Gross (a statistician) and Rayner (an anthro...)
This work by Gross (a statistician) and Rayner (an anthropologist) looks at the measurement of the social organization which constitutes cultural bias. Their method is a quantitative refinement of Mary Douglas's so-called grid-group theory, introduced in the 1970s.
http://www.amazon.com/gp/product/0231060327/?tag=2022091-20
(Already an international bestseller, with the release of ...)
Already an international bestseller, with the release of this greatly enhanced second edition, Graph Theory and Its Applications is now an even better choice as a textbook for a variety of courses -- a textbook that will continue to serve your students as a reference for years to come. The superior explanations, broad coverage, and abundance of illustrations and exercises that positioned this as the premier graph theory text remain, but are now augmented by a broad range of improvements. Nearly 200 pages have been added for this edition, including nine new sections and hundreds of new exercises, mostly non-routine. What else is new? • New chapters on measurement and analytic graph theory • Supplementary exercises in each chapter - ideal for reinforcing, reviewing, and testing. • Solutions and hints, often illustrated with figures, to selected exercises - nearly 50 pages worth • Reorganization and extensive revisions in more than half of the existing chapters for smoother flow of the exposition • Foreshadowing - the first three chapters now preview a number of concepts, mostly via the exercises, to pique the interest of reader Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
http://www.amazon.com/gp/product/158488505X/?tag=2022091-20
( Clear, comprehensive introduction emphasizes graph imbe...)
Clear, comprehensive introduction emphasizes graph imbedding but also covers thoroughly the connections between topological graph theory and other areas of mathematics. Discussion of imbeddings into surfaces is combined with a complete proof of the classification of closed surfaces. Authors explore the role of voltage graphs in the derivation of genus formulas, explain the Ringel-Youngs theorem — a proof that revolutionized the field of graph theory — and examine the genus of a group, including imbeddings of Cayley graphs. 1987 edition. Many figures.
http://www.amazon.com/gp/product/0486417417/?tag=2022091-20
educator mathematician computer scientist
Gross, Jonathan Light was born on June 11, 1941 in Philadelphia, Pennsylvania, United States. Son of Nathan K. and Henrietta E. (Light) Gross.
Bachelor of Science, Massachusetts Institute of Technology, 1964. Master of Arts, Dartmouth College, 1966. Doctor of Philosophy, Dartmouth College, 1968.
Instructor mathematics, Princeton (New Jersey) U., 1968-1969; assistant professor mathematics statistics, Columbia University, New York City, 1969-1972; associate professor, Columbia University, New York City, 1973-1978; professor computer science, mathematics and statistics, Columbia University, New York City, since 1978; vice-department chairman computer science, Columbia University, New York City, 1982-1989; director education, Center for Advanced Technology, 1989-1993. Consultant Russell Sage Foundation, Institute Defense Analyses., American Telephone & Telegraph Company Bell laboratories, Alfred P. Sloan Foundation, International Business Machines Corporation, Oak Ridge National Laboratory. Visiting scientist Carnegie-Mellon U., Pittsburgh, 1984-1985.
(Already an international bestseller, with the release of ...)
( Combinatorial Methods with Computer Applications provide...)
( Clear, comprehensive introduction emphasizes graph imbe...)
(Interest in graphs and their applications has grown treme...)
(This work by Gross (a statistician) and Rayner (an anthro...)
Member executive board United Jewish Federation of Princeton Mercer-Bucks, 2004—2008, United Synagogue Mid-Atlantic Region, since 2005, secretary, since 2008. Member American Mathematics Society, Association Computing Machinery, Society Industrial and Applied Mathematics (secretary discrete mathematics 1994-1996), Jewish Center of Princeton (vice president 1997-1999, president 2000-2002).
Married Susan Fay Kodner, August 29, 1976. Children: Aaron, Jessica, Joshua, Rena Lea, Alisa Sharon.