惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Y
Y Combinator Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园_首页
量子位
V
Visual Studio Blog
博客园 - Franky
宝玉的分享
宝玉的分享
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 【当耐特】
罗磊的独立博客
小众软件
小众软件
V
V2EX
GbyAI
GbyAI
B
Blog RSS Feed
博客园 - 三生石上(FineUI控件)
大猫的无限游戏
大猫的无限游戏
有赞技术团队
有赞技术团队
月光博客
月光博客
Recent Announcements
Recent Announcements
雷峰网
雷峰网
F
Fortinet All Blogs
M
MIT News - Artificial intelligence

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
A Multiplicative Property for Zero-Sums II
David J. Grynkiewicz, Chao Liu · 2021-09-22 · via math.CO updates on arXiv.org

Let $G=C_n\oplus C_{mn}$ with $n\geq 2$ and $m\geq 1$, and let $k\in [0,n-1]$. It is known that any sequence of $mn+n-1+k$ terms from $G$ must contain a nontrivial zero-sum of length at most $mn+n-1-k$. The associated inverse question is to characterize those sequences with maximal length $mn+n-2+k$ that fail to contain a nontrivial zero-sum subsequence of length at most $mn+n-1-k$. For $k\leq 1$, this is the inverse question for the Davenport Constant. For $k=n-1$, this is the inverse question for the $η(G)$ invariant concerning short zero-sum subsequences. The structure in both these cases is known, and the structure for $k\in [2,n-2]$ when $m=1$ was studied previously with it conjectured that they must have the form $S=e_1^{[n-1]}\boldsymbol{\cdot} e_2^{[n-1]}\boldsymbol{\cdot} (e_1+e_2)^{[k]}$ for some basis $(e_1,e_2)$, with the conjecture established in many cases. We focus on $m\geq 2$. Assuming the conjectured structure holds for $k\in [2,n-2]$ in $C_n\oplus C_n$, we characterize the structure of all sequences of maximal length $mn+n-2+k$ in $C_n\oplus C_{mn}$ that fail to contain a nontrivial zero-sum of length at most $mn+n-1-k$, showing they must have either have the form $S=e_1^{[n-1]}\boldsymbol{\cdot} e_2^{[sn-1]}\boldsymbol{\cdot} (e_1+e_2)^{[(m-s)n+k]}$ for some $s\in [1,m]$ and basis $(e_1,e_2)$ with $\mathsf{ord}(e_2)=mn$, or else have the form $S=g_1^{[n-1]}\boldsymbol{\cdot} g_2^{[n-1]}\boldsymbol{\cdot} (g_1+g_2)^{[(m-1)n+k]}$ for some generating set $\{g_1,g_2\}$ with $\mathsf{ord}(g_1+g_2)=mn$. Additionally, we give a new proof of the precise structure in the case $k=n-1$ for $m=1$. Combined with known results, our results unconditionally establish the structure of extremal sequences in $G=C_n\oplus C_{mn}$ in many cases.