Related papers: Two characteristic polynomials corresponding to gr…

We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…

The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…

We prove that the principal minors of the distance matrix of a tree satisfy a combinatorial expression involving counts of rooted spanning forests of the underlying tree. This generalizes a result of Graham and Pollak, and refines a result…

In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the…

The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…

In this paper, we examine roots of graph polynomials where those roots can be considered as structural graph measures. More precisely, we prove analytical results for the roots of certain modified graph polynomials and also discuss…

This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we…

Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gr\"obner bases and are radical if only if the graph is bipartite or the characteristic of the ground field is…

We study pairs of mutually orthogonal normal matrices with respect to tropical multiplication. Minimal orthogonal pairs are characterized. The diameter and girth of three graphs arising from the orthogonality equivalence relation are…

Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…

Newton's inequalities $c_n^2 \ge c_{n-1}c_{n+1}$ are shown to hold for the normalized coefficients $c_n$ of the characteristic polynomial of any $M$- or inverse $M$-matrix. They are derived by establishing first an auxiliary set of…

Let $K$ be a field of characteristic zero and let $\mathfrak{M}_5$ be the variety of associative algebras over $K$, defined by the identity $[x_1,x_2][x_3,x_4,x_5]$. It is well-known that such variety is a minimal variety and that is…

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

We show that for every subset $E$ of positive density in the set of integer square-matrices with zero traces, there exists an integer $k \geq 1$ such that the set of characteristic polynomials of matrices in $E-E$ contains the set of…

We establish general weak majorization inequalities, relating the leading exponents of the eigenvalues of matrices or matrix polynomials over the field of Puiseux series with the tropical analogues of eigenvalues. We also show that these…

Using the definition of colouring of $2$-edge-coloured graphs derived from $2$-edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to $2$-edge-coloured graphs. We find closed forms for the first three…

The examination of roots of constrained polynomials dates back at least to Waring and to Littlewood. However, such delicate structures as fractals and holes have only recently been found. We study the space of roots to certain integer…

This paper considers three separate matrices associated to graphs and (each dimension of) cell complexes. It relates all the coefficients of their respective characteristic polynomials to the geometric and combinatorial enumeration of three…

Here we consider the image of the principal minor map of symmetric matrices over an arbitrary unique factorization domain $R$. By exploiting a connection with symmetric determinantal representations, we characterize the image of the…

We consider 15 properties of labeled random graphs that are of interest in the graph-theoretical and the graph mining literature, such as clustering coefficients, centrality measures, spectral radius, degree assortativity, treedepth,…