Related papers: Perturbation theory of polynomials and linear oper…
We explore perturbative double field theory about time-dependent (cosmological) backgrounds to cubic order. To this order the theory is consistent in a weakly constrained sense, so that for a toroidal geometry it encodes both momentum and…
By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…
We study a class of rooted trees with a substitution type structure. These trees are not necessarily regular, but exhibit a lot of symmetries. We consider nearest neighbor operators which reflect the symmetries of the trees. The spectrum of…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
We solve the Kato square root problem for bounded measurable perturbations of subelliptic operators on connected Lie groups. The subelliptic operators are divergence form operators with complex bounded coefficients, which may have lower…
Eigenvalue and eigenvector perturbation theory is a fundamental topic in several disciplines, including numerical linear algebra, quantum physics, and related fields. The central problem is to understand how the eigenvalues and eigenvectors…
We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…
The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \cite{DPR}. One of the elegant results corresponding with that…
The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
This paper seeks to further explore the distribution of the real roots of random polynomials with non-centered coefficients. We focus on polynomials where the typical values of the coefficients have power growth and count the average number…
The first well founded perturbation theory for classical solid systems is presented. Theoretical approaches to thermodynamic and structural properties of the hard-sphere solid provide us with the reference system. The traditional…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
This paper is concerned with robust preconditioning of wave equations constrained linear inverse problems from boundary observation data. The main result of this paper is a concept for regularization parameter robust preconditioning.…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
The characteristic polynomial of the effective Hamiltonian for a general model has been discussed. It is found that, compared with the associated energy eigenvalues, this characteristic polynomial generally has better analytical properties…
This paper deals with a unifying approach to the problems of computing the admissible sets of parametrical multi perturbations in appropriate bounded sets such that some fundamental properties of parameter-varying linear dynamic systems are…