« first day (2292 days earlier)      last day (1600 days later) » 

1:42 AM
Two of those newly created tags have been used in another question:
-3
Q: Find two functions f(x) and g(x) such that f((f(x)) = 1 and g(g(x))=1 for all x in R

Boris ClainFor x in R, f(x) = 1 is such a function : f(f(x)) = 1. But I need to find another, different function, such that g(g(x)) = 1 for all x in R. Any idea?

Since I think those tag might possibly be problematic, I have edited them away: mathoverflow.net/posts/347319/revisions
 
 
9 hours later…
10:19 AM
@MartinSleziak There are now two questions with the tag .
-2
Q: The directed graph of authors

Wlod AAThe vertices are published authors -- published in print or arXive, or authors of mathematical books. The ordered edges are triples $$ (r\,\,p\,\,a) $$ where $\,p\,$ is a paper or book authored or co-authored by $\,a\,$, and $\,r\,$ is an author referred to in paper/book $\,p\,$ and such that $...

7
Q: How did Riemann prove that the moduli space of compact Riemann surfaces of genus $g>1$ has dimension $3g-3$?

Yuhang ChenConsider the moduli space $M_g$ of compact Riemann surfaces (i.e., smooth complete algebraic curves over $\mathbb{C}$) of genus $g$ for some $g>1$. I'm interested in knowing how Riemann proved that $M_g$ has dimension $3g-3$. A modern proof involves deformation theory and Riemann-Roch theorem. ...

The tag seems rather redundant, considering that there is .
The tag can be either removed manually, or a synonym can be created. (The latter has advantage that no questions are bumped in the process and also this prevents another user from creating the same tag again in the future.)
@ToddTrimble Since I see that you're in chat (although in another chatroom), I'll ask what you think about this.
If creating a synonym is better than manual removal, moderators can do this easily.
 
 
5 hours later…
3:17 PM
1
Q: The pagenumber of subdivision of a complete graph

Jacob.Z.LeeA book embedding of a graph $G$ consists of placing the vertices of $G$ on a spine and assigning edges of the graph to pages so that edges in the same page do not cross each other. The book thickness $bt(G)$ is the minimum number of pages in which the graph $G$ can be embedded. I wondered whethe...

Extremal graph theory is a branch of mathematics that studies how global properties of a graph influence local substructure. It encompasses a vast number of results that describe how do certain graph properties - number of vertices (size), number of edges, edge density, chromatic number, and girth, for example - guarantee the existence of certain local substructures. One of the main objects of study in this area of graph theory are extremal graphs, which are maximal or minimal with respect to some global parameter, and such that they contain (or do not contain) a local substructure- such as a clique...
 
 
4 hours later…
7:18 PM
I will point out that there already exists a tag called (extremal-graph-theory). So if this is what you had in mind, there is no need to create a new tag. (And if there is some distinction between extreme graph theory and extremal graph theory, it would be good to clarify that in the tag-info.) — Martin Sleziak 18 secs ago
 

« first day (2292 days earlier)      last day (1600 days later) »