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

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
 * &chi;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.