The large Davenport constant. I: Groups with a cyclic, index 2 subgroup.
From MaRDI portal
Publication:2376542
DOI10.1016/j.jpaa.2012.09.004zbMath1276.20027arXiv1211.2612MaRDI QIDQ2376542
Alfred Geroldinger, David J. Grynkiewicz
Publication date: 24 June 2013
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.2612
finite groups; zero-sum sequences; sequences of elements; combinatorial constants for groups; large Davenport constant; small Davenport constant; unit-product sequences
20D60: Arithmetic and combinatorial problems involving abstract finite groups
11B75: Other combinatorial number theory
Related Items
Unnamed Item, A Reciprocity on Finite Abelian Groups Involving Zero-Sum Sequences, On the invariant $\mathsf E(G)$ for groups of odd order, Representing Sequence Subsums as Sumsets of Near Equal Sized Sets, On a conjecture of Zhuang and Gao, On product-one sequences over dihedral groups, On the inverse problems associated with subsequence sums of zero-sum free sequences over finite abelian groups, Product-one subsequences over subgroups of a finite group, The Noether number of p-groups, On product-one sequences over subsets of groups, The large Davenport constant. II: General upper bounds., The Noether number for the groups with a cyclic subgroup of index two, The Noether numbers and the Davenport constants of the groups of order less than 32, Erdős-Ginzburg-Ziv theorem for finite commutative semigroups., Iterated sumsets and setpartitions, Erdős-Ginzburg-Ziv theorem and Noether number for \(C_m \ltimes_\varphi C_{mn}\), On generalized Erdős-Ginzburg-Ziv constants of \(C_n^r\), On an inverse problem of Erdős, Kleitman, and Lemke, Inverse problems associated with subsequence sums in \(C_p \oplus C_p\), On a conjecture of the small Davenport constant for finite groups, Lower bound for the Erdős-Burgess constant of finite commutative rings, On the inverse problems associated with subsequence sums of zero-sum free sequences over finite abelian groups. II, Extremal product-one free sequences and \(|G|\)-product-one free sequences of a metacyclic group, On product-one sequences with congruence conditions over non-abelian groups, On subsequence sums of a zero-sum free sequence over finite abelian groups, On the algebraic and arithmetic structure of the monoid of product-one sequences, On Erdős-Ginzburg-Ziv inverse theorems for dihedral and dicyclic groups, Zero-sum invariants on finite abelian groups with large exponent, The Erdős-Ginzburg-Ziv theorem for finite nilpotent groups, Davenport constant for semigroups. II., An upper bound for the Davenport constant of finite groups, Extremal product-one free sequences over \(C_n \rtimes_sC_2\), On the direct and inverse zero-sum problems over \(C_n \rtimes_s C_2\), The Interplay of Invariant Theory with Multiplicative Ideal Theory and with Arithmetic Combinatorics, On additive bases III
Cites Work
- The large Davenport constant. II: General upper bounds.
- The Erdős-Ginzburg-Ziv theorem for finite solvable groups.
- Zero-sum problems in finite Abelian groups: a survey
- Degree bounds -- an invitation to postmodern invariant theory
- Groups of prime power order. Vol. 1.
- A generalization of Kneser's addition theorem
- Non-unique factorizations of algebraic integers
- Zero-sum problems -- a survey
- Structural additive theory. Based on courses given at Karl-Franzens-Universität Graz, Austria, 2008--2012
- The Erdős-Ginzburg-Ziv theorem for dihedral groups.
- Improving the Erdős-Ginzburg-Ziv theorem for some non-Abelian groups.
- Davenport constant for semigroups.
- Erdős-Ginzburg-Ziv theorem for dihedral groups of large prime index.
- Factorizations of Algebraic Integers, Block Monoids, and Additive Number Theory
- Finite abelian groups and factorization problems
- On some developments of the Erdős–Ginzburg–Ziv Theorem II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
