Limq → ∞ \frac{c(G)}{r(G)} for Simple Groups

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. For a given finite group G, let c(G) denote the minimal degree of a faithful representation of G by complex quasi-permutation matrices and let r(G) denote the minimal degree of a faithful rational valued character of G. Also let G denote one of the symbols A_l, B_l, C_l, D_l, E₆, E₇, E₈, G₂, F₄, ²B₂, ²E₄, ²G₂, and ³D₄. Let G(q) denote simple group of type G over GF(q). Let c(q) = c(G(q)) and r(q) = r(G(q)). Then we will show that lim Lim_q = 1.     

On the Steinberg module of Chevalley groups

For a simple Chevalley group G an explicit version of the Solomon-Tits theorem is proved by describing the generators of the kernel of the map Z[G(K)]S_K, where K is any field and where S_K is the Steinberg module of the group G(K). As a corollary it is shown that if is a Euclidean domain whose fraction field is K, then S_K is cyclic as a G() module when G is either a classical group or an exceptional group of type E₆, or E₇.Acknowledgement I would like to thank Matt Emerton, Özlem Imamoglu, Paul Gunnells for several helpful comments.     

Galois Stability, Integrality and Realization Fields for Representations of Finite Abelian Groups

For a given field F of characteristic 0 we consider a normal extension E/F of finite degree d and finite Abelian subgroups GGL _n (E) of a given exponent t. We assume that G is stable under the natural action of the Galois group of E/F and consider the fields E=F(G) that are obtained via adjoining all matrix coefficients of all matrices gG to F. It is proved that under some reasonable restrictions for n, any E can be realized as F(G), while if all coefficients of matrices in G are algebraic integers, there are only finitely many fields E=F(G) for prescribed integers n and t or prescribed n and d.     

A Generalization of Orthogonal Factorizations in Graphs

Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integer-valuated functions defined on V(G) such that g(x) ≤f(x) for all x∈V(G). Then a (g, f)-factor of G is a spanning subgraph H of G such that g(x) ≤d _H (x) ≤f(x) for all x∈V(G). A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let = {F ₁, F ₂, ..., F _m } be a factorization of G and H be a subgraph of G with mr edges. If F _i , 1 ≤i≤m, has exactly r edges in common with H, then is said to be r-orthogonal to H. In this paper it is proved that every (mg + kr, mf−kr)-graph, where m, k and r are positive integers with k < m and g≥r, contains a subgraph R such that R has a (g, f)-factorization which is r-orthogonal to a given subgraph H with kr edges. This research is supported by the National Natural Science Foundation of China (19831080) and RSDP of China     

Balloons,cut‐edges,matchings, and total domination in regular graphs of odd degree

A balloon in a graph G is a maximal 2‐edge‐connected subgraph incident to exactly one cut‐edge of G. Let b(G) be the number of balloons, let c(G) be the number of cut‐edges, and let α′(G) be the maximum size of a matching. Let ${\mathcal{F}}_{{{n}},{{r}}}A balloon in a graph G is a maximal 2‐edge‐connected subgraph incident to exactly one cut‐edge of G. Let b(G) be the number of balloons, let c(G) be the number of cut‐edges, and let α′(G) be the maximum size of a matching. Let ${\mathcal{F}}_{{{n}},{{r}}}$ be the family of connected (2r+1)‐regular graphs with n vertices, and let ${{b}}={{max}}\{{{b}}({{G}}): {{G}}\in {\mathcal{F}}_{{{n}},{{r}}}\}$. For ${{G}}\in{\mathcal{F}}_{{{n}},{{r}}}$, we prove the sharp inequalities c(G)?[r(n?2)?2]/(2r²+2r?1)?1 and α′(G)?n/2?rb/(2r+1). Using b?[(2r?1)n+2]/(4r²+4r?2), we obtain a simple proof of the bound proved by Henning and Yeo. For each of these bounds and each r, the approach using balloons allows us to determine the infinite family where equality holds. For the total domination number γ_t(G) of a cubic graph, we prove γ_t(G)?n/2?b(G)/2 (except that γ_t(G) may be n/2?1 when b(G)=3 and the balloons cover all but one vertex). With α′(G)?n/2?b(G)/3 for cubic graphs, this improves the known inequality γ_t(G)?α′(G). © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 116–131, 2010     

The 2-primary torsion on elliptic curves in the Z p -extensions of Q

Let E be an elliptic curve over Q and p a prime number. Denote by Q_p,∞ the Z_p-extension of Q. In this paper, we show that if p≠3, then where E(Q_p,∞)₍₂₎ is the 2-primary part of the group E(Q_p,∞) of Q_p,∞-rational points on E. More precisely, in case p=2, we completely classify E(Q_2,∞)₍₂₎ in terms of E(Q)₍₂₎; in case p≥5 (or in case p=3 and E(Q)₍₂₎≠{O}), we show that E(Q_p,∞)₍₂₎=E(Q)₍₂₎.     

