6
votes
0answers
409 views
+100

Counting limit cycles via curvature in Riemannian geometry

In this post we would like to give a possible new approach to the second part of the Hilbert 16th problem First we give a short introduction: A quadratic system is a polynomial vector field on ...
1
vote
1answer
59 views
+50

Relaxed path decomposition of a graph

Definition Given a directed connected graph $G$ without multiple edges or self loops. We call a final path of $G$ a path ending with a vertex with no successor (the path can not be extended anymore) ...
2
votes
0answers
49 views
+50

How are Polynomials of Toric ideals Studied with Exponents as ST-cuts?

Topic: Toric ideals on Expected value of Structure Functions in Random Graphs Goal: to understand the toric ideal where the exponents $h_i$ and $s_j$ are st-vertex-cuts of a digraph \begin{equation} ...
2
votes
0answers
55 views
+100

Can all Local Martingales Be Represented using Only Brownian Motion and Finite Variation Processes?

This is a cross-post of my unanswered (more than a week) question on Math.SE. Since it covers topics from my graduate-level course on stochastic processes, I thought it might be appropriate to try to ...