Symmetric powers of modular representations,hilbert series and degree bounds

Let G = Z _p be a cyclic group of prime order p with a representation G → GL(V) over a field K of characteristic p. In 1976, Almkvist and Fossum gave formulas for the decomposition of the symmetric powers of V in the case that V is indecomposable. From these they derived formulas for the Hilbert series of the invariant ring K[V]^G. Following Almkvist and Fossum in broad outline, we start by giving a shorter, self-contained proof of their results. We extend their work to modules which are not necessarily indecomposable. We also obtain formulas which give generating functions encoding the decompositions of all symmetric powers of V into indecomposables. Our results generalize to groups of the type Z _p ×H with |H| coprime to p. Moreover, we prove that for any finite group G whose order is divisible by p but not by p ² the invariant ring A,K[V]G is generated by homogeneous invariants of degrees at most dim (V).(|G| – 1).     

Invariants for group algebras of Abelian groups

LetF be a field of characteristicp>0 and letG be an arbitrary abelian group written multiplicatively withp-basis subgroup denoted byB. The first main result of the present paper is thatB is an isomorphism invariant of theF-group algebraFG. In particular, thep-local algebraically compact groupG can be retrieved fromFG. Moreover, for the lower basis subgroupB ₁ of thep-componentG _p it is shown thatG _p/B_l is determined byFG. Besides, ifH is (p-)high inG, thenG _p/H_p andH ^{p n}[p] for ℕ₀ are structure invariants forFG, andH[p] as a valued vector space is a structural invariant forN ₀ G, whereN _p is the simple field ofp-elements. Next, presume thatG isp-mixed with maximal divisible subgroupD. ThenD andF(G/D) are functional invariants forFG. The final major result is that the relative Ulm-Kaplansky-Mackeyp-invariants ofG with respect to the subgroupC are isomorphic invariants of the pair (FG, FC) ofF-algebras. These facts generalize and extend analogous in this aspect results due to May (1969), Berman-Mollov (1969) and Beers-Richman-Walker (1983). As a finish, some other invariants for commutative group algebras are obtained.     

Pseudodifferential Operators on Prehomogeneous Vector Spaces

ABSTRACT

Let G be a connected, linear algebraic group defined over ?, acting regularly on a finite dimensional vector space V over ? with ?-structure V _?. Assume that V possesses a Zariski-dense orbit, so that (G, ?, V) becomes a prehomogeneous vector space over ?. We consider the left regular representation π of the group of ?-rational points G _? on the Banach space C₀(V _?) of continuous functions on V _? vanishing at infinity, and study the convolution operators π(f), where f is a rapidly decreasing function on the identity component of G _?. Denote the complement of the dense orbit by S, and put S _? = S ∩ V _?. It turns out that, on V _? ? S _?, π(f) is a smooth operator. If S _? = {0}, the restriction of the Schwartz kernel of π(f) to the diagonal defines a homogeneous distribution on V _? ? {0}. Its nonunique extension to V _? can then be regarded as a trace of π(f). If G is reductive, and S and S _? are irreducible hypersurfaces, π(f) corresponds, on each connected component of V _? ? S _?, to a totally characteristic pseudodifferential operator. In this case, the restriction of the Schwartz kernel of π(f) to the diagonal defines a distribution on V _? ? S _? given by some power |p(m)| ^s of a relative invariant p(m) of (G, ?, V) and, as a consequence of the Fundamental Theorem of Prehomogeneous Vector Spaces, its extension to V _?, and the complex s-plane, satisfies functional equations similar to those for local zeta functions. A trace of π(f) can then be defined by subtracting the singular contributions of the poles of the meromorphic extension.     

Isomorphisms ofp-adic group rings

SupposeP is the ring ofp-adic integers,G is a finite group of orderp ⁿ , andPG is the group ring ofG overP. IfV _p (G) denotes the elements ofPG with coefficient sum one which are of order a power ofp, it is shown that the elements of any subgroupH ofV _p (G) are linearly independent overP, and if in additionH is of orderp ⁿ , thenPGPH. As a consequence, the lattice of normal subgroups ofG and the abelianization of the normal subgroups ofG are determined byPG.     

The circular dimension of a graph

A graph is a pair (V, I), V being the vertices and I being the relation of adjacency on V. Given a graph G, then a collection of functions {f_i}^m_n=1, each f_i mapping each vertex of V into anarc on a fixed circle, is said to define an m-arc intersection model for G if for all x,y ? V, xly ? (∨_i?m)(f_i(x)∩f_i(y)≠Ø). The circular dimension of a graph G is defined as the smallest integer m such that G has an m-arc intersection model. In this paper we establish that the maximum circular dimension of any complete partite graph having n vertices is the largest integer p such that 2^p+p?n+1.     

The vertex-cover polynomial of a graph