Isoperimetric inequalities in potential theory

Given a non-empty bounded domainG in ⁿ ,n2, letr ₀(G) denote the radius of the ballG ₀ having center 0 and the same volume asG. The exterior deficiencyd _e (G) is defined byd _e (G)=r _e (G)/r ₀(G)–1 wherer _e (G) denotes the circumradius ofG. Similarlyd _i (G)=1–r _i (G)/r ₀(G) wherer _i (G) is the inradius ofG. Various isoperimetric inequalities for the capacity and the first eigenvalue ofG are shown. The main results are of the form CapG(1+cf(d _e (G)))CapG ₀ and ₁(G)(1+cf(d _i (G)))₁(G ₀),f(t)=t ³ ifn=2,f(t)=t ³/(ln 1/t) ifn=3,f(t)=t ^(n+3)/2 ifn4 (for convex G and small deficiencies ifn3).     

Weighted Davenport’s constant and the weighted EGZ Theorem

Let G^∗,G be finite abelian groups with nontrivial homomorphism group . Let Ψ be a non-empty subset of . Let D_Ψ(G) denote the minimal integer, such that any sequence over G^∗ of length D_Ψ(G) must contain a nontrivial subsequence s₁,…,s_r, such that for some ψ_i∈Ψ. Let E_Ψ(G) denote the minimal integer such that any sequence over G^∗ of length E_Ψ(G) must contain a nontrivial subsequence of length |G|,s₁,…,s_|G|, such that for some ψ_i∈Ψ. In this paper, we show that E_Ψ(G)=|G|+D_Ψ(G)−1.     

Codes for Identification in the King Lattice

Let G=(V, E) be an undirected graph and C a subset of vertices. If the sets B _r (F)C are distinct for all subsets FV with at most k elements, then C is called an (r,k)-identifying code in G. Here B _r (F) denotes the set of all vertices that are within distance r from at least one vertex in F. We consider the two-dimensional square lattice with diagonals (the king lattice). We show that the optimal density of an (r,2)-identifying code is 1/4 for all r3. For r=1,2, we give constructions with densities 3/7 and 3/10, and we prove the lower bounds 9/22 and 31/120, respectively. The research of the authors was supported by the Academy of Finland under grants 44002 and 46186     

Symmetric colorings of the dihedral group

Let G be a finite group and let r∈?. An r-coloring of G is any mapping χ:G→{1,…,r}. Colorings χ and ψ are equivalent if there exists g∈G such that χ(xg^?1) = ψ(x) for every x∈G. A coloring χ is symmetric if there exists g∈G such that χ(gx^?1g) = χ(x) for every x∈G. Let S_r(G) denote the number of symmetric r-colorings of G and s_r(G) the number of equivalence classes of symmetric r-colorings of G. We count S_r(G) and s_r(G) in the case where G is the dihedral group D_n.     

Hyperfinite Dimensional Representations of Spaces and Algebras of Measures

Let X be a locally compact topological space and (X, E, X_ω) be any triple consisting of a hyperfinite set X in a sufficiently saturated nonstandard universe, a monadic equivalence relation E on X, and an E-closed galactic set X_ω ⊆ X, such that all internal subsets of X_ω are relatively compact in the induced topology and X is homeomorphic to the quotient X_ω/E. We will show that each regular complex Borel measure on X can be obtained by pushing down the Loeb measure induced by some internal function . The construction gives rise to an isometric isomorphism of the Banach space M(X) of all regular complex Borel measures on X, normed by total variation, and the quotient , for certain external subspaces of the hyperfinite dimensional Banach space , with the norm ‖f‖₁ = ∑_{x ∈ X} |f(x)|. If additionally X = G is a hyperfinite group, X_ω = G_ω is a galactic subgroup of G, E is the equivalence corresponding to a normal monadic subgroup G₀ of G_ω, and G is isomorphic to the locally compact group G_ω/G₀, then the above Banach space isomorphism preserves the convolution, as well, i.e., M(G) and are isometrically isomorphic as Banach algebras. Research of both authors supported by a grant by VEGA – Scientific Grant Agency of Slovak Republic.     

Some Existence Theorems on All Fractional (<Emphasis Type="Italic">g</Emphasis>, <Emphasis Type="Italic">f</Emphasis>)-factors with Prescribed Properties

Let G be a graph, and g, f: V (G) → Z⁺ with g(x) ≤ f(x) for each x ∈ V (G). We say that G admits all fractional (g, f)-factors if G contains an fractional r-factor for every r: V (G) → Z⁺ with g(x) ≤ r(x) ≤ f(x) for any x ∈ V (G). Let H be a subgraph of G. We say that G has all fractional (g, f)-factors excluding H if for every r: V (G) → Z⁺ with g(x) ≤ r(x) ≤ f(x) for all x ∈ V (G), G has a fractional r-factor F _h such that E(H) ∩ E(F _h ) = θ, where h: E(G) → [0, 1] is a function. In this paper, we show a characterization for the existence of all fractional (g, f)-factors excluding H and obtain two sufficient conditions for a graph to have all fractional (g, f)-factors excluding H.     

Disproof of a Conjecture on the Subdivision Domination Number of a Graph

A set S of vertices of a graph G = (V,E) is a dominating set if every vertex of is adjacent to some vertex in S. The domination number γ(G) is the minimum cardinality of a dominating set of G. The domination subdivision number sd_γ(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the domination number. Haynes et al. (Discussiones Mathematicae Graph Theory 21 (2001) 239-253) conjectured that for any graph G with . In this note we first give a counterexample to this conjecture in general and then we prove it for a particular class of graphs.     

Examples of amalgamated products

The rank of a groupG is the minimal number of elements that generateG. For any natural numbern we construct two groups,G ₁ of rankr(G ₁)=n andG ₂ of rankr(G ₂)=2n such that their amalgamated product over an infinite cyclic subgroup, malnormal in both factors, is generated by 2n=r(G ₁)+r(G ₂)−n elements. We also consider an example of an amalgamated product ofn factors: such thatr(G)=n +1, andr(A)≥1. This example realizes the lower bound given by Weidmann [W1] (see Theorem 2 in the present paper).     

Logarithmic Sobolev Inequalities for Pinned Loop Groups

LetGbe a connected compact type Lie group equipped with anAd_G-invariant inner product on the Lie algebra ofG. Given this data there is a well known left invariant “H¹-Riemannian structure” on =(G)—the infinite dimensional group of continuous based loops inG. Using this Riemannian structure, we define and construct a “heat kernel”ν_T(g₀, ·) associated to the Laplace–Beltrami operator on (G). HereT>0,g₀∈(G), andν_T(g₀,·) is a certain probability measure on (G). For fixedg₀∈(G) andT>0, we use the measureν_T(g₀,·) and the Riemannian structure on (G) to construct a “classical” pre-Dirichlet form. The main theorem of this paper asserts that this pre-Dirichlet form admits a logarithmic Sobolev inequality.     

Regular selections for multiple-valued functions

Given a multiple-valued function f, we deal with the problem of selecting its single-valued branches. This problem can be stated in a rather abstract setting considering a metric space E and a finite group G of isometries of E. Given a function f, which takes values in the equivalence classes of E/G, the problem consists of finding a map g with the same domain as f and taking values in E, such that at every point t the equivalence class of g(t) coincides with f(t).If the domain of f is an interval, we show the existence of a function g with these properties which, moreover, has the same modulus of continuity of f. In the particular case where E is the product of Q copies of ⁿ and G is the group of permutations of Q elements, it is possible to introduce a notion of differentiability for multiple-valued functions. In this case, we prove that the function g can be constructed in such a way to preserve C^k, regularity.Some related problems are also discussed. Mathematics Subject Classification (2000) 54C60     

Euler Tours of Maximum Girth in K2 n +1 and K2 n ,2 n

Given an eulerian graph G and an Euler tour T of G, the girth of T, denoted by g(T), is the minimum integer k such that some segment of k+1 consecutive vertices of T is a cycle of length k in G. Let g^E(G)= maxg(T) where the maximum is taken over all Euler tours of G.We prove that g^E(K_2n,2n)=4n–4 and 2n–3g^E(K_2n+1)2n–1 for any n2. We also show that g^E(K₇)=4. We use these results to prove the following:1)The graph K_2n,2n can be decomposed into edge disjoint paths of length k if and only if k4n–1 and the number of edges in K_2n,2n is divisible by k.2)The graph K_2n+1 can be decomposed into edge disjoint paths of length k if and only if k2n and the number edges in K_2n+1 is divisible by k.     

Turbulence Phenomena in Real Analysis

The purpose of this paper is first to show that if X is any locally compact but not compact perfect Polish space and stands for the one-point compactification of X, while E^X is the equivalence relation which is defined on the Polish group C(X,R₊*) by where f, g are in C(X,R₊*), then E^X is induced by a turbulent Polish group action. Second we show that given any if we identify the n-dimensional unit sphere Sⁿ with the one-point compactification of Rⁿ via the stereographic projection, while E_n,r is the equivalence relation which is defined on the Polish group C^r(Rⁿ,R₊*) by where f, g are in C^r(Rⁿ,R₊*), then E_n,r is also induced by a turbulent Polish group action. Dedicated to my sister Alexandra and to her daughter Marianthi.