Degenerate principal series representations and their holomorphic extensions

Let X=H/L be an irreducible real bounded symmetric domain realized as a real form in an Hermitian symmetric domain D=G/K. The intersection S of the Shilov boundary of D with X defines a distinguished subset of the topological boundary of X and is invariant under H. It can be realized as S=H/P for certain parabolic subgroup P of H. We study the spherical representations of H induced from P. We find formulas for the spherical functions in terms of the Macdonald hypergeometric function. This generalizes the earlier result of Faraut-Koranyi for Hermitian symmetric spaces D. We consider a class of H-invariant integral intertwining operators from the representations on L²(S) to the holomorphic representations of G restricted to H. We construct a new class of complementary series for the groups H=SO(n,m), SU(n,m) (with n−m>2) and Sp(n,m) (with n−m>1). We realize them as discrete components in the branching rule of the analytic continuation of the holomorphic discrete series of G=SU(n,m), SU(n,m)×SU(n,m) and SU(2n,2m) respectively.     

Precise asymptotics in the deviation probability series of self-normalized sums

Let X,X₁,X₂,… be a sequence of nondegenerate i.i.d. random variables with zero means. Set Sn=X₁+?+Xn and . In the present paper we examine the precise asymptotic behavior for the general deviation probabilities of self-normalized sums, Sn/Wn. For positive functions g(x), ?(x), α(x) and κ(x), we obtain the precise asymptotics for the following deviation probabilities of self-normalized sums:

     

On symmetric graphs of valency five

A graph X, with a subgroup G of the automorphism group of X, is said to be (G,s)-transitive, for some s≥1, if G is transitive on s-arcs but not on (s+1)-arcs, and s-transitive if it is -transitive. Let X be a connected (G,s)-transitive graph, and G_v the stabilizer of a vertex v∈V(X) in G. If X has valency 5 and G_v is solvable, Weiss [R.M. Weiss, An application of p-factorization methods to symmetric graphs, Math. Proc. Camb. Phil. Soc. 85 (1979) 43-48] proved that s≤3, and in this paper we prove that G_v is isomorphic to the cyclic group Z₅, the dihedral group D₁₀ or the dihedral group D₂₀ for s=1, the Frobenius group F₂₀ or F₂₀×Z₂ for s=2, or F₂₀×Z₄ for s=3. Furthermore, it is shown that for a connected 1-transitive Cayley graph of valency 5 on a non-abelian simple group G, the automorphism group of is the semidirect product , where R(G) is the right regular representation of G and .     

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.     

A sufficient condition for pancyclability of graphs

Let G be a graph of order n and S be a vertex set of q vertices. We call G,S-pancyclable, if for every integer i with 3≤i≤q there exists a cycle C in G such that |V(C)∩S|=i. For any two nonadjacent vertices u,v of S, we say that u,v are of distance two in S, denoted by d_S(u,v)=2, if there is a path P in G connecting u and v such that |V(P)∩S|≤3. In this paper, we will prove that if G is 2-connected and for all pairs of vertices u,v of S with d_S(u,v)=2, , then there is a cycle in G containing all the vertices of S. Furthermore, if for all pairs of vertices u,v of S with d_S(u,v)=2, , then G is S-pancyclable unless the subgraph induced by S is in a class of special graphs. This generalizes a result of Fan [G. Fan, New sufficient conditions for cycles in graphs, J. Combin. Theory B 37 (1984) 221-227] for the case when S=V(G).     

“Pexiderized” homogeneity almost everywhere

In the paper we examine Pexiderized ?-homogeneity equation almost everywhere. Assume that G and H are groups with zero, (X,G) and (Y,H) are a G- and an H-space, respectively. We prove, under some assumption on (Y,H), that if functions and satisfy Pexiderized ?-homogeneity equation

F₁(αx)=?(α)F₂(x)     

Edge-connectivity and edge-disjoint spanning trees

Given a graph G, for an integer c∈{2,…,|V(G)|}, define λ_c(G)=min{|X|:X⊆E(G),ω(G−X)≥c}. For a graph G and for an integer c=1,2,…,|V(G)|−1, define,

     

