User:Jbeyerl

Welcome to my user page. I am a professional mathematician with an intention to contribute to some of Wikipedia's articles on mathematics. As I am a WikiOgre, I expect to have spurts of editing and lull's of nothing.

Reference Pages:

Help:Formula

Wikipedia:Manual of Style (mathematics)

TODO: Popular matching article (create)

TODO: Quotient Rule mnemonics (resurrect? - Why were they removed?)

TODO: q-series in modular form; growth rates; rationality. (What was wrong with this?)

TODO: Absolute geometry/Elliptic geometry/parallel postulate. (Parallel postulate definition, erroneous converse, Awkward definition of absolute geometry)

TODO: Upload images

  • Public domain Klein bottle
  • Public domain pile of marbles
  • Public domain pile of glass counters (& add to counter page)

TODO Graph theory stuff:

  • notation on edge list coloring
  • references on dot product reps
  • Clique graph (type of graph) - recreate page, per previous discussion with the admin that deleted it. Also find the proper references.
  • references on building Nim
  • references on improper and proper graphs, move/rename request on proper interval graphs.
  • yucky notation on dot product representation of a graph.
  • Create page on Villiany
  • χl vs ch in one of the articles. Edge or list colorings, right?
  • Miura fold image (If willing)

TODO Wikibooks Discrete Mathematics/Recursion

TODO Graph (Software) page and List of information graphics software.

Create a page on clique graphs, after verifying with a nonpreprint source: A clique graph is a simple graph in which every component is a clique. As with many terms in graph theory, there are subtle differences between similar sounding terms. In particular the graph itself need not be a clique, but may contain many cliques as subgraphs. A clique graph should also not be confused with the clique graph of a given graph G.

Properties

  • An (n,k,t) graph is a graph in which every set of k vertices has a subset of t vertices that form an induced clique. There are a variety of known and conjectured relationships between (n,k,t) graphs and clique graphs.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.