On the $k$-ary ‎M‎oment Map

نویسندگان

  • A. Dehghan Nezhad School of Mathematics, Iran University of Science and Technology, Tehran, Iran.
  • M. Dara School of Mathematics, Iran University of Science and Technology, Tehran, Iran.
چکیده

The moment map is a mathematical expression of the concept of the conservation associated with the symmetries of a Hamiltonian system. The abstract moment map is defined from G-manifold M to dual Lie algebra of G. We will interested study maps from G-manifold M to spaces that are more general than dual Lie algebra of G. These maps help us to reduce the dimension of a manifold much more.

برای دانلود باید عضویت طلایی داشته باشید

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Branches in random recursive k-ary trees

In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

متن کامل

On k-ary spanning trees of tournaments

It is well known that every tournament contains a Hamiltonian path, which can be restated as that every tournament contains a unary spanning tree. The purpose of this article is to study the general problem of whether a tournament contains a k-ary spanning tree. In particular, we prove that, for any fixed positive integer k, there exists a minimum number h(k) such that every tournament of order...

متن کامل

Percolation on a k-Ary Tree

Starting from the root, extend k branches and append k children with probability p, or terminate with probability q = 1− p. Then, we have a finite k-ary tree with probability one if 0 ≤ p ≤ 1/k. Moreover, we give the expectation and variance of the length of ideal codewords for representing the finite trees. Furthermore, we establish the probability of obtaining infinite tree, that is, of penet...

متن کامل

Capacities on lattices and k-ary capacities

We propose a general notion of capacity defined on any finite distributive lattice, encompassing usual capacities, bi-capacities, and their immediate extensions called k-ary capacities. We define key notions such as Möbius transform, derivative, Shapley value and Choquet integral.

متن کامل

ON BOTTLENECK PARTITIONING k-ARY n-CUBES

/raph partitioning is a topic of extensive interest, with applications to parallel processing. In this context graph nodes typically represent computation, and edges represent communication. One seeks to distribute the workload by partitioning the graph so that every processor has approximately the same workload, and the communication cost (measured as a fimction of edges exposed by the partiti...

متن کامل

Computing k-ary Compositions

We show that the problem of computing all contiguous k-ary compositions of a sequence of n values under an associative and commutative operator requires 3 k−1 k+1n−O(k) operations. For the operator max we show in contrast that in the decision tree model the complexity is ( 1 + Θ(1/ √ k) ) n − O(k). Finally we show that the complexity of the corresponding on-line problem for the operator max is ...

متن کامل

ذخیره در منابع من

ذخیره در منابع من ذخیره شده در منابع من

{@ msg_add @}

  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی راحت تر خواهید کرد

دانلود متن کامل

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید


عنوان ژورنال:

دوره 13  شماره 1

صفحات  53- 61

تاریخ انتشار 2021-09-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2021