Covering modules by proper submodules

This thesis presents some contributions in additive combinatorics and arithmetic Ramsey theory. More specifically, it deals with the interaction between combinatorics, number theory and additive combinatorics. This area saw a great improvement with the Szemerédi Regularity Lemma and some of the results that followed. The Regularity Lemma and its consequences have become a widely used tool in graph theory, combinatorics and number theory. Furthermore, its language and point of view has deeply changed the face of additive number theory, a fact universally acknowledged by the Abel award given to Szemerédi in 2012. One of the main reasons for the prize has been Szemerédi's theorem, a result regarding the existence of arbitrarily long arithmetic progressions in dense sets of the integers, the proof of which uses the Regularity Lemma in a key step. One of the earlier consequences of the Regularity Lemma was the Removal Lemma for graphs that was used by Ruzsa and Szemerédi to show Roth theorem, regarding the existence of 3-term arithmetic progressions in dense sets of the integers, in a combinatorial way. The Removal Lemma states that in any graph K with few copies of a subgraph, say a triangle, we can remove few edges from K so that the result contains no copy of the subgraph. This has become a key tool in the applications of the so-called Regularity Method, which has extensive literature in combinatorics, graph theory, number theory and computer science. In 2005 Green introduced a regularity lemma for Abelian groups as well as an algebraic removal lemma. The removal lemma for groups states that, for a given finite Abelian group G, if there are o(|G|^3) solution to x+y+z+t=0 with the variables taking values in S, a subset of G, then we can remove o(|G|) elements from S to make the set S solution-free. The main contributions of this work corresponds to extensions of the removal lemma for groups to either more general contexts, like non-necessary Abelian finite groups, or to linear systems of equations for finite Abelian groups. The main goal is to give a comprehensive and more general framework for many results in additive number theory like Szemerédi Theorem. In particular, we show that the removal lemma for groups by Green can be extended to non-necessary Abelian finite groups. Moreover, we prove a removal lemma for linear systems on finite fields: for every e>0 there exists a d>0 such that if A is a (k x m) linear system of equations with coefficients in a finite field F and the number of solutions to Ax=b, where each variable takes values from a subset Si in F is less than d times |F| raised to m-k, then by removing less than e|F| elements in each Si we can make the resulting sets solution-free, thus solving a conjecture by Green to that respect. Even more, if A is an integer linear system, G is a finite Abelian group, and the determinantal of A and |G| are coprime, then a similar statement holds. Let us mention that the last result allows us to characterize those linear systems where any set S with size proportional to G has a nontrivial solution in S, provided |G| is large enough. This extends the validity of Szmerédi's theorem to finite Abelian groups. These extensions of the removal lemma have been used in arithmetic Ramsey theory to obtain counting results for the number of monochromatic solutions of linear systems. The main result from a work by Frankl, Graham and Rödl in '88 states that the number of monochromatic solutions of regular systems in integer intervals is in fact a positive proportion of the total number of solutions. We give analogous results for solutions in Abelian groups with bounded exponent, for which the main tool in the torsion-free case cannot be applied. Density versions of these counting results are also obtained, in this case with a full characterization.

In this chapter, we discuss several special types of modules that will make frequent appearances later. These include semisimple modules, artinian modules, and torsionfree modules, which have prototypes in vector spaces, finite abelian groups, and torsionfree abelian groups, respectively. That special types of modules have useful roles in the study of arbitrary modules may be seen already in the case of abelian groups (i.e., ℤ-modules). In studying an arbitrary abelian group, an almost reflexive first step is to look at its torsion part (i.e., the torsion subgroup) and its torsionfree part (i.e., the factor group modulo the torsion subgroup), since entirely different techniques are available (and needed) for dealing with torsion groups and torsionfree groups. On the torsionfree side, vector spaces make an appearance due to the facts that the torsionfree divisible abelian groups are exactly the vector spaces over ℚ and that every torsionfree abelian group can be embedded in a divisible one. On the torsion side, many questions can be reduced to the case of finite abelian groups, since every torsion abelian group is a directed union of finite subgroups. In studying torsion abelian groups, one also reduces to the case of p -groups for various primes p . Vector spaces make another appearance here, since in an abelian p -group the set of elements of order p (together with 0) forms a vector space over ℤ/ p ℤ.