In this paper we define the vertex-cover polynomial Ψ(G,τ) for a graph G. The coefficient of τ^r in this polynomial is the number of vertex covers V′ of G with |V′|=r. We develop a method to calculate Ψ(G,τ). Motivated by a problem in biological systematics, we also consider the mappings f from {1, 2,…,m} into the vertex set V(G) of a graph G, subject to f⁻¹(x)f⁻¹(y)≠ for every edge xy in G. Let F(G,m) be the number of such mappings f. We show that F(G,m) can be determined from Ψ(G,τ).     

On a class of transitive permutation groups of prime degreep=4n+1

SupposeG is a nonsolvable transitive permutation group of prime degreep, such that |N _G v(P)|=p(p−1) for some Sylowp-subgroupP ofG. Letq be a generator of the subgroup ofN _G (P), fixing one letter (it is easy to show that this subgroup is cyclic). Assume thatG contains an elementj such thatj ⁻¹ qj=q ^(p+1)/2. We shall prove that for almost all primesp of the formp=4n+1, a group that satisfies the above conditions must be the symmetric group on a set withp elements.     

The profile of the Cartesian product of graphs

Given a graph G, a proper labelingf of G is a one-to-one function from V(G) onto {1,2,…,|V(G)|}. For a proper labeling f of G, the profile widthw_f(v) of a vertex v is the minimum value of f(v)−f(x), where x belongs to the closed neighborhood of v. The profile of a proper labelingfofG, denoted by P_f(G), is the sum of all the w_f(v), where v∈V(G). The profile ofG is the minimum value of P_f(G), where f runs over all proper labeling of G. In this paper, we show that if the vertices of a graph G can be ordered to satisfy a special neighborhood property, then so can the graph G×Q_n. This can be used to determine the profile of Q_n and K_m×Q_n.     

Sum List Coloring Graphs

Let G=(V,E) be a graph with n vertices and e edges. The sum choice number of G is the smallest integer p such that there exist list sizes (f(v):v ∈ V) whose sum is p for which G has a proper coloring no matter which color lists of size f(v) are assigned to the vertices v. The sum choice number is bounded above by n+e. If the sum choice number of G equals n+e, then G is sum choice greedy. Complete graphs K_n are sum choice greedy as are trees. Based on a simple, but powerful, lemma we show that a graph each of whose blocks is sum choice greedy is also sum choice greedy. We also determine the sum choice number of K_2,n, and we show that every tree on n vertices can be obtained from K_n by consecutively deleting single edges where all intermediate graphs are sc-greedy.     

Iwasawa invariants of imaginary quadratic fields

LetK be an imaginary quadratic field andp an odd prime which splits inK. We study the Iwasawa invariants for ℤ _p -extensions ofK. This is motivated in part by a recent result of Sands. The main result is the following. Assumep does not divide the class number ofK. LetK _∞ be a ℤ _p -extension ofK. SupposeK _∞ is not totally ramified at the primes abovep. Then the μ-invariant forK _∞/K vanishes. We also show that if μ=0 for all ℤ _p -extensions ofK, then the λ-invariant is bounded asK _∞ runs through all such extensions.     

Unitary units in modular group algebras

Letp be a prime,K a field of characteristicp, G a locally finitep-group,KG the group algebra, andV the group of the units ofKG with augmentation 1. The anti-automorphismg→g ⁻¹ ofG extends linearly toKG; this extension leavesV setwise invariant, and its restriction toV followed byv→v ⁻¹ gives an automorphism ofV. The elements ofV fixed by this automorphism are calledunitary; they form a subgroup. Our first theorem describes theK andG for which this subgroup is normal inV. For each elementg inG, let denote the sum (inKG) of the distinct powers ofg. The elements 1+(g-1) withh,hεG are thebicyclic units ofKG. Our second theorem describes theK andG for which all bicyclic units are unitary. Research partly supported by the Hungarian National Foundation for Scientific Research grant no. T4265. The second author is indebted to the ‘Universitas’ Foundation and the Lajos Kossuth University of Debrecen, Hungary, for warm hospitality and generous support during the period when this work began. This article was processed by the authors using the Springer-Verlag T_EX mamath macro package 1990.     

On the index of approximating sets of periodic points

Summary LetK be a compact space andf:K→K a continuous map without fixed points, i.e. Fixf=⊘. For prime numbersp, the sets Fixf ^p are freeℤ/p-spaces with theℤ/p-action induced byf. Our aim is to estimate the topological indicesi(F _p,f) of invariant subsetsF _p⊂Fixf ^p approximating a givenS⊂K. We construct an example (K,f,S) withS⊂Fixf ^q (q being some prime number) such that, for each neighborhoodU ofS, i (Fix (f|u) ^p, f) increases linearly withp. This article was processed by the author using the L^AT_EX style filecljour1 from Springer-Verlag.     

K4−‐factor in a graph

Let G be a graph of order 4k and let δ(G) denote the minimum degree of G. Let F be a given connected graph. Suppose that |V(G)| is a multiple of |V(F)|. A spanning subgraph of G is called an F‐factor if its components are all isomorphic to F. In this paper, we prove that if δ(G)≥5/2k, then G contains a K₄^?‐factor (K₄^? is the graph obtained from K₄ by deleting just one edge). The condition on the minimum degree is best possible in a sense. In addition, the proof can be made algorithmic. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 111–128, 2002     

