Related papers: The characteristic polynomial of a multiarrangemen…
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
Given a nonnegative integer $m$ and a finite collection ${\mathcal A}$ of linear forms on ${\mathbb Q}^d$, the arrangement of affine hyperplanes in ${\mathbb Q}^d$ defined by the equations $\alpha(x) = k$ for $\alpha \in {\mathcal A}$ and…
Consider the collection of hyperplanes in $\mathbb{R}^n$ whose defining equations are given by $\{x_i + x_j = 0\mid 1\leq i<j\leq n\}$. This arrangement is called the threshold arrangement since its regions are in bijection with labeled…
Saito's criterion is a foundational result that algebraically characterizes free hyperplane arrangements via the determinant of a square matrix of logarithmic derivations. It is natural to ask whether this criterion can be generalized to…
In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…
Starting from the expression for the superdeterminant of $ (xI-M)$, where $M$ is an arbitrary supermatrix , we propose a definition for the corresponding characteristic polynomial and we prove that each supermatrix satisfies its…
A characteristic polynomial is an important invariant in the field of hyperplane arrangement. For the Linial arrangement of any irreducible root system, Postnikov and Stanley conjectured that all roots of the characteristic polynomial have…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by…
Let $\mathbb C$ be the set of complex numbers, and let $\mathcal P$ be a collection of complex polynomial maps in several variables. Assuming at least one $P\in\mathcal P$ depends on at least two variables, we classify all possibilities for…
We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…
In this paper, we discuss characteristic polynomials in (Clifford) geometric algebras ${\mathcal {G}}_{p,q}$ of vector space of dimension $n=p+q$. We present basis-free formulas for all characteristic polynomial coefficients in the cases…
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…
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…
A characteristic function is a special operator-valued analytic function defined on the open unit ball of $\mathbb{C}^n$ associated with an $n$-tuple of commuting row contraction on some Hilbert space. In this paper, we continue our study…
We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…
We introduce symmetrizing operators of the polynomial ring $A[x]$ in the varible $x$ over a ring $A$. When $A$ is an algebra over a field $k$ these operators are used to characterize the monic polynomials $F(x)$ of degree $n$ in $A[x]$ such…
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…
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…