Inverse zero-sum problems and algebraic invariants

被引：9
|
作者：
Girard, Benjamin [1 ]
机构：
[1] Ecole Polytech, CNRS, Ctr Math Laurent Schwartz, UMR 7640, F-91128 Palaiseau, France
来源：
ACTA ARITHMETICA | 2008年 / 135卷 / 03期
关键词：
zero-sumfree sequence; Davenport constant; cross number;
D O I：
10.4064/aa135-3-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
[No abstract available]
引用
收藏
页码：231 / 246
页数：16
相关论文
共 50 条
  • [31] On the direct and inverse zero-sum problems over non-split metacyclic group
    Yang, Jing
    Zhang, Xiaoqian
    Feng, Lihua
    DISCRETE MATHEMATICS, 2024, 347 (12)
  • [32] Two zero-sum problems and multiple properties
    Gao, WD
    JOURNAL OF NUMBER THEORY, 2000, 81 (02) : 254 - 265
  • [33] ON ZERO-SUM TURAN PROBLEMS OF BIALOSTOCKI AND DIERKER
    CARO, Y
    RODITTY, Y
    JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1992, 53 : 402 - 407
  • [34] Zero-sum problems and coverings by proper cosets
    Gao, WD
    Geroldinger, A
    EUROPEAN JOURNAL OF COMBINATORICS, 2003, 24 (05) : 531 - 549
  • [35] On the direct and inverse zero-sum problems over Cn (sic)s C2
    Avelar, D. V.
    Martinez, F. E. Brochero
    Ribas, S.
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2023, 197
  • [36] Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs
    Mohr, Elena
    Pardey, Johannes
    Rautenbach, Dieter
    GRAPHS AND COMBINATORICS, 2022, 38 (05)
  • [37] Inverse Two-Player Zero-Sum Dynamic Games
    Tsai, Dorian
    Molloy, Timothy L.
    Perez, Tristan
    2016 AUSTRALIAN CONTROL CONFERENCE (AUCC), 2016, : 192 - 196
  • [38] Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs
    Elena Mohr
    Johannes Pardey
    Dieter Rautenbach
    Graphs and Combinatorics, 2022, 38
  • [39] Zero-sum problems in finite abelian groups: A survey
    Gao, Weidong
    Geroldinger, Alfred
    EXPOSITIONES MATHEMATICAE, 2006, 24 (04) : 337 - 369
  • [40] A SEMIRING ON CONVEX POLYGONS AND ZERO-SUM CYCLE PROBLEMS
    IWANO, K
    STEIGLITZ, K
    SIAM JOURNAL ON COMPUTING, 1990, 19 (05) : 883 - 901
12345