Likelihood ratio orderings of spacings of heterogeneous exponential random variables

Let X₁,X₂,…,X_n be independent exponential random variables such that X_i has failure rate λ for i=1,…,p and X_j has failure rate λ^* for j=p+1,…,n, where p≥1 and q=n-p≥1. Denote by D_i:n(p,q)=X_i:n-X_i-1:n the ith spacing of the order statistics , where X_0:n≡0. It is shown that D_i:n(p,q)?_lrD_i+1:n(p,q) for i=1,…,n-1, and that if λ?λ^* then , and for i=1,…,n, where ?_lr denotes the likelihood ratio order. The main results are used to establish the dispersive orderings between spacings.     

Uniform boundary Harnack principle and generalized triangle property

Let D be a bounded open subset in R^d, d?2, and let G denote the Green function for D with respect to (-Δ)^α/2, 0<α?2, α<d. If α<2, assume that D satisfies the interior corkscrew condition; if α=2, i.e., if G is the classical Green function on D, assume—more restrictively—that D is a uniform domain. Let g=G(·,y₀)∧1 for some y₀∈D. Based on the uniform boundary Harnack principle, it is shown that G has the generalized triangle property which states that when d(z,x)?d(z,y). An intermediate step is the approximation G(x,y)≈|x-y|^α-dg(x)g(y)/g(A)², where A is an arbitrary point in a certain set B(x,y).This is discussed in a general setting where D is a dense open subset of a compact metric space satisfying the interior corkscrew condition and G is a quasi-symmetric positive numerical function on D×D which has locally polynomial decay and satisfies Harnack's inequality. Under these assumptions, the uniform boundary Harnack principle, the approximation for G, and the generalized triangle property turn out to be equivalent.     

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.     

Domination with exponential decay

Let G be a graph and S⊆V(G). For each vertex u∈S and for each v∈V(G)−S, we define to be the length of a shortest path in 〈V(G)−(S−{u})〉 if such a path exists, and ∞ otherwise. Let v∈V(G). We define if v⁄∈S, and w_S(v)=2 if v∈S. If, for each v∈V(G), we have w_S(v)≥1, then S is an exponential dominating set. The smallest cardinality of an exponential dominating set is the exponential domination number, γ_e(G). In this paper, we prove: (i) that if G is a connected graph of diameter d, then γ_e(G)≥(d+2)/4, and, (ii) that if G is a connected graph of order n, then .     

Galois number fields with small root discriminant

We pose the problem of identifying the set K(G,Ω) of Galois number fields with given Galois group G and root discriminant less than the Serre constant Ω≈44.7632. We definitively treat the cases G=A₄, A₅, A₆ and S₄, S₅, S₆, finding exactly 59, 78, 5 and 527, 192, 13 fields, respectively. We present other fields with Galois group SL₃(2), A₇, S₇, PGL₂(7), SL₂(8), ΣL₂(8), PGL₂(9), PΓL₂(9), PSL₂(11), and , and root discriminant less than Ω. We conjecture that for all but finitely many groups G, the set K(G,Ω) is empty.     

The upper connected geodetic number and forcing connected geodetic number of a graph

For a connected graph G of order p≥2, a set S⊆V(G) is a geodetic set of G if each vertex v∈V(G) lies on an x-y geodesic for some elements x and y in S. The minimum cardinality of a geodetic set of G is defined as the geodetic number of G, denoted by g(G). A geodetic set of cardinality g(G) is called a g-set of G. A connected geodetic set of G is a geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected geodetic set of G is the connected geodetic number of G and is denoted by g_c(G). A connected geodetic set of cardinality g_c(G) is called a g_c-set of G. A connected geodetic set S in a connected graph G is called a minimal connected geodetic set if no proper subset of S is a connected geodetic set of G. The upper connected geodetic number is the maximum cardinality of a minimal connected geodetic set of G. We determine bounds for and determine the same for some special classes of graphs. For positive integers r,d and n≥d+1 with r≤d≤2r, there exists a connected graph G with , and . Also, for any positive integers 2≤a<b≤c, there exists a connected graph G such that g(G)=a, g_c(G)=b and . A subset T of a g_c-set S is called a forcing subset for S if S is the unique g_c-set containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing connected geodetic number of S, denoted by f_c(S), is the cardinality of a minimum forcing subset of S. The forcing connected geodetic number of G, denoted by f_c(G), is f_c(G)=min{f_c(S)}, where the minimum is taken over all g_c-sets S in G. It is shown that for every pair a,b of integers with 0≤a≤b−4, there exists a connected graph G such that f_c(G)=a and g_c(G)=b.     

