理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到数学 paths相关记录31条 . 查询时间(0.078 秒)
In this talk, we first recall some classical Hopf algebras on rooted trees, including Connes-Kreimer Hopf algebra and Loday-Ronco Hopf algebra. Then we give a combinatorial description of the coproduc...
In this paper we study Brownian zeroes in the neighborhood of which one can observe non-typical growth rate of Brownian excursions. We interprete the multifractal curve for the Brownian zeroes calcul...
We introduce a pathwise algorithm for the Cox proportional hazards model, regularized by convex combinations of `1 and `2 penalties (elastic net). Our algorithm fits via cyclical coordinate descent, a...
We give a bijection between permutations of 1, . . . , 2n and certain pairs of Dyck paths with labels on the down steps. The bijection arises from a game in which two players alternate selecting from ...
In this paper, the problem of optimal feedrate planning along a curved tool path for 3-axis CNC machines with the acceleration and jerk limits for each axis and the tangential velocity bound is addres...
Motivated by some numerical observations on molecular dynamics simulations, we analyze metastable trajectories in a very simplecsetting, namely paths generated by a one-dimensional overdamped Langevin...
The set of Dyck paths of length $2n$ inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution o...
Noncrossing linked partitions arise in the study of certain transforms in free probability theory. We explore the connection between noncrossing linked partitions and (3, 2)-Motzkin paths, where a (3,...
We study semi-infinite paths of the radial spanning tree (RST) of a Poisson point process in the plane. We first show that the expectation of the number of intersection points between semi-infinite pa...
We propose a new method for determining the elementary paths and elementary circuits in a directed graph. Also, the Hamiltonian paths and Hamiltonian circuits are enumerated.
The structure of Gaussian random fields over high levels is a well researched and well understood area, particularly if the field is smooth. However, the question as to whether or not two or more poin...
1.When equipped with 2-rough norm and restricted to continuous paths with bounded variation, the area operator is a closable unbounded operator. 2.The area defined through Riemann-Stieltjes integral i...
Abstract: The real minimum skew rank of a simple graph G is the smallest possible rank among all real skew symmetric matrices, whose (i,j)-entry (for i not equal to j) is nonzero whenever {i, j} is an...
Abstract: Given a positive and unitarily invariant Lagrangian L defined in the algebra of Hermitian matrices, and a fixed interval $[a,b]\subset\mathbb R$, we study the action defined in the Lie group...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

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

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...