Related papers: Semi-characteristic polynomials, {\phi}-modules an…

In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…

We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…

We discuss rather systematically the principle, implicit in earlier works, that for a "random" element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic…

For an algebraically closed field $K$ of characteristic zero and a non-singular matrix $A\in \mbox{GL}_n(K)$, a semi-invariant polynomial of $A$ is defined to be a polynomial $p(x)=p(x_1,\dots,x_n)$ with coefficients in $K$ such that…

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

The characteristic polynomial plays an important role in study of hyperplane arrangements. There are several refinements of the characteristic polynomial. One of them is the coboundary polynomial defined by Crapo. Another refinement is the…

We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a…

We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.

After recalling the definition of codes as modules over skew polynomial rings, whose multiplication is defined by using an automorphism and a derivation, and some basic facts about them, in the first part of this paper we study some of…

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…