Herbert Wilf (1931–2012) was a notable American mathematician, recognized for his contributions to combinatorics and mathematical education. He was a professor at the University of Pennsylvania and made significant advancements in various areas including generating functions, finite sequences, and combinatorial algorithms. Wilf was also known for his engaging teaching style and for writing influential textbooks, such as "Generatingfunctionology," which explores the power of generating functions in combinatorial mathematics.
Ira Gessel is an American mathematician known for his contributions to combinatorics and graph theory. He has made significant contributions in areas such as enumerative combinatorics, generating functions, and the theory of partitions. Gessel is also recognized for his work in the development of various mathematical tools and techniques used in combinatorial analysis. He has published numerous research papers and has been involved in mathematical education and mentorship.
Michael Krivelevich is a mathematician known for his work in the fields of combinatorics and graph theory. He has contributed to various topics within these areas, including random graphs, extremal graph theory, and algorithms.
Michelle L. Wachs is a prominent figure in the field of computer science, particularly known for her contributions to the areas of artificial intelligence and human-computer interaction. She has published numerous research papers and is recognized for her work on topics such as user interaction with technology and the design of intelligent systems.
Mireille Bousquet-Mélou is a prominent French mathematician known for her contributions to combinatorics, particularly in enumerative combinatorics and algebraic combinatorics. She has worked on various mathematical concepts, including generating functions, formal power series, and the enumeration of combinatorial structures. Bousquet-Mélou has also made significant contributions to the study of probabilistic combinatorics and graph theory.
Patricia Hersh appears to be a person's name, but without additional context, it's difficult to provide specific information about her. There may be various individuals with that name, each having different backgrounds or professions.
R. H. Bruck can refer to R. H. Bruck, an American physicist and engineer known for his work on various aspects of applied physics and engineering. However, without more specific context, it may also refer to different individuals or entities that share the name or initials. If you're looking for information on a specific R. H. Bruck or a particular field they're associated with, please provide more details!
Stephen Milne is an Australian mathematician noted for his contributions to various areas of mathematics, including applied mathematics and mathematical modeling. He may be involved in research, teaching, and possibly publishing scientific papers in his field. However, specific details about his work, achievements, or specific areas of expertise are not widely known in public domains or common references.
Sylvie Corteel is a name that may refer to different individuals or topics depending on the context, but there isn't a widely recognized public figure or notable event associated with that name up until my last update in October 2023. If you are referring to a specific person, text, or area of expertise, could you please provide more details?
Tamás Szőnyi could refer to various individuals, as it is a name common in Hungary. If you are looking for a specific person, such as an artist, academic, or public figure, please provide additional context or details so I can assist you more accurately.
Tomasz Łuczak does not appear to be a widely recognized figure as of my last knowledge update in October 2023. It is possible that he could be an individual known in a specific field, such as academia, art, business, or another area that may not be broadly covered in major sources.
William Henry Whitfeld was a notable figure in the field of civil engineering and transportation. He is best known for his work on various railway projects and contributions to the development of transportation infrastructure.
The European Journal of Combinatorics is a peer-reviewed academic journal that focuses on the field of combinatorics, which is a branch of mathematics dealing with the study of finite or discrete structures. The journal publishes research articles that cover a wide range of topics in combinatorics, including but not limited to graph theory, design theory, combinatorial optimization, and enumerative combinatorics.
The Graham–Rothschild theorem is a result in set theory, particularly in the area of infinite combinatorics. It deals with the properties of certain kinds of partitions of the natural numbers, specifically the partition relations involving sequences and subsets. The theorem states the following: If a family of sets of natural numbers (or more generally, a collection of sets) has a certain property related to partitioning, then it must contain subsets that exhibit a specific structure.
A **hyperbolic group** is a type of group that exhibits a particular geometric property related to negative curvature. The concept of hyperbolic groups originates from the study of hyperbolic geometry and plays a significant role in geometric group theory.
Word metrics typically refer to various measurements used to analyze and assess the properties of words or text. In the context of writing and linguistics, word metrics might include: 1. **Word Count**: The total number of words in a piece of writing. 2. **Word Frequency**: How often specific words appear within a text, which can help identify themes or key concepts.
A **free matroid** is a specific type of combinatorial structure that can be defined in the context of matroid theory. Matroids are abstract structures that generalize the notion of linear independence in vector spaces. They consist of a set and a collection of subsets (called independent sets) that satisfy certain axioms. In the case of free matroids, the concept is quite simple: - A free matroid is defined on a finite set where every subset of the set is considered independent.
A Random Minimum Spanning Tree (RMST) is a concept derived from graph theory and combinatorial optimization. In a typical minimum spanning tree (MST) problem, the goal is to connect all vertices of a weighted graph with the least possible total edge weight without any cycles. The classic algorithms for finding an MST include Prim's algorithm and Kruskal's algorithm. The concept of a Random Minimum Spanning Tree typically arises in the context of stochastic or probabilistic graphs.
"China Illustrata" is a notable work from the 17th century, created by the Jesuit priest and scholar Matteo Ricci, along with contributions from other Jesuits. The book, published in 1615, is an illustrated account of China, including its geography, culture, people, and customs. It is one of the earliest comprehensive European studies about China, providing valuable insights into Chinese society and governance during the Ming dynasty.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 2.
    You can publish local OurBigBook lightweight markup files to either https://OurBigBook.com or as a static website
    .
    Figure 3.
    Visual Studio Code extension installation
    .
    Figure 4.
    Visual Studio Code extension tree navigation
    .
    Figure 5.
    Web editor
    . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
    Video 4.
    OurBigBook Visual Studio Code extension editing and navigation demo
    . Source.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact