The Fractional Chromatic Number Of The Categorical Product Of Graphs

We prove that the identity

The density of rational points on non-singular hypersurfaces

LetF(x) =F[x₁,…,x_n]∈ℤ[x₁,…,x_n] be a non-singular form of degree d≥2, and letN(F, X)=#{xεℤ ⁿ ;F(x)=0, |x|⩽X}, where . It was shown by Fujiwara [4] [Upper bounds for the number of lattice points on hypersurfaces,Number theory and combinatorics, Japan, 1984, (World Scientific Publishing Co., Singapore, 1985)] thatN(F, X)≪X ^n−2+2/n for any fixed formF. It is shown here that the exponent may be reduced ton - 2 + 2/(n + 1), forn ≥ 4, and ton - 3 + 15/(n + 5) forn ≥ 8 andd ≥ 3. It is conjectured that the exponentn - 2 + ε is admissable as soon asn ≥ 3. Thus the conjecture is established forn ≥ 10. The proof uses Deligne’s bounds for exponential sums and for the number of points on hypersurfaces over finite fields. However a composite modulus is used so that one can apply the ‘q-analogue’ of van der Corput’s AB process. Dedicated to the memory of Professor K G Ramanathan     

On the local Artin conductor f<Subscript>Artin</Subscript> (Χ) of a character Χ of Gal(E/K) — II: Main results for the metabelian case

This paper which is a continuation of [2], is essentially expository in nature, although some new results are presented. LetK be a local field with finite residue class fieldK _k. We first define (cf. Definition 2.4) the conductorf(E/K) of an arbitrary finite Galois extensionE/K in the sense of non-abelian local class field theory as wheren _G is the break in the upper ramification filtration ofG = Gal(E/K) defined by . Next, we study the basic properties of the idealf(E/K) inO _k in caseE/K is a metabelian extension utilizing Koch-de Shalit metabelian local class field theory (cf. [8]). After reviewing the Artin charactera _G : G → ℂ ofG := Gal(E/K) and Artin representationsA _g G → G →GL(V) corresponding toa _G : G → ℂ, we prove that (Proposition 3.2 and Corollary 3.5) where Χ_gr : G → ℂ is the character associated to an irreducible representation ρ: G → GL(V) ofG (over ℂ). The first main result (Theorem 1.2) of the paper states that, if in particular,ρ : G → GL(V) is an irreducible representation ofG(over ℂ) with metabelian image, then where Gal(E^ker(ρ)/E^ker(ρ)•) is any maximal abelian normal subgroup of Gal(E^ker(ρ)/K) containing Gal(E^ker(ρ) /K)′, and the break n_G/ker(ρ) in the upper ramification filtration of G/ker(ρ) can be computed and located by metabelian local class field theory. The proof utilizes Basmaji’s theory on the structure of irreducible faithful representations of finite metabelian groups (cf. [1]) and on metabelian local class field theory (cf. [8]). We then discuss the application of Theorem 1.2 on a problem posed by Weil on the construction of a ‘natural’A _G ofG over ℂ (Problem 1.3). More precisely, we prove in Theorem 1.4 that ifE/K is a metabelian extension with Galois group G, then Kazim İlhan ikeda whereN runs over all normal subgroups of G, and for such anN, V _n denotes the collection of all ∼-equivalence classes [ω]∼, where ‘∼’ denotes the equivalence relation on the set of all representations ω : (G/N)^• → ℂ^Χ satisfying the conditions Inert(ω) = {δ ∈ G/N : ℂ_δ} = ω =(G/N) and where δ runs over R((G/N)^•/(G/N)), a fixed given complete system of representatives of (G/N)^•/(G/N), by declaring that ω₁ ∼ ω₂ if and only if ω₁ = ω _2,δ for some δ ∈ R((G/N)^•/(G/N)). Finally, we conclude our paper with certain remarks on Problem 1.1 and Problem 1.3.     

Finite phase transitions in countable abelian groups

Let A be an infinite set that generates a group G. The sphere S _A (r) is the set of elements of G for which the word length with respect to A is exactly r. We say G admits all finite transitions if for every r ≥ 2 and every finite symmetric subset W ì G\{e}{W \subset G{\setminus}\{e\}}, there exists an A with S _A (r) = W. In this paper we determine which countable abelian groups admit all finite transitions. We also show that \mathbbRⁿ{\mathbb{R}^n} and the finitary symmetric group on \mathbbN{\mathbb{N}} admit all finite transitions.     

Connected Domination Number of a Graph and its Complement

A set S of vertices in a graph G is a connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by S is connected. The connected domination number γ _c (G) is the minimum size of such a set. Let d^*(G)=min{d(G),d([`(G)])}{\delta^*(G)={\rm min}\{\delta(G),\delta({\overline{G}})\}} , where [`(G)]{{\overline{G}}} is the complement of G and δ(G) is the minimum vertex degree. We prove that when G and [`(G)]{{\overline{G}}} are both connected, g<sub>c</sub>(G)+g<sub>c</sub>([`(G)]) ￡ d^*(G)+4-(g_c(G)-3)(g_c([`(G)])-3){{\gamma_c}(G)+{\gamma_c}({\overline{G}})\le \delta^*(G)+4-({\gamma_c}(G)-3)({\gamma_c}({\overline{G}})-3)} . As a corollary, g<sub>c</sub>(G)+g<sub>c</sub>([`(G)]) ￡ \frac3n4{{\gamma_c}(G)+{\gamma_c}({\overline{G}})\le \frac{3n}{4}} when δ*(G) ≥ 3 and n ≥ 14, where G has n vertices. We also prove that g_c(G)+g_c([`(G)]) ￡ d<sup>*</sup>(G)+2{{\gamma_c}(G)+{\gamma_c}({\overline{G}})\le \delta^*(G)+2} when g<sub>c</sub>(G),g<sub>c</sub>([`(G)]) 3 4{{\gamma_c}(G),{\gamma_c}({\overline{G}})\ge 4} . This bound is sharp when δ*(G) = 6, and equality can only hold when δ*(G) = 6. Finally, we prove that g_c(G)g_c([`(G)]) ￡ 2n-4{{\gamma_c}(G){\gamma_c}({\overline{G}})\le 2n-4} when n ≥ 7, with equality only for paths and cycles.     

On Optimal Orientations of Cartesian Products of Trees

. Let d(D) (resp., d(G)) denote the diameter and r(D) (resp., r(G)) the radius of a digraph D (resp., graph G). Let G×H denote the cartesian product of two graphs G and H. An orientation D of G is said to be (r, d)-invariant if r(D)=r(G) and d(D)=d(G). Let {T _i }, i=1,…,n, where n≥2, be a family of trees. In this paper, we show that the graph ∏ _{i =1} ⁿ T _i admits an (r, d)-invariant orientation provided that d(T ₁)≥d(T ₂)≥4 for n=2, and d(T ₁)≥5 and d(T ₂)≥4 for n≥3. Received: July 30, 1997 Final version received: April 20, 1998     

A Note About Critical Percolation on Finite Graphs

In this note we study the geometry of the largest component C₁\mathcal {C}_{1} of critical percolation on a finite graph G which satisfies the finite triangle condition, defined by Borgs et al. (Random Struct. Algorithms 27:137–184, 2005). There it is shown that this component is of size n ^2/3, and here we show that its diameter is n ^1/3 and that the simple random walk takes n steps to mix on it. By Borgs et al. (Ann. Probab. 33:1886–1944, 2005), our results apply to critical percolation on several high-dimensional finite graphs such as the finite torus \mathbbZ_n^d\mathbb{Z}_{n}^{d} (with d large and n→∞) and the Hamming cube {0,1} ⁿ .     

Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph

Let G be a graph with n vertices, m edges and a vertex degree sequence (d ₁, d ₂,..., d _n ), where d ₁ ≥ d ₂ ≥ ... ≥ d _n . The spectral radius and the largest Laplacian eigenvalue are denoted by ϱ(G) and μ(G), respectively. We determine the graphs with

Traversing a Set of Points with a Minimum Number of Turns

Given a finite set of points S in ℝ ^d , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the minimum number of segments (links). We call this minimization problem the minimum link spanning path problem. This natural problem has appeared several times in the literature under different variants. The simplest one is that in which the allowed paths are axis-aligned. Let L(S) be the minimum number of links of an axis-aligned path for S, and let G _n ^d be an n×…×n grid in ℤ ^d . Kranakis et al. (Ars Comb. 38:177–192, 1994) showed that L(G _n ²)=2n−1 and and conjectured that, for all d≥3, We prove the conjecture for d=3 by showing the lower bound for L(G _n ³). For d=4, we prove that For general d, we give new estimates on L(G _n ^d ) that are very close to the conjectured value. The new lower bound of improves previous result by Collins and Moret (Inf. Process. Lett. 68:317–319, 1998), while the new upper bound of differs from the conjectured value only in the lower order terms. For arbitrary point sets, we include an exact bound on the minimum number of links needed in an axis-aligned path traversing any planar n-point set. We obtain similar tight estimates (within 1) in any number of dimensions d. For the general problem of traversing an arbitrary set of points in ℝ ^d with an axis-aligned spanning path having a minimum number of links, we present a constant ratio (depending on the dimension d) approximation algorithm. Work by A. Dumitrescu was partially supported by NSF CAREER grant CCF-0444188. Work by F. Hurtado was partially supported by projects MECMTM2006-01267 and Gen. Cat. 2005SGR00692. Work by P. Valtr was partially supported by the project 1M0545 of the Ministry of Education of the Czech Republic.     

Domination numbers of undirected toroidal mesh

The (d, m)-domination number γd,m is a new measure to characterize the reliability of resources-sharing in fault tolerant networks, in some sense, which can more accurately characterize the reliability of networks than the m-diameter does. In this paper, we study the (d, 4)-domination numbers of undirected toroidal mesh Cd1 × Cd2 for some special values of d, obtain that γd,4 (Cd1 × C3) = 2 if and only if d4(G) e1 ≤ d d4(G) for d1 ≥ 5, γd,4 (Cd1 × C4) = 2 if d4(G) (2e1-[d1+e1]/2) ≤ d d4(G) for d1 ≥ 24, and γd,4 (Cd1 × Cd2 ) = 2 if d4(G) ( e1-2) ≤ d d4(G) for d1 = d2 ≥ 14.     

Large deviation results for generalized compound negative binomial risk models

In this paper we extend and improve some results of the large deviation for random sums of random variables. Let {Xn;n 〉 1} be a sequence of non-negative, independent and identically distributed random variables with common heavy-tailed distribution function F and finite mean μ ∈R^＋, {N（n）; n ≥0} be a sequence of negative binomial distributed random variables with a parameter p C （0, 1）, n ≥ 0, let {M（n）; n ≥ 0} be a Poisson process with intensity λ 〉 0. Suppose {N（n）; n ≥ 0}, {Xn; n≥1} and {M（n）; n ≥ 0} are mutually independent. Write S（n） =N（n）∑i=1 Xi-cM（n）.Under the assumption F ∈ C, we prove some large deviation results. These results can be applied to certain problems in insurance and finance.     

Lifts, Discrepancy and Nearly Optimal Spectral Gap*

We present a new explicit construction for expander graphs with nearly optimal spectral gap. The construction is based on a series of 2-lift operations. Let G be a graph on n vertices. A 2-lift of G is a graph H on 2n vertices, with a covering map π :H →G. It is not hard to see that all eigenvalues of G are also eigenvalues of H. In addition, H has n “new” eigenvalues. We conjecture that every d-regular graph has a 2-lift such that all new eigenvalues are in the range (if true, this is tight, e.g. by the Alon–Boppana bound). Here we show that every graph of maximal degree d has a 2-lift such that all “new” eigenvalues are in the range for some constant c. This leads to a deterministic polynomial time algorithm for constructing arbitrarily large d-regular graphs, with second eigenvalue . The proof uses the following lemma (Lemma 3.3): Let A be a real symmetric matrix with zeros on the diagonal. Let d be such that the l₁ norm of each row in A is at most d. Suppose that for every x,y ∈{0,1}ⁿ with ‹x,y›=0. Then the spectral radius of A is O(α(log(d/α)+1)). An interesting consequence of this lemma is a converse to the Expander Mixing Lemma. * This research is supported by the Israeli Ministry of Science and the Israel Science Foundation.     

On the chromatic number of random geometric graphs

Given independent random points X ₁,...,X _n ∈ℝ ^d with common probability distribution ν, and a positive distance r=r(n)>0, we construct a random geometric graph G _n with vertex set {1,..., n} where distinct i and j are adjacent when ‖X _i −X _j ‖≤r. Here ‖·‖ may be any norm on ℝ ^d , and ν may be any probability distribution on ℝ ^d with a bounded density function. We consider the chromatic number χ(G _n ) of G _n and its relation to the clique number ω(G _n ) as n→∞. Both McDiarmid [11] and Penrose [15] considered the range of r when $r \ll \left( {\tfrac{{\ln n}} {n}} \right)^{1/d}$r \ll \left( {\tfrac{{\ln n}} {n}} \right)^{1/d} and the range when $r \gg \left( {\tfrac{{\ln n}} {n}} \right)^{1/d}$r \gg \left( {\tfrac{{\ln n}} {n}} \right)^{1/d}, and their results showed a dramatic difference between these two cases. Here we sharpen and extend the earlier results, and in particular we consider the ‘phase change’ range when $r \sim \left( {\tfrac{{t\ln n}} {n}} \right)^{1/d}$r \sim \left( {\tfrac{{t\ln n}} {n}} \right)^{1/d} with t>0 a fixed constant. Both [11] and [15] asked for the behaviour of the chromatic number in this range. We determine constants c(t) such that $\tfrac{{\chi (G_n )}} {{nr^d }} \to c(t)$\tfrac{{\chi (G_n )}} {{nr^d }} \to c(t) almost surely. Further, we find a “sharp threshold” (except for less interesting choices of the norm when the unit ball tiles d-space): there is a constant t ₀>0 such that if t≤t ₀ then $\tfrac{{\chi (G_n )}} {{\omega (G_n )}}$\tfrac{{\chi (G_n )}} {{\omega (G_n )}} tends to 1 almost surely, but if t>t ₀ then $\tfrac{{\chi (G_n )}} {{\omega (G_n )}}$\tfrac{{\chi (G_n )}} {{\omega (G_n )}} tends to a limit >1 almost surely.     

An extension of almost sure central limit theorem for order statistics

Let {X _n ,n ≥ 1} be a sequence of i.i.d. random variables. Let M _n and m _n denote the first and the second largest maxima. Assume that there are normalizing sequences a _n  > 0, b _n and a nondegenerate limit distribution G, such that . Assume also that {d _k ,k ≥ 1} are positive weights obeying some mild conditions. Then for x > y we have

One-Sided Ideal Growth of Free Associative Algebras

Let R be a finitely generated associative algebra with unity over a finite field \Bbb F_q{\Bbb F}_q . Denote by a _n (R) the number of left ideals J ⊂ R such that dim R/J = n for all n ≥ 1. We explicitly compute and find asymptotics of the left ideal growth for the free associative algebra A _d of rank d with unity over \Bbb F_q{\Bbb F}_q , where d ≥ 1. This function yields a bound a _n (R) ≤ a _n (A _d ), n ? \Bbb Nn\in{\Bbb N} , where R is an arbitrary algebra generated by d elements. Denote by m _n (R) the number of maximal left ideals J ⊂ R such that dim R/J = n, for n ≥ 1. Let d ≥ 2, we prove that m _n (A _d ) ≈ a _n (A _d ) as n → ∞.     

Regular Polytopes of Nearly Full Rank

An abstract regular polytope P\mathcal{P} of rank n can only be realized faithfully in Euclidean space \mathbbE^d\mathbb{E}^{d} of dimension d if d≥n when P\mathcal{P} is finite, or d≥n−1 when P\mathcal{P} is infinite (that is, P\mathcal{P} is an apeirotope). In case of equality, the realization P of P\mathcal{P} is said to be of full rank. If there is a faithful realization P of P\mathcal{P} of dimension d=n+1 or d=n (as P\mathcal {P} is finite or not), then P is said to be of nearly full rank. In previous papers, all the at most four-dimensional regular polytopes and apeirotopes of nearly full rank have been classified. This paper classifies the regular polytopes and apeirotopes of nearly full rank in all higher dimensions.     

A variant of Davenport’s constant

Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of ]n[≔ {1, 2,…, n} such that elements of A are incongruent modulo p and non-zero modulo p. Let k ≥ D(G/|A| be any integer where D(G) denotes the well-known Davenport’s constant. In this article, we prove that for any sequence g ₁, g ₂,…, g _k (not necessarily distinct) in G, one can always extract a subsequence with 1 ≤ ℓ ≤ k such that

Pan-H-Linked Graphs

Let H be a multigraph, possibly containing loops. An H-subdivision is any simple graph obtained by replacing the edges of H with paths of arbitrary length. Let H be an arbitrary multigraph of order k, size m, n ₀(H) isolated vertices and n ₁(H) vertices of degree one. In Gould and Whalen (Graphs Comb. 23:165–182, 2007) it was shown that if G is a simple graph of order n containing an H-subdivision H{\mathcal{H}} and d(G) 3 \fracn+m-k+n₁(H)+2n₀(H)2{\delta(G) \ge \frac{n+m-k+n_1(H)+2n_0(H)}{2}}, then G contains a spanning H-subdivision with the same ground set as H{\mathcal{H}} . As a corollary to this result, the authors were able to obtain Dirac’s famed theorem on hamiltonian graphs; namely that if G is a graph of order n ≥ 3 with d(G) 3 \fracn2{\delta(G)\ge\frac{n}{2}} , then G is hamiltonian. Bondy (J. Comb. Theory Ser. B 11:80–84, 1971) extended Dirac’s theorem by showing that if G satisfied the condition d(G) 3 \fracn2{\delta(G) \ge \frac{n}{2}} then G was either pancyclic or a complete bipartite graph. In this paper, we extend the result from Gould and Whalen (Graphs Comb. 23:165–182, 2007) in a similar manner. An H-subdivision H{\mathcal{H}} in G is 1-extendible if there exists an H-subdivision H^*{\mathcal{H}^{*}} with the same ground set as H{\mathcal{H}} and |H^*| = |H| + 1{|\mathcal{H}^{*}| = |\mathcal{H}| + 1} . If every H-subdivision in G is 1-extendible, then G is pan-H-linked. We demonstrate that if H is sufficiently dense and G is a graph of large enough order n such that d(G) 3 \fracn+m-k+n₁(H)+2n₀(H)2{\delta(G) \ge \frac{n+m-k+n_1(H)+2n_0(H)}{2}} , then G is pan-H-linked. This result is sharp.