Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

The location of the zeros of discrete systems characteristic polynomials with respect to the unit circle is investigated. A new sequence of symmetric polynomials of descending degrees is defined for ...

The results of a study into thousands of 'slopes' found by NASA on Mars' surface has left scientists surprised. The planet, ...

Conventional image annotation systems can only handle those images having labels within the exist library, but cannot recognize those novel labels. In order to learn new concepts, one has to gather ...

Concepts of Slope-Rotatability for Second Order Response Surface Designs (S H Park) Design of Experiments for Estimating Differences between Responses and Slopes of the Response (S Huda) Readership: ...

Let G be a graph of order n. A subset S of V (G) is a dominating set of G if every vertex in V (G)∖S is adjacent to at least one vertex of S. The domination polynomial of G is the polynomial D(G,x) ...

Navigation Menu Toggle navigation. Sign in Appearance settings ...

This is the SageMath code used in paper "A note on the zeros of even period polynomials for newforms on $\Gamma_0(N)$" by W. Ma. I ran this code in SageMath 10.6, with Kernel SageMath 10.6. About.