The characteristic map for polynomial functors
Polynomial functors and trees
... between polynomial functors, poly- nomial monads and trees, keeping the analogy with graphs, categories and linear orders as close as ...analogy, polynomial monads are algebras for a nice monad on ...
55
Polynomial functors and W-types for groupoids
... considered polynomial functors associated to Kan fibrations between Kan complexes and used ordinal iteration to define the appropriate initial algebras, and then showed that these are again Kan ...
135
Characteristic Polynomial of Arrangements and Multiarrangements
... In the next chapter, we obtain long exact sequences of the logarithmic modules of an arrangement and its deletion-restriction under the tame conditions. We observe how the tame conditions transfer between an arrangement ...
123
The characteristic polynomial and the matchings polynomial of a weighted oriented graph
... the characteristic polynomial of an arbitrary real skew symmetric matrix in terms of its associated oriented weighted ...the characteristic polynomial and deduce a formula on the matchings ...
11
Numerical Computation of the Characteristic Polynomial of a Complex Matrix
... This polynomial may be obtained by recurrence relations in which we determine successively the characteristic polynomi- als of each of the leading principal ...
131
Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
... of characteristic polynomial and the number of 5 and 6 matchings in regular graphs with girth 5 so that every 6cycle has at most one edge in common with 5cycles and with other 6cycles and also any two ...
17
Study on the Effects of Characteristic Polynomial in LFSR for Randomness Quality
... of characteristic polynomial in linear feedback shift registers (LFSR) for randomness ...different characteristic polynomials has been tested using National Institute of Standards & Technology (NIST) ...
5
On characteristic polynomial of higher order generalized Jacobsthal numbers
... Full list of author information is available at the end of the article Abstract In this paper, we study a higher order generalization of the Jacobsthal sequence, namely, the (k, c)-Jacobsthal sequence (J (k,c) n ) for ...
9
Average characteristic polynomials for multiple orthogonal polynomial ensembles
... average characteristic polynomial (average inverse characteristic polynomial, respectively) over the probabilistic ensemble that is associated to the ...
35
On zeros of the characteristic polynomial of matroids of bounded tree width
... matic polynomial of G may be written in terms of the chromatic polynomial of graphs with fewer vertices than G having tree-width at most k and the chromatic polynomial of G 0 in such a way that one ...
19
Summation polynomial algorithms for elliptic curves in characteristic two
... New Zealand. [email protected],[email protected] Abstract. The paper is about the discrete logarithm problem for elliptic curves over characteristic 2 finite fields F 2 n of prime degree n. ...
21
Secure Outsourced Computation of the Characteristic Polynomial and Eigenvalues of Matrix
... Many linear algebra tasks can be reduced to some core problems, such as matrix multiplication, determinant of matrix and the characteristic polynomial of matrix. However, it is difficult to execute these ...
10
Secure outsourced computation of the characteristic polynomial and eigenvalues of matrix
... Xing Hu 1 and Chunming Tang 2* Abstract Linear algebra plays an important role in computer science, especially in cryptography. Numerous cryptographic protocols and scientific computations are based on linear algebra, ...
6
Saddle points in the chaotic analytic function and Ginibre characteristic polynomial
... Comparison is made between the distribution of saddle points in the chaotic analytic function and in the characteristic polynomials of the Ginibre ensemble. Realizing the logarithmic derivative of these infinite ...
5
SOLVING QUADRATIC EQUATIONS OVER POLYNOMIAL RINGS OF CHARACTERISTIC TWO
... Proof: Without loss of generality, we can assume that a n 6 = 0. We proceed by induction on d. When d = −∞ , i.e., t = 0, we do not need to solve any equations (we have to check only whether a 0 is 0). When d = 0, (1) is ...
12
On the distribution of the maximum value of the characteristic polynomial of GUE random matrices
... 3. Numerical study of the distribution of the maximum modulus of GUE characteristic polynomials The purpose of this section is to provide a numerical test of conjecture 1.1, but for the reasons described below ...
20
Properties of characteristic polynomial of marker set distance and its Laplacian
... the characteristic polynomials of the marker set distance matrix and its Laplacian had been ...the characteristic polynomials of M-set distance matrix and its ...
12
Graded Character Rings, Mackey Functors and Tambara Functors
... Section 3.6 explores the interaction between tensor induction and the Gro- thendieck filtration; to this effect, one needs to understand how the tensor induction map (hereafter "norm map") can be extended ...
106
THE FERMAT FUNCTORS
... • X is surjective. If it is also injective, then it is an isomorphism in • C ∞ . Proof. This is an easy corollary of Theorem 4.28. To apply this proposition to calculate • X, the key part is to check the injectivity of ...
27
Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic
... for polynomial sources, we mention four distinct applications of such extractors for the simplest class of sources: affine ones, in which the degree of the source is 1 (see definition ...
19