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

推荐订阅源

V
Visual Studio Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 聂微东
博客园 - 【当耐特】
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
C
Check Point Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
美团技术团队
WordPress大学
WordPress大学
Last Week in AI
Last Week in AI
Y
Y Combinator Blog
IT之家
IT之家
T
Tailwind CSS Blog
月光博客
月光博客
Vercel News
Vercel News
V
V2EX
Engineering at Meta
Engineering at Meta
B
Blog
Stack Overflow Blog
Stack Overflow Blog
A
About on SuperTechFans
Hugging Face - Blog
Hugging Face - Blog
人人都是产品经理
人人都是产品经理
腾讯CDC
I
InfoQ

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}}$
The universal zero-sum invariant and weighted zero-sum fo...
Guoqing Wang · 2022-12-27 · via math.CO updates on arXiv.org

Let $G$ be an abelian group, and let $\mathcal F (G)$ be the free commutative monoid with basis $G$. For $Ω\subset \mathcal F (G)$, define the universal zero-sum invariant ${\mathsf d}_Ω(G)$ to be the smallest integer $\ell$ such that every sequence $T$ over $G$ of length $\ell$ has a subsequence in $Ω$. The invariant ${\mathsf d}_Ω(G)$ unifies many classical zero-sum invariants. Let $\mathcal B (G)$ be the submonoid of $\mathcal F (G)$ consisting of all zero-sum sequences over $G$, and let $\mathcal A (G)$ be the set consisting of all minimal zero-sum sequences over $G$. In this paper, we show that except for a few special classes of groups, there always exists a proper subset $Ω$ of $\mathcal A (G)$ such that ${\mathsf d}_Ω(G)={\rm D}(G)$. Furthermore, in the setting of finite cyclic groups, we discuss the distributions of all minimal sets by determining their intersections. By connecting the universal zero-sum invariant with weights, we make a study of zero-sum problems in the setting of {\sl infinite} abelian groups. The universal zero-sum invariant ${\mathsf d}_{Ω; Ψ}(G)$ with weights set $Ψ$ of homomorphisms of groups is introduced for all abelian groups. The weighted Davenport constant ${\rm D}_Ψ(G)$ (being an special form of the universal invariant with weights) is also investigated for infinite abelian groups. Among other results, we obtain the necessary and sufficient conditions such that ${\rm D}_Ψ(G)<\infty$ in terms of the weights set $Ψ$ when $|Ψ|$ is finite. In doing this, by using the Neumann Theorem on Cover Theory for groups we establish a connection between the existence of a finite cover of an abelian group $G$ by cosets of some given subgroups of $G$, and the finiteness of weighted Davenport constant.