理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到数学 Triangle相关记录29条 . 查询时间(0.078 秒)
In this paper we apply our results on the geometry of polygons in infinitesimal symmetric spaces, symmetric spaces and buildings, [KLM1, KLM2], to four problems in algebraic group theory. Two of these...
Most quasi-Monte Carlo research focuses on sampling from the unit cube. Many problems, especially in computer graphics, are de ned via quadrature over the unit triangle. Quasi-Monte Carlo methods fo...
Abstract: We show that the triangle with angles Pi/12, Pi/3 and 7*Pi/12 has the lattice property and compute this triangle's Veech group.
Abstract: Scott conjectured that the class of graphs with no induced subdivision of a given graph is $\chi$-bounded. We verify his conjecture for maximal triangle-free graphs.
Lam´e’s formulas for the eigenvalues and eigenfunctions of the continuous Laplacian on an equilateral triangle under Dirichlet and Neumann boundary conditions are herein extended to the discrete...
We show that the the image of the regular projection of a vertex of a cone over a triangle that minimizes the ratio of the cube of the area of the boundary of the cone and the square of the volume o...
If G is a group with a presentation of the form hx, y|x3 = y3 = W(x, y)2 = 1i, then either G is virtually soluble or G contains a free subgroup of rank 2. This provides additional evidence in favour...
Let $G$ be any triangle-free graph with maximum degree $\Delta\leq 3$. Staton proved that the independence number of $G$ is at least $\frac{5}{14}n$. Heckman and Thomas conjectured that Staton's resul...
We consider mixed integer linear programs defined by two equations involving two integer variables and non-negative continuous variables. The non-trivial facet-defining inequalities of such problems c...
We give the generalized triangle inequalities which determine the possible -valued side lengths of n-gons in thick Euclidean buildings of rank 2.
It is well known that a graph with m edges can be made triangle-free by removing (slightly less than) m/2 edges. On the other hand, there are many classes of graphs which are hard to make triangle-f...
Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent chambers in a certain graphic hyperplane arrangement. Properties of geodesi...
We give a generalization of the method of pessimistic estimators, in which we compose estimators by multiplying them. We give conditions on the pessimistic estimators of two expectations, under which ...
In this short note, by using some of Chen's theorems and classic analysis, we obtain a double inequality for triangle and give a positive answer to a problem posed by Yang and Yin [6].

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

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

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...