Regular and p-regular orbits of solvable linear groups

This thesis consists of two independent chapters. The first chapter concerns the Smith Normal Form (SNF) over the integers ℤ of integral matrices. We consider the SNF of a matrix A to be the ratio of two ℤ-modules -- a finitely generated abelian group; this is called the Smith group of A. The Smith group provides a unified setting to present both new and old results. The new results concern the relationship between the eigenvalues of an integral matrix and its SNF. In particular, the multiplicities of integer eigenvalues are shown to relate to the multiplicities in the type of the Smith group. Bounds are also given for the exponent of the Smith group. In some cases, these are best possible. The old results discussed are the interlacing of the SNF in the case of augmented matrices and the symmetries of the SNF for certain combinatorial matrices. The latter results are extended to rectangular matrices. Numerous examples are given throughout, along with many conjectures based on computation. The second chapter generalizes the work of Pless, et al. on duadic codes and Q-codes. We take abelian group codes to be ideals in the group ring F[G], where G is a finite abelian group of odd order n and F is a finite field with characteristic relatively prime to n. We define generalized Q-codes from a pair of idempotents of F[G] and an automorphism of G which together obey two simple equations. These codes are (n, (n+1)/2) and (n, (n-1)/2) linear codes. We show that all of the properties of duadic and Q-codes generalize. In particular, we extend the results on the relationship of these codes to projective planes with regular automorphism group G. When F has characteristic 2, we give simple numerical conditions on G and F which determine when generalized Q-codes exist. We also give some techniques for constructing these codes.

Let an element of a group be called an FC element if it has only a finite number of conjugates in the group. Baer(1) and Neumann (8) have discussed groups in which every element is FC, and called them FC-groups. Both Abelian and finite groups are trivially FC-groups; Neumann has studied the properties common to FC-groups and Abelian groups, and Baer the properties common to FC-groups and finite groups. Baer has also shown that, for an arbitrary group G, the set H1 of all FC elements is a characteristic subgroup. Haimo (3) has defined the FC-chain of a group G byHi/Hi−1 is the subgroup of all FC elements in G/Hi−1.

§1. Introduction.The motivation of this work comes from two different directions: infinite abelian groups, and ordered algebraic structures. A challenging problem in both cases is that of classification. In the first case, it is known for example (cf. [KA]) that the classification of abelian torsion groups amounts to that of reducedp-groups by numerical invariants called theUlm invariants(given by Ulm in [U]). Ulm's theorem was later generalized by P. Hill to the class of totally projective groups. As to the second case, let us consider for instance the class of divisible ordered abelian groups. These may be viewed as ordered ℚ-vector spaces. Their theory being unstable, we cannot hope to classify them by numerical invariants. On the other hand, being o-minimal, the theory enjoys several good model theoretic properties (cf. [P-S]), so the search for some reasonable invariants is well motivated. The common denominator of the two cases, as well as of many others, is valuation theory. Indeed given an ordered vector space, one can consider it as a valued vector space, endowed with the natural valuation. Also, the socleG[p] of a reduced abelianp-groupG, endowed with the height functionhG, is a valued vector space over(the prime field of characteristicp) with values in the ordinals (cf. [F]).

Methods and results from the representation theory of finite di- mensional algebras have led to many interactions with other areas of mathe- matics. Such areas include the theory of Lie algebras and quantum groups, commutative algebra, algebraic geometry and topology, and in particular the new theory of cluster algebras. The aim of this workshop was to further de- velop such interactions and to stimulate progress in the representation theory of algebras.

A new framework for identifying absolute maximum nonlinear functions

The enhanced power graph [Formula: see text] of a group [Formula: see text] is the graph with vertex set [Formula: see text] such that two vertices [Formula: see text] and [Formula: see text] are adjacent if they are contained in the same cyclic subgroup. We prove that finite groups with isomorphic enhanced power graphs have isomorphic directed power graphs. We show that any isomorphism between undirected power graph of finite groups is an isomorphism between enhanced power graphs of these groups, and we find all finite groups [Formula: see text] for which [Formula: see text] is abelian, all finite groups [Formula: see text] with [Formula: see text] being prime power, and all finite groups [Formula: see text] with [Formula: see text] being square-free. Also, we describe enhanced power graphs of finite abelian groups. Finally, we give a characterization of finite nilpotent groups whose enhanced power graphs are perfect, and we present a sufficient condition for a finite group to have weakly perfect enhanced power graph.

