A generalized Perrin polynomial sequence and its two-dimensional recurrences
نویسندگان
چکیده
منابع مشابه
SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
متن کاملtransference of imagery: a comparative formalistic study of shakespeares hamlet and its two persian translations
هدف از این تحقیق بررسی انتقال صور خیال هملت در دو ترجمه ی فارسی آن از نظر فرمالیستی بود. برای بدست آوردن داده-های مورد نیاز، 130 نمونه استعاره، مجاز، ایهام، کنایه و پارادوکس در متن اصلی مشخص شده و سپس بر اساس مدل نیومارک (1998) برای ترجمه ی استعاره یا بطور کلی زبان مجاز با معادل های فارسی شان مقایسه گردیدند. این تحقیق بر آن بود تا روش های استفاده شده برای ترجمه هر کدام از انواع زبان مجاز ذکر شد...
15 صفحه اولGeneralized Fibonacci recurrences and the lex-least De Bruijn sequence
The skew of a binary string is the difference between the number of zeroes and the number of ones, while the length of the string is the sum of these two numbers. We consider certain suffixes of the lexicographicallyleast de Bruijn sequence at natural breakpoints of the binary string. We show that the skew and length of these suffixes are enumerated by sequences generalizing the Fibonacci and L...
متن کاملOptimal Tiling of Two-Dimensional Uniform Recurrences
Iteration space tiling is a common strategy used by parallelizing compilers and in performance tuning of parallel codes. We address the problem of determining the tile size that minimizes the total execution time of such a program. We restrict our attention to uniform dependency computations which have a parallelogram shaped two dimensional iteration space, and the target architecture is a line...
متن کاملPolynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution
Fast computation of two-dimensional (2-D) generalized discrete Fourier transforms (GDFTs) and generalized discrete Hartley transforms (GDHTs) are discussed in terms of a new method which is derived based on index permutation, linear congruences, and polynomial transforms. Further, the 2-D skew circular convolution computed by the proposed skew polynomial transform is also included. ( 2000 Elsev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of the Alexandru Ioan Cuza University - Mathematics
سال: 2021
ISSN: 2344-4967,1221-8421
DOI: 10.47743/anstim.2021.00019