A commutative analogue of the group ring

Throughout, all rings R will be commutative with identity element. In this paper we introduce, for each finite group G, a commutative graded Z-algebra R_G. This classifies the G-invariant commutative R-algebra multiplications on the group algebra R[G] which are cocycles (in fact coboundaries) with respect to the standard “direct sum” multiplication and have the same identity element.In the case when G is an elementary Abelian p-group it turns out that R_G is closely related to the symmetric algebra over F_p of the dual of G. We intend in subsequent papers to explore the close relationship between G and R_G in the case of a general (possibly non-Abelian) group G.Here we show that the Krull dimension of R_G is the maximal rank r of an elementary Abelian subgroup E of G unless either E is cyclic or for some such E its normalizer in G contains a non-trivial cyclic group which acts faithfully on E via “scalar multiplication” in which case it is r+1.     

Almost maximally almost-periodic group topologies determined by T-sequences

A sequence {an} in a group G is a T-sequence if there is a Hausdorff group topology τ on G such that . In this paper, we provide several sufficient conditions for a sequence in an abelian group to be a T-sequence, and investigate special sequences in the Prüfer groups Z(p^∞). We show that for p≠2, there is a Hausdorff group topology τ on Z(p^∞) that is determined by a T-sequence, which is close to being maximally almost-periodic—in other words, the von Neumann radical n(Z(p^∞),τ) is a non-trivial finite subgroup. In particular, n(n(Z(p^∞),τ))?n(Z(p^∞),τ). We also prove that the direct sum of any infinite family of finite abelian groups admits a group topology determined by a T-sequence with non-trivial finite von Neumann radical.     

On the class group and S-class group of formal power series rings

Let ${\text{Cl}}_t(A)$ denote the t-class group of an integral domain A. P. Samuel has established that if A is a Krull domain then the mapping ${\text{Cl}}_t(A)\to {\text{Cl}}_t(A?X?)$, is injective and if A is a regular UFD, then ${\text{Cl}}_t(A)\to {\text{Cl}}_t(A?X?)$, is bijective. Later, L. Claborn extended this result in case A is a regular Noetherian domain. In the first part of this paper we prove that the mapping ${\text{Cl}}_t(A)\to {\text{Cl}}_t(A?X?)$; $[I]?[{(I.A?X?)}_t]$ is an injective homomorphism and in case of an integral domain A such that each υ-invertible υ-ideal of A has υ-finite type, we give an equivalent condition for ${\text{Cl}}_t(A)\to {\text{Cl}}_t(A?X?)$, to be bijective, thus generalizing the result of Claborn. In the second part of this paper, we define the S-class group of an integral domain A: let S be a (not necessarily saturated) multiplicative subset of an integral domain A. Following [11], a nonzero fractional ideal I of A is S-principal if there exist an $s\in S$ and $a\in I$ such that $sI?aA?I$. The S-class group of A, S-${\text{Cl}}_t(A)$ is the group of fractional t-invertible t-ideals of A under t-multiplication modulo its subgroup of S-principal t-invertible t-ideals of A. We generalize some known results developed for the classic contexts of Krull and PυMD domain and we investigate the case of isomorphism S-${\text{Cl}}_t(A)?S$-${\text{Cl}}_t(A?X?)$.     

Almost splitting sets in integral domains, II

Let D be an integral domain. A saturated multiplicative subset S of D is an almost splitting set if, for each 0≠d∈D, there exists a positive integer n=n(d) such that dⁿ=st for some s∈S and t∈D which is v-coprime to each element of S. We show that every upper to zero in D[X] contains a primary element if and only if D?{0} is an almost splitting set in D[X], if and only if D is a UMT-domain and Cl(D[X]) is torsion. We also prove that D[X] is an almost GCD-domain if and only if D is an almost GCD-domain and Cl(D[X]) is torsion. Using this result, we construct an integral domain D such that Cl(D) is torsion, but Cl(D[X]) is not torsion.     

On the arithmetic of Krull monoids with infinite cyclic class group

Let H be a Krull monoid with infinite cyclic class group G and let G_P⊂G denote the set of classes containing prime divisors. We study under which conditions on G_P some of the main finiteness properties of factorization theory-such as local tameness, the finiteness and rationality of the elasticity, the structure theorem for sets of lengths, the finiteness of the catenary degree, and the existence of monotone and near monotone chains of factorizations-hold in H. In many cases, we derive explicit characterizations.     

Minimal generating set for semi-invariants of quivers of dimension two

A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,…,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of generic matrices and the traces of tree paths of pairwise different multidegrees, where in the case of characteristic different from two we take only admissible paths. As a consequence, we describe relations modulo decomposable semi-invariants.     

The scrambling index of symmetric primitive matrices

A nonnegative square matrix A is primitive if some power A^k>0 (that is, A^k is entrywise positive). The least such k is called the exponent of A. In [2], Akelbek and Kirkland defined the scrambling index of a primitive matrix A, which is the smallest positive integer k such that any two rows of A^k have at least one positive element in a coincident position. In this paper, we give a relation between the scrambling index and the exponent for symmetric primitive matrices, and determine the scrambling index set for the class of symmetric primitive matrices. We also characterize completely the symmetric primitive matrices in this class such that the scrambling index is equal to the maximum value.     

Spectra of digraphs

