Zobrazeno 1 - 10
of 2 770
pro vyhledávání: '"Mao, Jing"'
The girth of a graph is defined as the length of a shortest cycle in the graph. A $(k; g)$-cage is a graph of minimum order among all $k$-regular graphs with girth $g$. A cycle $C$ in a graph $G$ is termed nonseparating if the graph $G-V(C)$ remains
Externí odkaz:
http://arxiv.org/abs/2410.07028
For a given smooth convex cone in the Euclidean $(n+1)$-space $\mathbb{R}^{n+1}$ which is centered at the origin, we investigate the evolution of strictly mean convex hypersurfaces, which are star-shaped with respect to the center of the cone and whi
Externí odkaz:
http://arxiv.org/abs/2408.07949
Autor:
Mao, Jing, Zhang, Shijie
In this paper, by imposing suitable assumptions on the weighted function, (under the constraint of fixed weighted volume) a Brock-type isoperimetric inequality for Steklov-type eigenvalues of the Witten-Laplacian on bounded domains in a Euclidean spa
Externí odkaz:
http://arxiv.org/abs/2404.07412
Autor:
Chen, Ruifeng, Mao, Jing
In this paper, by mainly using the rearrangement technique and suitably constructing trial functions, under the constraint of fixed weighted volume, we can successfully obtain several isoperimetric inequalities for the first and the second Dirichlet
Externí odkaz:
http://arxiv.org/abs/2403.08075
Autor:
Chen, Ruifeng, Mao, Jing
An isoperimetric inequality for lower order nonzero Neumann eigenvalues of the Witten-Laplacian on bounded domains in a Euclidean space or a hyperbolic space has been proven in this paper. About this conclusion, we would like to point out two things:
Externí odkaz:
http://arxiv.org/abs/2403.08070
Autor:
Chen, Ying1,2 (AUTHOR), Mao, Jing1,3,4 (AUTHOR), Bao, Siyi1,3,4 (AUTHOR), Zhuang, Zheyu1,3,4 (AUTHOR), Gong, Ting3,5 (AUTHOR), Ji, Chao1,3,4 (AUTHOR) jichaofy@fjmu.edu.cn
Publikováno v:
Skin Research & Technology. Oct2024, Vol. 30 Issue 10, p1-5. 5p.
Given an eigenvalue $\lambda$ of the Laplace-Beltrami operator on $n-$spheres or $-$hemispheres, with multiplicity $m$ such that $\lambda=\lambda_{k}=\dots = \lambda_{k+m-1}$, we characterise the lowest and highest orders in the set $\left\{k,\dots,k
Externí odkaz:
http://arxiv.org/abs/2204.07277