THE Odie PERIOD POLYNOMIAL
نویسندگان
چکیده
The coefficients and the discriminant of the octic period polynomial i/^z) are computed, where, for a prime p = 8/ + 1, ^(r) denotes the minimal polynomial over Q of the period (1/%)2.%Z¡ exp(2trins/p). Also, the finite set of prime octic nonresidues (mod p) which divide integers represented by i|/8(z) is characterized.
منابع مشابه
A Search Based Method for Clinical Text Coreference Resolution
This paper describes a novel method and system developed to address the coreference task of the 2011 i2b2 NLP Challenge, which involved analyzing clinical texts of several types and identifying the coreferential mentions within them. The method uses an open source search library component to do the heavy lifting for string matching, allowing a lightweight rule-based processing engine to cluster...
متن کاملLexical patterns, features and knowledge resources for coreference resolution in clinical notes
Generation of entity coreference chains provides a means to extract linked narrative events from clinical notes, but despite being a well-researched topic in natural language processing, general-purpose coreference tools perform poorly on clinical texts. This paper presents a knowledge-centric and pattern-based approach to resolving coreference across a wide variety of clinical records from two...
متن کاملExploring the Use of Random Regression Models withLegendre Polynomials to Analyze Clutch Sizein Iranian Native Fowl
Random regression models (RRM) have become common for the analysis of longitudinal data or repeated records on individual over time. The goal of this paper was to explore the use of random regression models with orthogonal / Legendre polynomials (RRL) to analyze new repeated measures called clutch size (CS) as a meristic trait for Iranian native fowl. Legendre polynomial functions of increasing...
متن کاملDetermination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010