Zobrazeno 1 - 10
of 2 374 044
pro vyhledávání: '"G N."'
Publikováno v:
Journal of Shaanxi University of Science & Technology. Apr2024, Vol. 42 Issue 2, p224-232. 9p.
Autor:
Mougiakakos, Stavros, Vanhove, Pierre
The dynamics of the leading self-force (0SF) order, corresponding to the geodesic motion of a light body in the exact background of a heavy body, are explicitly derived for the first time using a flat space scattering amplitude-based approach. This i
Externí odkaz:
http://arxiv.org/abs/2407.09448
Autor:
Canning, Samir
We prove that the tautological rings $\mathsf{R}^*(\overline{\mathcal{M}}_{g,n})$ and $\mathsf{RH}^*(\overline{\mathcal{M}}_{g,n})$ are not Gorenstein when $g\geq 2$ and $2g+n\geq 24$, extending results of Petersen and Tommasi in genus $2$. The proof
Externí odkaz:
http://arxiv.org/abs/2406.10516
We consider a generalization of classic bootstrap percolation in which two competing processes concurrently evolve on the same graph $G(n,p)$. Nodes can be in one of three states, conveniently represented by different colors: red, black and white. In
Externí odkaz:
http://arxiv.org/abs/2405.00363
Autor:
Mougiakakos, Stavros, Vanhove, Pierre
We apply a formulation of Einstein's general relativity with only cubic interactions for deriving the metric of a Schwarzschild black hole to all orders in perturbation theory. This cubic interactions formulation coupled to effective worldline action
Externí odkaz:
http://arxiv.org/abs/2405.14421
Let $N_{\triangle}(G)$ be the number of triangles in a graph $G$. In [14] and [25] (respectively) the following bounds were proved on the lower tail behaviour of triangle counts in the dense Erd\H{o}s-R\'enyi random graphs $G_m\sim G(n,m)$: \[ \mathb
Externí odkaz:
http://arxiv.org/abs/2403.13792
In the present paper we discuss four ways of looking at rhombile tilings: stacking 3-dimensional cubes, elements of groups, and configurations of lines and points.
Externí odkaz:
http://arxiv.org/abs/2401.15345
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.