In this primarily expository paper we survey classical and some more recent results on the spectra of digraphs, equivalently, the spectra of (0,1)-matrices, with emphasis on the spectral radius.     

A bound on the generalized competition index of a primitive matrix using Boolean rank

For a positive integer m where 1?m?n, the m-competition index (generalized competition index) of a primitive digraph is the smallest positive integer k such that for every pair of vertices x and y, there exist m distinct vertices v₁,v₂,…,v_m such that there are directed walks of length k from x to v_i and from y to v_i for 1?i?m. The m-competition index is a generalization of the scrambling index and the exponent of a primitive digraph. In this study, we determine an upper bound on the m-competition index of a primitive digraph using Boolean rank and give examples of primitive Boolean matrices that attain the bound.     

Generalized competition index of a primitive digraph

For positive integers k and m, and a digraph D, the k-step m-competition graph of D has the same set of vertices as D and an edge between vertices x and y if and only if there are distinct m vertices v₁,v₂,…,v_m in D such that there are directed walks of length k from x to v_i and from y to v_i for 1?i?m. In this paper, we present the definition of m-competition index for a primitive digraph. The m-competition index of a primitive digraph D is the smallest positive integer k such that is a complete graph. We study m-competition indices of primitive digraphs and provide an upper bound for the m-competition index of a primitive digraph.     

Extreme values of the stationary distribution of random walks on directed graphs

We examine the stationary distribution of random walks on directed graphs. In particular, we focus on the principal ratio, which is the ratio of maximum to minimum values of vertices in the stationary distribution. We give an upper bound for this ratio over all strongly connected graphs on n vertices. We characterize all graphs achieving the upper bound and we give explicit constructions for these extremal graphs. Additionally, we show that under certain conditions, the principal ratio is tightly bounded. We also provide counterexamples to show the principal ratio cannot be tightly bounded under weaker conditions.     

Epsilon multiplicity for graded algebras

The notion of ε-multiplicity was originally defined by Ulrich and Validashti as a limsup and they used it to detect integral dependence of modules. It is important to know if it can be realized as a limit. In this article we show that the relative ε-multiplicity of reduced standard graded algebras over an excellent local ring exists as a limit. We also obtain some important special cases of Cutkosky's results concerning ε-multiplicity, as corollaries of our main theorem.     

Mod 2 indecomposable orthogonal invariants

Over an algebraically closed base field k of characteristic 2, the ring R^G of invariants is studied, G being the orthogonal group O(n) or the special orthogonal group SO(n) and acting naturally on the coordinate ring R of the m-fold direct sum kⁿ⊕?⊕kⁿ of the standard vector representation. It is proved for O(n) (n?2) and for SO(n) (n?3) that there exist m-linear invariants with m arbitrarily large that are indecomposable (i.e., not expressible as polynomials in invariants of lower degree). In fact, they are explicitly constructed for all possible values of m. Indecomposability of corresponding invariants over immediately follows. The constructions rely on analysing the Pfaffian of the skew-symmetric matrix whose entries above the diagonal are the scalar products of the vector variables.     

Star-linear equational theories of groupoids

We prove that there are precisely six equational theories E of groupoids with the property that every term is E-equivalent to a unique linear term. Presented by J. Berman. Received November 11, 2004; accepted in final form March 12, 2006. The first and third authors were supported by the Ministry of Science and Environment of Serbia, grant no. 144011; the second and fifth authors were supported by MŠMT, research project MSM 0021620839, and by the Grant Agency of the Czech Republic, grant #201/02/0594; the fourth author was supported by the NSF grant #DMS-0245622.     

Graphical operations on projective spaces

Motivated by the work of Crapo and Rota [6] on the lifting of a projective complex, we introduce a class of invariant operations associated to integral-weighted graphs, which we call graphical operations. Such operations generalize the sixth harmonic of a quadranguler set on a projective line. We determine the expansion of the graphical operations in terms of multi-linear bracket polynomials in a Grassmann-Cayley algebra. Reducibility and compositions of such invariant operations are also investigated with a number of examples.Supported by Courant Instructorship, New York University.     

The transvection free groups with polynomial rings of invariants

Let G be a finite linear group containing no transvections. This paper proves that the ring of invariants of G is polynomial if and only if the pointwise stabilizer in G of any subspace is generated by pseudoreflections. Kemper and Malle used the classification of finite irreducible groups generated by pseudoreflections to prove the irreducible case in arbitrary characteristic. We extend their result to the reducible case.     

Addressing the Petersen graph

Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in such a way that distances between vertices may readily be determined from their addresses. They observed that N?h(D), the maximum of the number of positive and the number of negative eigenvalues of the distance matrix D of G. A result of Gregory, Shader and Watts yields a necessary condition for equality to occur. As an illustration, we show that N>h(D)=5 for all addressings of the Petersen graph and then give an optimal addressing by 6-tuples.     

Clique partitions of distance multigraphs

We consider the minimum number of cliques needed to partition the edge set of D(G), the distance multigraph of a simple graph G. Equivalently, we seek to minimize the number of elements needed to label the vertices of a simple graph G by sets so that the distance between two vertices equals the cardinality of the intersection of their labels. We use a fractional analogue of this parameter to find lower bounds for the distance multigraphs of various classes of graphs. Some of the bounds are shown to be exact.