On the full automorphism group of a graph

While it is easy to characterize the graphs on which a given transitive permutation groupG acts, it is very difficult to characterize the graphsX with Aut (X)=G. We prove here that for the certain transitive permutation groups a simple necessary condition is also sufficient. As a corollary we find that, whenG is ap-group with no homomorphism ontoZ _p wrZ _p , almost all Cayley graphs ofG have automorphism group isomorphic toG.     

Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints

We consider a canonical Ramsey type problem. An edge‐coloring of a graph is called m‐good if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m, let f(m, G) denote the smallest n such that every m‐good edge‐coloring of K_n yields a properly edge‐colored copy of G, and let g(m, G) denote the smallest n such that every m‐good edge‐coloring of K_n yields a rainbow copy of G. We give bounds on f(m, G) and g(m, G). For complete graphs G = K_t, we have c₁mt²/ln t ≤ f(m, K_t) ≤ c₂mt², and cmt³/ln t ≤ g(m, K_t) ≤ cmt³/ln t, where c₁, c₂, c, c are absolute constants. We also give bounds on f(m, G) and g(m, G) for general graphs G in terms of degrees in G. In particular, we show that for fixed m and d, and all sufficiently large n compared to m and d, f(m, G) = n for all graphs G with n vertices and maximum degree at most d. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

On bandwidth sums of graphs

ＯＮＢＡＮＤＷＩＤＴＨＳＵＭＳＯＦＧＲＡＰＨＳＹＡＯＢＩＮＧ（姚兵）;ＷＡＮＧＪＩＡＮＦＡＮＧ（王建方）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ,ＮｏｒｉｈｗｅｓｔｅｔｅｒｎＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ,Ｌａｎｚｈｏｕ７３００７０,Ｃｈｉ...     

On separating a fixed point from zero by invariants

Assume a fixed point v∈V^G can be separated from zero by a homogeneous invariant f∈𝕜[V]^G of degree p^rd, where p>0 is the characteristic of the ground field 𝕜 and p,d are coprime. We show that then v can also be separated from zero by an invariant of degree p^r, which we obtain explicitly from f. It follows that the minimal degree of a homogeneous invariant separating v from zero is a p-power.     

Hyperidentities of lattices and semilattices

Following W. Taylor we define a hyperidentity ∈ to be formally the same as an identity (e.g.,F(G(x, y, z), G(x, y, z))=G(x, y, z)). However, a varietyV is said to satisfy a hyperidentity ∈, if whenever the operation symbols of ∈ are replaced by any choice of polynomials (appropriate forV) of the same arity as the corresponding operation symbols of ∈, then the resulting identity holds inV in the usual sense. For example, if a varietyV of type <2,2> with operation symbols ∨ and ∧ satisfies the hyperidentity given above, then substituting the polynomial (x∨y)∨z for the symbolG, and the polynomialx∧y forF, we see thatV must in particular satisfy the identity ((x∨y)∨z)∧((x∨y)∨z)=((x∨y)∨z). The set of all hyperidentities satisfied by a varietyV, will be denoted byH(V). We shall letH ^m (V) be the set of all hyperidentities hoiding inV with operation symbols of arity at mostm, andH _n (V) will denote the set of all hyperidentities ofV with at mostn distinct variables. In this paper we shall show that ifV is a nontrivial variety of lattices or the variety of all semilattices, then for any integersm andn, there exists a hyperidentity ∈ such that ∈ holds inV, and ∈ is not a consequence ofH ^m (V)∪H _n (V). From this it is deduced that the hyperidentities ofV are not finitely based, partly soling a problem of Taylor [7, Problem 3]. The research of the author was supported by NSERC of Canada. Presented by W. Taylor.     

Movement of Intransitive Permutation Groups Having Maximum Degree

Let G be a permutation group on a set Ω with no fixed points in,and m be a positive integer.Then the movement of G is defined as move(G):=sup Γ {|Γg\Γ| | g ∈ G}.It was shown by Praeger that if move(G) = m,then |Ω| 3m + t-1,where t is the number of G-orbits on.In this paper,all intransitive permutation groups with degree 3m+t-1 which have maximum bound are classified.Indeed,a positive answer to her question that whether the upper bound |Ω| = 3m + t-1 for |Ω| is sharp for every t > 1 is given.     

On super edge-antimagic total labelings of

A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijective function f:V(G)E(G)→{1,2,…,p+q} such that the edge-weights w(uv)=f(u)+f(v)+f(uv), uvE(G), form an arithmetic sequence with first term a and common difference d. The graph G is said to be super (a,d)-edge-antimagic total if the vertex labels are 1,2,…,p. In this paper we study super (a,d)-edge-antimagic properties of mK_n, that is, of the graph formed by the disjoint union of m copies of K_n.