相关论文: Arithm\'etique des Groupes Ab\'eliens Finis

In this note, we give a new formula for the number of cyclic subgroups of a finite abelian group. This is based on applying the Burnside's lemma to a certain group action. Also, it generalizes the well-known Menon's identity.

As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…

The abelian sandpile models feature a finite abelian group $G$ generated by the operators corresponding to particle addition at various sites. We study the canonical decomposition of $G$ as a product of cyclic groups $G = Z_{d_1} \times…

We give an accessible and modern description of the automorphisms of a finite abelian group $G$. Included is an explicit formula for the cardinality of $Aut(G)$.

Using Goursat's lemma for groups, a simple representation and the invariant factor decompositions of the subgroups of the group Z_m x Z_n are deduced, where m and n are arbitrary positive integers. As consequences, explicit formulas for the…

We study several combinatorial properties of finite groups that are related to the notions of sequenceability, R-sequenceability, and harmonious sequences. In particular, we show that in every abelian group $G$ with a unique involution…

We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…

Let $K$ be a number field. We present several new finiteness results for isomorphism classes of abelian varieties over $K$ whose $\ell$-power torsion fields are arithmetically constrained for some rational prime $\ell$. Such arithmetic…

In order to study how well a finite group might be generated by repeated random multiplications, P. Diaconis suggested the following urn model. An urn contains some balls labeled by elements which generate a group G. Two are drawn at random…

Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…

We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We construct the JSJ decomposition of a vGBS group over abelian groups. We prove that…

Let $\epsilon>0$. In this article we will present a deterministic algorithm which does the following. The input is a hyperelliptic curve $C$ of genus $g$ over a finite field $k$ of cardinality $q$ given by $y^2+h(x)y=f(x)$ such that the…

Let $k$ be an algebraic extension of $\mathbb F_p$ and $K/k$ a regular extension of fields (e.g. $\mathbb F_p(T)/\mathbb F_p$). Let $A$ be a $K$-abelian variety such that all the isogeny factors are neither isotrivial nor of $p$-rank zero.…

This paper classifies the derivations of group algebras in terms of the generators and defining relations of the group. If $RG$ is a group ring, where $R$ is commutative and $S$ is a set of generators of $G$ then necessary and sufficient…

The choice of an isomorphism, a duality, between a finite abelian group $A$ and its character group allows one to define dual codes of additive codes over $A$. Properties of dualities and dual codes are studied, continuing work of Delsarte…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

We examine the existence of universal elements in classes of infinite abelian groups. The main method is using group invariants which are defined relative to club guessing sequences. We prove, for example: Theorem: For $n\ge 2$, there is a…

Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…

A paradigm for a global algebraic number theory of the reals is formulated with the purpose of providing a unified setting for algebraic and transcendental number theory. This is achieved through the study of subgroups of nonstandard models…