Forwarding and optical indices of a graph

Motivated by wavelength-assignment problems for all-to-all traffic in optical networks, we study graph parameters related to sets of paths connecting all pairs of vertices. We consider sets of both undirected and directed paths, under minimisation criteria known as edge congestion and wavelength count; this gives rise to four parameters of a graph G: its edge forwarding index π(G), arc forwarding index , undirected optical index , and directed optical index .In the paper we address two long-standing open problems: whether the equality holds for all graphs, and whether indices π(G) and are hard to compute. For the first problem, we give an example of a family of planar graphs {G_k} such that . For the second problem, we show that determining either π(G) or is NP-hard.     

On strong unimodality of multivariate discrete distributions

A discrete function f defined on Zⁿ is said to be logconcave if for , , . A more restrictive notion is strong unimodality. Following Barndorff-Nielsen [O. Barndorff-Nielsen, Unimodality and exponential families, Commun. Statist. 1 (1973) 189-216] a discrete function is called strongly unimodal if there exists a convex function such that  if . In this paper sufficient conditions that ensure the strong unimodality of a multivariate discrete distribution, are given. Examples of strongly unimodal multivariate discrete distributions are presented.     

Two classes of edge domination in graphs

Let (, resp.) be the number of (local) signed edge domination of a graph G [B. Xu, On signed edge domination numbers of graphs, Discrete Math. 239 (2001) 179-189]. In this paper, we prove mainly that and hold for any graph G of order n(n?4), and pose several open problems and conjectures.     

Inducing regulation of any digraphs

For a given structure D (digraph, multidigraph, or pseudodigraph) and an integer r large enough, a smallest inducing r-regularization of D is constructed. This regularization is an r-regular superstructure of the smallest possible order with bounded arc multiplicity, and containing D as an induced substructure. The sharp upper bound on the number, ρ, of necessary new vertices among such superstructures for n-vertex general digraphs D is determined, ρ being called the inducing regulation number of D. For being the maximum among semi-degrees in D, simple n-vertex digraphs D with largest possible ρ are characterized if either or (where the case is not a trivial subcase of ).     

A note on maximality of analytic crossed products

Let G be a compact abelian group with the totally ordered dual group which admits the positive semigroup . Let N be a von Neumann algebra and be an automorphism group of on N. We denote to the analytic crossed product determined by N and α. We show that if is a maximal σ-weakly closed subalgebra of , then induces an archimedean order in .     

On a conjecture of Erd?s, Graham and Spencer, II

It is conjectured by Erd?s, Graham and Spencer that if 1≤a₁≤a₂≤?≤a_s are integers with , then this sum can be decomposed into n parts so that all partial sums are ≤1. This is not true for as shown by a₁=?=a_n−2=1, . In 1997 Sandor proved that Erd?s-Graham-Spencer conjecture is true for . Recently, Chen proved that the conjecture is true for . In this paper, we prove that Erd?s-Graham-Spencer conjecture is true for .     

Monoids with sub-log-exponential free spectra

A classic result from the 1960s states that the asymptotic growth of the free spectrum of a finite group is sub-log-exponential if and only if is nilpotent. Thus a monoid is sub-log-exponential implies , the pseudovariety of semigroups with nilpotent subgroups. Unfortunately, little more is known about the boundary between the sub-log-exponential and log-exponential monoids.The pseudovariety consists of those finite semigroups satisfying (x^ωy^ω)^ω(y^ωx^ω)^ω(x^ωy^ω)^ω≈(x^ωy^ω)^ω. Here it is shown that a monoid is sub-log-exponential implies . A quick application: a regular sub-log-exponential monoid is orthodox. It is conjectured that a finite monoid is sub-log-exponential if and only if it is , the finite monoids in having nilpotent subgroups. The forward direction of the conjecture is proved; moreover, the conjecture is proved for when is completely (0)-simple. In particular, the six-element Brandt monoid (the Perkins semigroup) is sub-log-exponential.