Packing directed cycles efficiently

Let G be a simple digraph. The dicycle packing number of G, denoted ν_c(G), is the maximum size of a set of arc-disjoint directed cycles in G. Let G be a digraph with a nonnegative arc-weight function w. A function ψ from the set C of directed cycles in G to R₊ is a fractional dicycle packing of G if ∑_e∈C∈Cψ(C)?w(e) for each e∈E(G). The fractional dicycle packing number, denoted , is the maximum value of ∑_C∈Cψ(C) taken over all fractional dicycle packings ψ. In case w≡1 we denote the latter parameter by .Our main result is that where n=|V(G)|. Our proof is algorithmic and generates a set of arc-disjoint directed cycles whose size is at least ν_c(G)-o(n²) in randomized polynomial time. Since computing ν_c(G) is an NP-Hard problem, and since almost all digraphs have ν_c(G)=Θ(n²) our result is a FPTAS for computing ν_c(G) for almost all digraphs.The result uses as its main lemma a much more general result. Let F be any fixed family of oriented graphs. For an oriented graph G, let ν_F(G) denote the maximum number of arc-disjoint copies of elements of F that can be found in G, and let denote the fractional relaxation. Then, . This lemma uses the recently discovered directed regularity lemma as its main tool.It is well known that can be computed in polynomial time by considering the dual problem. We present a polynomial algorithm that finds an optimal fractional dicycle packing. Our algorithm consists of a solution to a simple linear program and some minor modifications, and avoids using the ellipsoid method. In fact, the algorithm shows that a maximum fractional dicycle packing with at most O(n²) dicycles receiving nonzero weight can be found in polynomial time.     

The largest eigenvalue of unicyclic graphs

Let G be a simple graph. Let λ₁(G) and μ₁(G) denote the largest eigenvalue of the adjacency matrix and the Laplacian matrix of G, respectively. Let Δ denote the largest vertex degree. If G has just one cycle, then

     

Edges not contained in triangles and the number of contractible edges in a 4-connected graph

Let G be a 4-connected graph, and let E_c(G) denote the set of 4-contractible edges of G and let denote the set of those edges of G which are not contained in a triangle. Under this notation, we show that if , then we have .     

On the minimum real roots of the adjoint polynomial of a graph

For a graph G, we denote by h(G,x) the adjoint polynomial of G. Let β(G) denote the minimum real root of h(G,x). In this paper, we characterize all the connected graphs G with .     

Injective colorings of sparse graphs

Let denote the maximum average degree (over all subgraphs) of G and let χ_i(G) denote the injective chromatic number of G. We prove that if , then χ_i(G)≤Δ(G)+1; and if , then χ_i(G)=Δ(G). Suppose that G is a planar graph with girth g(G) and Δ(G)≥4. We prove that if g(G)≥9, then χ_i(G)≤Δ(G)+1; similarly, if g(G)≥13, then χ_i(G)=Δ(G).     

On the ideal structure of some Banach algebras related to convolution operators on L(G)

Let G be a locally compact group and let p∈(1,∞). Let be any of the Banach spaces C_δ,p(G), PF_p(G), M_p(G), AP_p(G), WAP_p(G), UC_p(G), PM_p(G), of convolution operators on L^p(G). It is shown that PF_p(G)′ can be isometrically embedded into UC_p(G)′. The structure of maximal regular ideals of (and of MA_p(G)″, B_p(G)″, W_p(G)″) is studied. Among other things it is shown that every maximal regular left (right, two sided) ideal in is either dense or is the annihilator of a unique element in the spectrum of A_p(G). Minimal ideals of is also studied. It is shown that a left ideal M in is minimal if and only if , where Ψ is either a right annihilator of or is a topologically x-invariant element (for some x∈G). Some results on minimal right ideals are also given.     

Rieffel deformation of homogeneous spaces

