理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到数学 Polygons相关记录20条 . 查询时间(0.015 秒)
Quantization of bending deformations of polygons in E3,hypergeometric in tegrals and the Gassner representation.
THE SYMPLECTIC GEOMETRY OF POLYGONS IN THE 3-SPHERE.
THE SYMPLECTIC GEOMETRY OF POLYGONS IN HYPERBOLIC 3-SPACE.
Speyer and Sturmfels associated Grobner toric degenerations Gr¨2(Cn)T of Gr2(Cn) witheach trivalent tree T having n leaves. These degenerations induce toric degenerations Mr T of Mr, the space of n or...
The Symplectic Geometry of Polygons in Euclidean Space.
ON THE MODULI SPACE OF POLYGONS IN THE EUCLIDEAN PLANE.
Consider the moduli space of parabolic Higgs bundles (E,\Phi) of rank two on CP^1 such that the underlying holomorphic vector bundle for the parabolic vector bundle E is trivial. It is equipped with t...
We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best ...
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\Z^2$. We first prove a formula on...
Abstract: The pentagram map is a discrete dynamical system defined on the moduli space of polygons in the projective plane. This map has recently attracted a considerable interest, mostly because its ...
Abstract: We study the Hamiltonian vector field $v=(-\partial f/\partial w,\partial f/\partial z)$ on $\mathbb C^2$, where $f=f(z,w)$ is a polynomial in two complex variables, which is non-degenerate ...
Abstract: The extension complexity of a polytope $P$ is the smallest integer $k$ such that $P$ is the projection of a polytope $Q$ with $k$ facets. We study the extension complexity of $n$-gons in the...
In this survey paper, we present open problems and conjectures on visibility graphs of points, segments and polygons along with necessary backgrounds for understanding them.
Counting Euclidean triangulations with vertices in a finite set C of the convex hull Conv(C ) of C is difficult in general, both algorithmically and theoretically. The aim of this paper is to describ...
The aim of this paper is to study quasi-rational polygon related to outer billiard. We give a new characterisation of this class of polygons,and characterize the quasi-rational quadrilaterals.

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

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

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...