Characteristic polynomials of symmetric matrices III: some counterexamples

When is a monic polynomial the characteristic polynomial of a symmetric matrix over an integral domain D? Known necessary conditions are shown to be insufficient when D is the field of 2-adic numbers and when D is the rational integers. The latter counterexamples lead to totally real cubic extensions of the rationals whose difierents are not narrowly equivalent to squares. Furthermorex³-4x+1 is the characteristic polynomial of a rational symmetric matrix and is the characteristic polynomial of an integral symmetric p-adic matrix for every prime p, but is not the characteristic polynomial of a rational integral symmetric matrix.     

Characteristic polynomials of symmetric matrices II: Local number fields

When is a monic polynomial the characteristic polynomial of a symmetric matrix over a field? A theorem on determinants of matrices commuting with a given matrix provides a simple necessary condition. The condition is sufficient over local number fields except for certain irreducible quartic polynomials over the 2-adic rational numbers.     

Relative symmetric polynomials

In this article, we introduce the notion of a relative symmetric polynomial with respect to a permutation group and an irreducible character and we give answers for some natural questions about their structures. In order to study symmetric polynomials with respect to linear characters, we define the concept of relative Vandermonde polynomial. Finally, we present some interesting research problems concerning relative symmetric polynomials.     

Random symmetric polynomials

Let {Q⁽ⁿ⁾(x₁,...,x_n)} be a sequence of symmetric polynomials having a fixed degree equal to k. Let {X_n1,...,X_nn}, n k, be some sequence of series of random variables (r.v.). We form the sequence of r.v. Y_n=Q⁽ⁿ⁾(X_n1, ... X_nn), n k One obtains limit theorems for the sequence Y_n, under very general assumptions.Translated from Veroyatnostnye Raspredeleniya i Matematicheskaya Statistika, pp. 170–188, 1986.     

Permanental polynomials of graphs

The first section surveys recent results on the permanental polynomial of a square matrix A, i.e., per(xI – A). The second section concerns the permanental polynomial of the adjacency matrix of a graph. The final section is an introduction to the permanental polynomial of the Laplacian matrix of a graph. An appendix lists some of these latter polynomials.     

Tension polynomials of graphs

The tension polynomial F_G(k) of a graph G, evaluating the number of nowhere‐zero ?_k‐tensions in G, is the nontrivial divisor of the chromatic polynomial χ_G(k) of G, in that χ_G(k) = k^c(G)F_G(k), where c(G) denotes the number of components of G. We introduce the integral tension polynomial I_G(k), which evaluates the number of nowhere‐zero integral tensions in G with absolute values smaller than k. We show that 2^r(G)F_G(k)≥I_G(k)≥ (r(G)+1)F_G(k), where r(G)=|V(G)|?c(G), and, for every k>1, F_G(k+1)≥ F_G(k)˙k / (k?1) and I_G(k+1)≥I_G(k)˙k/(k?1). © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 137–146, 2002     

Self-complementary symmetric graphs

The class of self-complementary symmetric graphs is characterized using the classification of finite simple group.     

Tension-flow polynomials on graphs

An orientation of a graph is acyclic (totally cyclic) if and only if it is a “positive orientation” of a nowhere-zero integral tension (flow). We unify the notions of tension and flow and introduce the so-called tension-flows so that every orientation of a graph is a positive orientation of a nowhere-zero integral tension-flow. Furthermore, we introduce an (integral) tension-flow polynomial, which generalizes the (integral) tension and (integral) flow polynomials. For every graph G, the tension-flow polynomial F_G(k₁,k₂) on G and the Tutte polynomial T_G(k₁,k₂) on G satisfy F_G(k₁,k₂)⩽T_G(k₁−1,k₂−1). We also characterize the graphs for which the inequality is sharp.     

N-extendability of symmetric graphs

It is proved that a cyclically (k ? 1)(2n ? 1)-edge-connected edge transitive k-regular graph with even order is n-extendable, where k ≥ 3 and k ? 1 ≥ n ≥ ?(k + 1)/2?. The bound of cyclic edge connectivity is sharp when k = 3. © 1993 John Wiley & Sons, Inc.     

Hermite interpolation with symmetric polynomials

We study the Hermite interpolation problem on the spaces of symmetric bivariate polynomials. We show that the multipoint Berzolari-Radon sets solve the problem. We also give a Newton formula for the interpolation polynomial and use it to prove a continuity property of the interpolation polynomial with respect to the interpolation points.     

Chebyshev polynomials on symmetric matrices

In this paper we evaluate Chebyshev polynomials of the second kind on a class of symmetric integer matrices, namely on adjacency matrices of simply laced Dynkin and extended Dynkin diagrams. As an application of these results we explicitly calculate minimal projective resolutions of simple modules of symmetric algebras with radical cube zero that are of finite and tame representation type.     

On a family of symmetric polynomials

In this paper, we provide two simple approaches to the explicit expression of a family of symmetric polynomials introduced and studied in Milovanovi? and Cvetkovi? [J. Math. Anal. Appl. 311 (2005) 191], thereby improving on their observations.     

Optimal graphs for chromatic polynomials

Let F(n,e) be the collection of all simple graphs with n vertices and e edges, and for G∈F(n,e) let P(G;λ) be the chromatic polynomial of G. A graph G∈F(n,e) is said to be optimal if another graph H∈F(n,e) does not exist with P(H;λ)?P(G;λ) for all λ, with strict inequality holding for some λ. In this paper we derive necessary conditions for bipartite graphs to be optimal, and show that, contrarily to the case of lower bounds, one can find values of n and e for which optimal graphs are not unique. We also derive necessary conditions for bipartite graphs to have the greatest number of cycles of length 4.     

Elementary symmetric polynomials of increasing order

Summary The asymptotic behaviour of elementary symmetric polynomials S _n ^(k) of order k, based on n independent and identically distributed random variables X ₁,..., X _n,is investigated for the case that both k and n get large. If , then the distribution function of a suitably normalised S _n ^(k) is shown to converge to a standard normal limit. The speed of this convergence to normality is of order , provided and certain natural moment assumptions are imposed. This order bound is sharp, and cannot be inferred from one of the existing Berry-Esseen bounds for U-statistics. If k at the rate n ^1/2 then a non-normal weak limit appears, provided the X _i's are positive and S _n ^(k) is standardised appropriately. On the other hand, if k at a rate faster than n ^1/2 then it is shown that for positive X _j'sthere exists no linear norming which causes S _n ^(k) to converge weakly to a nondegenerate weak limit.     

q-Binomials and related symmetric unimodal polynomials

The q-binomial coefficients were conjectured to be unimodal as early as the 1850's but it remained unproven until Sylvester's 1878 proof using invariant theory. In 1982, Proctor gave an ‘elementary’ proof using linear algebra. Finally, in 1989, Kathy O'Hara provided a combinatorial proof of the unimodality of the q-binomial coefficients. Very soon thereafter, Doron Zeilberger translated the argument into an elegant recurrence. We introduce several perturbations to the recurrence to create a larger family of unimodal polynomials. We analyse how these perturbations affect the final polynomial and analyse some specific cases.