|
Joan Hutchinson
Joan Prince Hutchinson (born 1945) is an American mathematician and Professor Emerita of Mathematics from Macalester College. Education Joan Hutchinson was born in Philadelphia, Pennsylvania; her father was a demographer and university professor, and her mother a mathematics teacher at the Baldwin School, which Joan also attended. She studied at Smith College in Northampton, Massachusetts, graduating in 1967 summa cum laude with an honors paper directed by Prof. Alice Dickinson. After graduation she worked as a computer programmer at the Woods Hole Oceanographic Institute and at the Harvard University Computing Center then studied mathematics (and English change ringing on tower bells) at the University of Warwick in Coventry England. Returning to the United States, Hutchinson did graduate work at the University of Pennsylvania earning a Ph.D. in mathematics in 1973 under the supervision of Herbert S. Wilf. Career She was a John Wesley Young research instructor at Dartmouth Col ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Macalester College
Macalester College () is a private liberal arts college in Saint Paul, Minnesota. Founded in 1874, Macalester is exclusively an undergraduate four-year institution and enrolled 2,174 students in the fall of 2018 from 50 U.S. states, four U.S territories, the District of Columbia and 97 countries. The college has Scottish roots and emphasizes internationalism and multiculturalism. History Macalester College was founded by Rev. Dr. Edward Duffield Neill in 1874 with help from the Presbyterian Church in Minnesota. Neill had served as a chaplain in the Civil War and traveled to Minnesota Territory in 1849. He became connected politically and socially. He went on to found two local churches, was appointed the first Chancellor of the University of Minnesota, and became the state's first superintendent of public education. In leaving the University of Minnesota Board of Regents he desired to build a religious college affiliated with the Presbyterian Church that would also be open to ot ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Sciences Research Institute
The Simons Laufer Mathematical Sciences Institute (SLMath), formerly the Mathematical Sciences Research Institute (MSRI), is an independent nonprofit mathematical research institution on the University of California campus in Berkeley, California. It is widely regarded as a world leading mathematical center for collaborative research, drawing thousands of leading researchers from around the world each year. The institute was founded in 1982, and its funding sources include the National Science Foundation, private foundations, corporations, and more than 90 universities and institutions. The institute is located at 17 Gauss Way on the Berkeley campus, close to Grizzly Peak in the Berkeley Hills. Because of its contribution to the nation's scientific potential, SLMath's activity is supported by the National Science Foundation and the National Security Agency. Private individuals, foundations, and nearly 100 Academic Sponsor Institutions, including the top mathematics departm ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Embedding
In topological graph theory, an embedding (also spelled imbedding) of a Graph (discrete mathematics), graph G on a surface (mathematics), surface \Sigma is a representation of G on \Sigma in which points of \Sigma are associated with graph theory, vertices and simple arcs (Homeomorphism, homeomorphic images of [0,1]) are associated with graph theory, edges in such a way that: * the endpoints of the arc associated with an edge e are the points associated with the end vertices of e, * no arcs include points associated with other vertices, * two arcs never intersect at a point which is interior to either of the arcs. Here a surface is a compact space, compact, connected space, connected 2-manifold. Informally, an embedding of a graph into a surface is a drawing of the graph on the surface in such a way that its edges may intersect only at their endpoints. It is well known that any finite graph can be embedded in 3-dimensional Euclidean space \mathbb^3.. A planar graph is one that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chromatic Number
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices are of the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges are of the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color. Vertex coloring is often used to introduce graph coloring problems, since other coloring problems can be transformed into a vertex coloring instance. For example, an edge coloring of a graph is just a vertex coloring of its line graph, and a face coloring of a plane graph is just a vertex coloring of its dual. However, non-vertex coloring problems are often stated and studied as-is. This is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heawood Conjecture
In graph theory, the Heawood conjecture or Ringel–Youngs theorem gives a lower bound for the number of colors that are necessary for graph coloring on a surface of a given genus. For surfaces of genus 0, 1, 2, 3, 4, 5, 6, 7, ..., the required number of colors is 4, 7, 8, 9, 10, 11, 12, 12, .... , the chromatic number or Heawood number. The conjecture was formulated in 1890 by Percy John Heawood and proven in 1968 by Gerhard Ringel and Ted Youngs. One case, the non-orientable Klein bottle, proved an exception to the general formula. An entirely different approach was needed for the much older problem of finding the number of colors needed for the plane or sphere, solved in 1976 as the four color theorem by Haken and Appel. On the sphere the lower bound is easy, whereas for higher genera the upper bound is easy and was proved in Heawood's original short paper that contained the conjecture. In other words, Ringel, Youngs and others had to construct extreme examples for every ge ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gabriel Andrew Dirac
Gabriel Andrew Dirac (13 March 1925 – 20 July 1984) was a Hungarian/British mathematician who mainly worked in graph theory. He served as Erasmus Smith's Professor of Mathematics at Trinity College Dublin 1964-1966. In 1952, he gave a sufficient condition for a graph to contain a Hamiltonian circuit. The previous year, he conjectured that n points in the plane, not all collinear, must span at least \lfloor n/2\rfloor two-point lines, where \lfloor x\rfloor is the largest integer not exceeding x. This conjecture was proven true when n is sufficiently large by Green and Tao in 2012. Education Dirac started his studies at St John's College, Cambridge in 1942, but by 1942 the war saw him serving in the aircraft industry. He received his MA in 1949, and moved to the University of London, getting his Ph.D. "On the Colouring of Graphs: Combinatorial topology of Linear Complexes" there under Richard Rado. Career Dirac's main academic positions were at the King's College London (19 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Mathematics
Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets (finite sets or sets with the same cardinality as the natural numbers). However, there is no exact definition of the term "discrete mathematics". The set of objects studied in discrete mathematics can be finite or infinite. The term finite mathematics is sometimes applied to parts of the field of discrete mathematics that deals with finite se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Graph Theory
The ''Journal of Graph Theory'' is a peer-reviewed mathematics journal specializing in graph theory and related areas, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. It is published by John Wiley & Sons. The journal was established in 1977 by Frank Harary.Frank Harary a biographical sketch at the ACM site The are [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
American Mathematical Monthly
''The American Mathematical Monthly'' is a mathematical journal founded by Benjamin Finkel in 1894. It is published ten times each year by Taylor & Francis for the Mathematical Association of America. The ''American Mathematical Monthly'' is an expository journal intended for a wide audience of mathematicians, from undergraduate students to research professionals. Articles are chosen on the basis of their broad interest and reviewed and edited for quality of exposition as well as content. In this the ''American Mathematical Monthly'' fulfills a different role from that of typical mathematical research journals. The ''American Mathematical Monthly'' is the most widely read mathematics journal in the world according to records on JSTOR. Tables of contents with article abstracts from 1997–2010 are availablonline The MAA gives the Lester R. Ford Awards annually to "authors of articles of expository excellence" published in the ''American Mathematical Monthly''. Editors *2022– ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Association For Women In Mathematics
The Association for Women in Mathematics (AWM) is a professional society whose mission is to encourage women and girls to study and to have active careers in the mathematical sciences, and to promote equal opportunity for and the equal treatment of women and girls in the mathematical sciences. The AWM was founded in 1971 and incorporated in the state of Massachusetts. AWM has approximately 5200 members, including over 250 institutional members, such as colleges, universities, institutes, and mathematical societies. It offers numerous programs and workshops to mentor women and girls in the mathematical sciences. Much of AWM's work is supported through federal grants. History The Association was founded in 1971 as the Association of Women Mathematicians, but the name was changed almost immediately. As reported in "A Brief History of the Association for Women in Mathematics: The Presidents' Perspectives", by Lenore Blum: Mary Gray, an early organizer and first president, placed ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Association Of America
The Mathematical Association of America (MAA) is a professional society that focuses on mathematics accessible at the undergraduate level. Members include university, college, and high school teachers; graduate and undergraduate students; pure and applied mathematicians; computer scientists; statisticians; and many others in academia, government, business, and industry. The MAA was founded in 1915 and is headquartered at 1529 18th Street, Northwest in the Dupont Circle neighborhood of Washington, D.C. The organization publishes mathematics journals and books, including the '' American Mathematical Monthly'' (established in 1894 by Benjamin Finkel), the most widely read mathematics journal in the world according to records on JSTOR. Mission and Vision The mission of the MAA is to advance the understanding of mathematics and its impact on our world. We envision a society that values the power and beauty of mathematics and fully realizes its potential to promote human flourishing ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