Chapter 2 - Linear Equations and Related Topics with Reference to Economics

We use transfinite induction to show that if L is an epimorphism of a vector space V and maps a vector subspace W of V into a proper subspace of itself, then there is a smallest subspace E of V containing W such that L(E) E (or a minimal space of surjectivity or solvability) and we give examples where there are infinitely many distinct minimal spaces of solvability. We produce an example showing that if L 1 and L 2 are two epimorphisms of a vector space V which are endomorphisms of a proper subspace W of V such that LI(W) n L2(W is a proper subspace of W, then there may not exist a smallest subspace E of V containing W such that LI(E) E L2(E). While no nonconstant linear partial differential operator maps the field of meromorphic functions onto itself, we construct a locally convex topological vector space of formal power series containing the meromorphic functions such that every linear partial differential operator with constant coefficients maps this space linearly and continuously onto itself. Furthermore, we show that algebraically there is for every linear partial differential operator P(D) with constant coefficients a smallest extension E of the meromorphic functions in n complex variables, where

Generalized incidence theorems, homogeneous forms and sum–product estimates in finite fields

Graph coloring problem (GCP) is a classical combinatorial optimization problem and has many applications in the industry. Many algorithms have been proposed for solving GCP. However, insufficient efficiency and unreliable stability still limit their performance. Aiming to overcome these shortcomings, a physarum-based ant colony optimization for solving GCP is proposed in this paper. The proposed algorithm takes advantage of the positive feedback mechanism of the physarum mathematical model to optimize the pheromone matrix updating in the ant colony optimization. Some experiments are implemented to estimate the efficiency and stability of the proposed algorithm compared with typical ant colony optimization and some state-of-art algorithms. According to these results, in terms of the efficiency, stability and computational cost, we can daringly infer that the improved ant colony optimization with the physarum model performs better than the aforementioned for graph coloring. In particular, it is recommended that the model is of rationality and the proposed algorithm is of validity, which will foster a science of color number and computational cost in GCP.

A group G is called semi-n-abelian, if for every g ∈ G there exists at least one a(g) ∈ G-which depends only on g-such that (gh)n = a-1(g)gnhna(g) for all h ∈ G; a group G is called n-abelian, if a(g) = e for all g ∈ G. According to Durbin the following holds for n-abelian groups: If G is n-abelian for at lesast 3 consecutive integers, then G in n-abelian for all integers and these groups are exactly the abelian groups. In this paper this problem is generalized to the semi-n-abelian case: If a finite group G is semi-n-abelian for at least 4 consecutive integers then G is semi-n-abelian for all integers and these groups are exactly the nilpotent groups, where the Sylow-2-subgroup is abelian, the Sylow-3-subgroup is any element of the Levi-variety ([[g, h], h] = e ∀ g, h ∈ G) and the Sylow-p-subgroup (p < 3) is of class <2. As a consequence we get a description of all finite (3-)groups, which are elements of the Levi-variety.

The classifying space BG of a topological group G can be filtered by a sequence of subspaces B(q,G) using the descending central series of free groups. If G is finite, describing them as homotopy colimits is convenient when applying homotopy theoretic methods. In this thesis we introduce natural subspaces B(q,G)_p of B(q,G) defined for a fixed prime p. We show that B(q,G) is stably homotopy equivalent to a wedge sum of B(q,G)_p as p runs over the primes dividing the order of G. Colimits of abelian groups play an important role in understanding the homotopy type of these spaces. Extraspecial p-groups are key examples, for which these colimits turn out to be finite. We prove that for extraspecial p-groups of rank at least 4 the space B(2,G) does not have the homotopy type of a K(π,1) space. Furthermore, we give a group theoretic condition, applicable to symmetric groups and general linear groups, which implies the space B(2,G) not having the homotopy type of a K(π,1) space. For a finite group G, we compute the complex K-theory of B(2,G) modulo torsion.