Multiplicative functions additive on generalized pentagonal numbers

We prove that the set GP of all nonzero generalized pentagonal numbers is an additive uniqueness set; if a multiplicative function f satisfies the equation

$f(a+b)=f(a)+f(b),$

for all $a,b\in GP$, then f is the identity function.     

A conjecture involving generalized matrix functions

This paper resolves the following conjecture of R. Merris: Let d^G_λ be the generalized matrix function determined by a subgroup G of the symmetric group S_m and an irreducible complex character λ of G. If A, B, and A?B are m-square positive semidefinite hermitian m-square matrices and d^G_λ(A)=d^G_λ(B)≠0, then A=B.     

Test sets for generalized matrix functions

Let G = (V,E) be a biconnected graph and let C be a cycle in G. The subgraphs of G identified with the biconnected components of the contraction of C in G are called the bridges of C. Associated with the set of bridges of a cycle C is an auxilliary graphical structure G_C called a bridge graph or an overlap graph. Such auxilliary graphs have provided important insights in classical graph theory, algorithmic graph theory, and complexity theory. In this paper, we use techniques from algorithmic combinatorics and complexity theory to derive canonical forms for cycles in bridge graphs. These canonical forms clarify the relationship between cycles in bridge graphs, the structure of the underlying graph G, and lexicographic order relations on the vertices of attachment of bridges of a cycle. The first canonical form deals with the structure of induced bridge graph cycles of length greater than three. Cycles of length three in bridge graphs are studied from a different point of view, namely that of the characterization of minimal elements in certain related posets: ordered bridge three-cycles (10 minimal elements), bridge three-cycles (5 minimal elements), bridge deletion three-cycles (infinite number, 7 classes), minor order (K ₅ K _3,3), chordal bridge three-cycles (13 minimal elements), contraction poset (5 minimal elements), cycle-minor poset (infinite number, 14 classes). These results, each giving a different insight into the structure of bridge three-cycles, follow as corollaries from the characterization of the 10 minimal elements of the ordered bridge three-cycle poset. This characterization is constructive and may be regarded as an extension of the classical Kuratowski's Theorem which follows as a corollary. Algorithms are described for constructing these various minimal elements in time O(∣E∣) or O(∣V∣) depending on the case. The first canonical form gives a constructive proof of the result that a graph is nonplanar if and only if it has a cycle C whose bridge graph G_C (alternatively, skew bridge graph) has a three-cycle. An algorithm is described that constructs this three-cycle in time O(∣E∣). This is best possible.     

Positivity of matrices with generalized matrix functions

Using an elementary fact on matrices we show by a unified approach the positivity of a partitioned positive semidefinite matrix with each square block replaced by a compound matrix, an elementary symmetric function or a generalized matrix function. In addition, we present a refined version of the Thompson determinant compression theorem.     

Inequalities and identities for generalized matrix functions

Let χ be a character on the symmetric group S_n, and let A = (a_ij) be an n-by-n matrix. The function d_χ(A) = Σ_σ?Snχ(σ)Πⁿ_{t = 1}a_tσ(t) is called a generalized matrix function. If χ is an irreducible character, then d_χ is called an immanent. For example, if χ is the alternating character, then d_χ is the determinant, and if χ ≡ 1, then d_χ is called the permanent (denoted per). Suppose that A is positive semidefinite Hermitian. We prove that the inequality $\text{(1/χ(}\text{id}\text{))d}{}_{\mathrm{\chi }}\text{(A) ?}\text{per}\text{A}$ holds for a variety of characters χ including the irreducible ones corresponding to the partitions (n ? 1,1) and (n ? 2,1,1) of n. The main technique used to prove these inequalities is to express the immanents as sums of products of principal subpermanents. These expressions for the immanents come from analogous expressions for Schur polynomials by means of a correspondence of D.E. Littlewood.     

Support-type properties of generalized convex functions

Chebyshev systems induce in a natural way a concept of convexity. The functions convex in this sense behave in many aspects similarly to ordinary convex functions. In this paper support-type properties are investigated. Using osculatory interpolation, the existence of support-like functions is established for functions convex with respect to Chebyshev systems. Unique supports are determined. A characterization of the generalized convexity via support properties is presented.     

Regular equimodular sets of matrices for generalized matrix functions

Using expansions of generalized matrix functions by means of cyclic products and principal majors, conditions for regularity of equimodular classes of matrices are found.