Let G₁⊂G be a closed subgroup of a locally compact group G and let X=G/G₁ be the quotient space of left cosets. Let X=(C₀(X),ΔX) be the corresponding G-C^∗-algebra where G=(C₀(G),Δ). Suppose that Γ is a closed abelian subgroup of G₁ and let Ψ be a 2-cocycle on the dual group . Let GΨ be the Rieffel deformation of G. Using the results of the previous paper of the author we may construct GΨ-C^∗-algebra XΨ - the Rieffel deformation of X. On the other hand we may perform the Rieffel deformation of the subgroup G₁ obtaining the closed quantum subgroup , which in turn, by the results of S. Vaes, leads to the GΨ-C^∗-algebra . In this paper we show that . We also consider the case where Γ⊂G is not a subgroup of G₁, for which we cannot construct the subgroup . Then generically XΨ cannot be identified with a quantum quotient. What may be shown is that it is a GΨ-simple object in the category of GΨ-C^∗-algebras.     

Optimal transport maps for Monge-Kantorovich problem on loop groups

Let G be a compact Lie group, and consider the loop group LeG:={?∈C([0,1],G); ?(0)=?(1)=e}. Let ν be the heat kernel measure at the time 1. For any density function F on LeG such that Entν(F)<∞, we shall prove that there exists a unique optimal transportation map which pushes ν forward to Fν.     

Bandwidth of the strong product of two connected graphs

The bandwidth B(G) of a graph G is the minimum of the quantity max{|f(x)-f(y)|:xy∈E(G)} taken over all proper numberings f of G. The strong product of two graphs G and H, written as G(S_P)H, is the graph with vertex set V(G)×V(H) and with (u₁,v₁) adjacent to (u₂,v₂) if one of the following holds: (a) u₁ and v₁ are adjacent to u₂ and v₂ in G and H, respectively, (b) u₁ is adjacent to u₂ in G and v₁=v₂, or (c) u₁=u₂ and v₁ is adjacent to v₂ in H. In this paper, we investigate the bandwidth of the strong product of two connected graphs. Let G be a connected graph. We denote the diameter of G by D(G). Let d be a positive integer and let x,y be two vertices of G. Let denote the set of vertices v so that the distance between x and v in G is at most d. We define δ_d(G) as the minimum value of over all vertices x of G. Let denote the set of vertices z such that the distance between x and z in G is at most d-1 and z is adjacent to y. We denote the larger of and by . We define η(G)=1 if G is complete and η(G) as the minimum of over all pair of vertices x,y of G otherwise. Let G and H be two connected graphs. Among other results, we prove that if δ_D(H)(G)?B(G)D(H)+1 and B(H)=⌈(|V(H)|+η(H)-2)/D(H)⌉, then B(G(S_P)H)=B(G)|V(H)|+B(H). Moreover, we show that this result determines the bandwidth of the strong product of some classes of graphs. Furthermore, we study the bandwidth of the strong product of power of paths with complete bipartite graphs.     

On a conjecture concerning the orientation number of a graph

For a connected graph G containing no bridges, let D(G) be the family of strong orientations of G; and for any D∈D(G), we denote by d(D) the diameter of D. The orientation number of G is defined by . Let G(p,q;m) denote the family of simple graphs obtained from the disjoint union of two complete graphs K_p and K_q by adding m edges linking them in an arbitrary manner. The study of the orientation numbers of graphs in G(p,q;m) was introduced by Koh and Ng [K.M. Koh, K.L. Ng, The orientation number of two complete graphs with linkages, Discrete Math. 295 (2005) 91-106]. Define and . In this paper we prove a conjecture on α proposed by K.M. Koh and K.L. Ng in the above mentioned paper, for q≥p+4.     

Quantization dimension for condensation systems II: The geometric mean error

Let be a family of similitudes on R¹ satisfying the strong separation condition and ν the self-similar measure associated with and a probability vector (t₁,…,tN). Let μ be the attracting measure of a condensation system associated with ν, and a probability vector (p₀,p₁,…,pN). We establish a relationship between the quantization dimension of μ and its mass distribution on cylinder sets.     

Tensor products of holomorphic representations and bilinear differential operators