Classification of systems of Dyson-Schwinger equations in the Hopf algebra of decorated rooted trees

We consider systems of combinatorial Dyson-Schwinger equations (briefly, SDSE) , … , in the Connes-Kreimer Hopf algebra HI of rooted trees decorated by I={1,…,N}, where is the operator of grafting on a root decorated by i, and F₁,…,FN are non-constant formal series. The unique solution X=(X₁,…,XN) of this equation generates a graded subalgebra H(S) of HI. We characterise here all the families of formal series (F₁,…,FN) such that H(S) is a Hopf subalgebra. More precisely, we define three operations on SDSE (change of variables, dilatation and extension) and give two families of SDSE (cyclic and fundamental systems), and prove that any SDSE (S) such that H(S) is Hopf is the concatenation of several fundamental or cyclic systems after the application of a change of variables, a dilatation and iterated extensions.     

Spaces of maps into topological group with the Whitney topology

Let X be a locally compact Polish space and G a non-discrete Polish ANR group. By C(X,G), we denote the topological group of all continuous maps endowed with the Whitney (graph) topology and by Cc(X,G) the subgroup consisting of all maps with compact support. It is known that if X is compact and non-discrete then the space C(X,G) is an l₂-manifold. In this article we show that if X is non-compact and not end-discrete then Cc(X,G) is an (R^∞×l₂)-manifold, and moreover the pair (C(X,G),Cc(X,G)) is locally homeomorphic to the pair of the box and the small box powers of l₂.     

Roman domination in regular graphs

A Roman domination function on a graph G=(V(G),E(G)) is a function f:V(G)→{0,1,2} satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. The weight of a Roman dominating function is the value f(V(G))=∑_u∈V(G)f(u). The minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G. Cockayne et al. [E. J. Cockayne et al. Roman domination in graphs, Discrete Mathematics 278 (2004) 11-22] showed that γ(G)≤γ_R(G)≤2γ(G) and defined a graph G to be Roman if γ_R(G)=2γ(G). In this article, the authors gave several classes of Roman graphs: P_3k,P_3k+2,C_3k,C_3k+2 for k≥1, K_m,n for min{m,n}≠2, and any graph G with γ(G)=1; In this paper, we research on regular Roman graphs and prove that: (1) the circulant graphs and , n⁄≡1 (mod (2k+1)), (n≠2k) are Roman graphs, (2) the generalized Petersen graphs P(n,2k+1)( (mod 4) and ), P(n,1) (n⁄≡2 (mod 4)), P(n,3) ( (mod 4)) and P(11,3) are Roman graphs, and (3) the Cartesian product graphs are Roman graphs.     

Harmonic measures for a point may form a square

Let X be a Green domain in Rd, d?2, x∈X, and let Mx(P(X)) denote the compact convex set of all representing measures for x. Recently it has been proven that the set of harmonic measures , U open in X, x∈U, which is contained in the set of extreme points of Mx(P(X)), is dense in Mx(P(X)). In this paper, it is shown that Mx(P(X)) is not a simplex (and hence not a Poulsen simplex). This is achieved by constructing open neighborhoods U₀, U₁, U₂, U₃ of x such that the harmonic measures are pairwise different and . In fact, these measures form a square with respect to a natural L²-structure. Since the construction is mainly based on having certain symmetries, it can be carried out just as well for Riesz potentials, the Heisenberg group (or any stratified Lie algebra), and the heat equation (or more general parabolic situations).     

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.