理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到数学 connection相关记录31条 . 查询时间(0.057 秒)
Conformal invariance of critical lattice models in two-dimensional has been vigorously studied for decades. The first example where the conformal invariance was rigorously verified was the planar unif...
Topology and entanglement are two powerful principles for characterizing the structure of complex quantum states. In a new paper in the journal Physical Review X, researchers from the University of Pe...
Our aim here is to describe a direct and natural connection between the representation theory of GLn and the Schubert calculus, which goes via the Chern-Weil theory of characteristic classes. Indeed,...
The Burton–Cabrera–Frank (BCF) theory of step flow has been recognized as a valuable tool for describing nanoscale evolution of crystal surfaces. We formally derive a single-step BCF-type model from a...
We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The distribution of the Markov process converges to the uniform distribution ...
Morse Decomposition for Dynamical Systems on compact metric spaces : φ : R × X → X, initiated by Morse, was established by Morse, Smale, ect by using the gradient–like flows for Morse decomposition...
In 1974 Cvetkovi\'c and Simi\'c showed which graphs $G$ are the bipartite complements of line graphs. In 2002 Borovi\'canin showed which line graphs $L(H)$ have third largest eigenvalue $\lambda_3\leq...
A path in an edge-colored graph is called {\em rainbow} if no two edges of it are colored the same. For an $\ell$-connected graph $G$ and an integer $k$ with $1\leq k\leq \ell$, the {\em rainbow $k$-c...
Abstract: The Gauss-Manin connection for nonabelian cohomology spaces is the isomonodromy flow. We write down explicitly the vector fields of the isomonodromy flow and calculate its induced vector fie...
We study a wireless relay network, with a single source and a single destination.Our main result is to show that an appropriate compress-and-forward scheme supports essentially the same reliable data ...
Motivated by the study of billiards in polygons, we prove fine results for the distribution of gaps of directions of saddle connections on translation surfaces.
A vertex-colored graph is rainbow vertex-connected if any two ver-tices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster.
We define the concept of Levi Civita truncation for a Lagrangian in the Palatini formulation with an arbitrary connection, and show that its consistency uniquely identifies the Lovelock Lagrangians.
For a graph G, Chartrand et al. defined the rainbow connection number rc(G)and the strong rainbow connection number src(G) in “G. Charand, G.L. John,K.A. Mckeon, P. Zhang, Rainbow connection in graphs...
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of G, denoted rc(G), is the minimum number of c...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...