Let be the weighted Bergman space on a bounded symmetric domain D=G/K. It has analytic continuation in the weight ν and for ν in the so-called Wallach set still forms unitary irreducible (projective) representations of G. We give the irreducible decomposition of the tensor product of the representations for any two unitary weights ν and we find the highest weight vectors of the irreducible components. We find also certain bilinear differential intertwining operators realizing the decomposition, and they generalize the classical transvectants in invariant theory of . As applications, we find a generalization of the Bol's lemma and we characterize the multiplication operators by the coordinate functions on the quotient space of the tensor product modulo the subspace of functions vanishing of certain degree on the diagonal.     

On conjugate adjacency matrices of a graph

Let G be a simple graph of order n. Let and , where a and b are two nonzero integers and m is a positive integer such that m is not a perfect square. We say that A^c=[c_ij] is the conjugate adjacency matrix of the graph G if c_ij=c for any two adjacent vertices i and j, for any two nonadjacent vertices i and j, and c_ij=0 if i=j. Let P_G(λ)=|λI-A| and denote the characteristic polynomial and the conjugate characteristic polynomial of G, respectively. In this work we show that if then , where denotes the complement of G. In particular, we prove that if and only if P_G(λ)=P_H(λ) and . Further, let P^c(G) be the collection of conjugate characteristic polynomials of vertex-deleted subgraphs G_i=G?i(i=1,2,…,n). If P^c(G)=P^c(H) we prove that , provided that the order of G is greater than 2.     

On the product of two primitive elements of maximal subfields of a finite field

Let denote a finite field with r elements. Let q be a power of a prime, and p₁,p₂, p₃ be distinct primes. Put

     

Packing equal squares into a large square

Let s(x) denote the maximum number of non-overlapping unit squares which can be packed into a large square of side length x. Let W(x)=x²−s(x) denote the “wasted” area, i.e., the area not covered by the unit squares. In this note we prove that

     

The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two

We consider a bipartite distance-regular graph Γ with diameter D?4, valency k?3, intersection numbers b_i,c_i, distance matrices A_i, and eigenvalues θ₀>θ₁>?>θ_D. Let X denote the vertex set of Γ and fix x∈X. Let T=T(x) denote the subalgebra of Mat_X(C) generated by , where A=A₁ and denotes the projection onto the ith subconstituent of Γ with respect to x. T is called the subconstituent algebra (or Terwilliger algebra) of Γ with respect to x. An irreducible T-module W is said to be thin whenever for 0?i?D. By the endpoint of W we mean . Assume W is thin with endpoint 2. Observe is a one-dimensional eigenspace for ; let η denote the corresponding eigenvalue. It is known where , and d=⌊D/2⌋. To describe the structure of W we distinguish four cases: (i) ; (ii) D is odd and ; (iii) D is even and ; (iv) . We investigated cases (i), (ii) in MacLean and Terwilliger [Taut distance-regular graphs and the subconstituent algebra, Discrete Math. 306 (2006) 1694-1721]. Here we investigate cases (iii), (iv) and obtain the following results. We show the dimension of W is D-1-e where e=1 in case (iii) and e=0 in case (iv). Let v denote a nonzero vector in . We show W has a basis , where E_i denotes the primitive idempotent of A associated with θ_i and where the set S is {1,2,…,d-1}∪{d+1,d+2,…,D-1} in case (iii) and {1,2,…,D-1} in case (iv). We show this basis is orthogonal (with respect to the Hermitian dot product) and we compute the square-norm of each basis vector. We show W has a basis , and we find the matrix representing A with respect to this basis. We show this basis is orthogonal and we compute the square-norm of each basis vector. We find the transition matrix relating our two bases for W.     

A comment to: Two classes of edge domination in graphs

Let G be a graph of order n and denote the signed edge domination number of G. In [B. Xu, Two classes of edge domination in graphs, Discrete Appl. Math. 154 (2006) 1541-1546] it was proved that for any graph G of order n, . But the method given in the proof is not correct. In this paper we give an example for which the method of proof given in [1] does not work.