اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Few Finite Trigonometric Sums
124
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Finite trigonometric sums occur in various branches of physics, mathematics, and their applications. These sums may contain various powers of one or more trigonometric functions. Sums with one trigonometric function are known, however sums with products of trigonometric functions can get complicated and may not have a simple expressions in a number of cases. Some of these sums have interesting properties and can have amazingly simple value. However, only some of them are available in literature. We obtain a number of such sums using method of residues.
قيم البحث
اقرأ أيضاً
We give an in-depth analysis of a 1-parameter family of electrified droplets first described in D. Khavinson et. al. (2005). We also investigate a technique for searching for new solutions to the droplet equation, and rederive via this technique a 1-
parameter family of physical droplets, which were first discovered by D. Crowdy (1999). We speculate on extensions of these solutions, in particular to the case of a droplet with multiple connected components.
The range of a trigonometric polynomial with complex coefficients can be interpreted as the image of the unit circle under a Laurent polynomial. We show that this range is contained in a real algebraic subset of the complex plane. Although the contai
nment may be proper, the difference between the two sets is finite, except for polynomials with certain symmetry.
Via a unified geometric approach, a class of generalized trigonometric functions with two parameters are analytically extended to maximal domains on which they are univalent. Some consequences are deduced concerning commutation with rotation, continu
ation beyond the domain of univalence, and periodicity.
We discuss the quantization of the $widehat{mathfrak{sl}}_2$ coset vertex operator algebra $mathcal{W}D(2,1;alpha)$ using the bosonization technique. We show that after quantization there exist three families of commuting integrals of motion coming f
rom three copies of the quantum toroidal algebra associated to ${mathfrak{gl}}_2$.
We show that a formalism proposed by Creutz to evaluate Grassmann integrals provides an algorithm of complexity $O(2^n n^3)$ to compute the generating function for the sum of the permanental minors of a matrix of order $n$. This algorithm improves ov
er the Brualdi-Ryser formula, whose complexity is at least $O(2^{frac{5n}{2}})$. In the case of a banded matrix with band width $w$ and rank $n$ the complexity is $O(2^{min(2w, n)} (w + 1) n^2)$. Related algorithms for the matching and independence polynomials of graphs are presented.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
