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

推荐订阅源

U
Unit 42
Blog — PlanetScale
Blog — PlanetScale
H
Help Net Security
The GitHub Blog
The GitHub Blog
博客园 - Franky
酷 壳 – CoolShell
酷 壳 – CoolShell
Recent Announcements
Recent Announcements
量子位
aimingoo的专栏
aimingoo的专栏
大猫的无限游戏
大猫的无限游戏
博客园 - 叶小钗
Microsoft Azure Blog
Microsoft Azure Blog
Martin Fowler
Martin Fowler
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
A
About on SuperTechFans
T
Tailwind CSS Blog
V
V2EX
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
B
Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
S
SegmentFault 最新的问题
G
Google Developers Blog
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}}$
The Characterization of Finite Elasticities
David J. Grynkiewicz · 2020-12-23 · via math.CO updates on arXiv.org

Our motivating goal is factorization in Krull Domains $H$ with finitely generated class group $G$. The elasticity $ρ(H)$ is the maximal number of atoms in any re-factorization of a product of $k$ atoms. The elasticities are the same as those of a combinatorial monoid of zero-sum sequences $B(G_0)$, where $G_0\subseteq G$ are the classes with height one primes. We characterize when finite elasticity holds for any Krull Domain with finitely generated class group. Our results are valid for the more general class of Transfer Krull Monoids (over a subset $G_0$ of a finitely generated abelian group $G$). We show there is a minimal $s\leq (d+1)m$, where $d$ is the torsion free rank and $m$ is the torsion exponent, such that $ρ_s(H)<\infty$ implies $ρ_k(H)<\infty$ for all $k\geq 1$. This ensures $ρ(H)<\infty$ if and only if $ρ_{(d+1)m}(H)<\infty$. Our characterization is in terms of a simple combinatorial obstruction to infinite elasticity: there existing a subset $G_0^\diamond\subseteq G_0$ and bound $N$ such that there are no nontrivial zero-sum sequences with terms from $G_0^\diamond$, and every minimal zero-sum sequence has at most $N$ terms from $G_0\setminus G_0^\diamond$. We give an explicit description of $G_0^\diamond$ in terms of the Convex Geometry of $G_0$ modulo the torsion subgroup $G_T\leq G$, and show finite elasticity is equivalent to there being no positive linear combination of the elements of this explicitly defined subset equal to $0$ modulo $G_T$. We use our results to show finite elasticity implies the set of distances $Δ(H)$, the catenary degree $\mathsf c(H)$ (for Krull Monoids) and a weakened tame degree (for Krull Monoids) are all also finite, and that the Structure Theorem for Unions holds. Our results for factorization in Transfer Krull Monoids are accomplished by developing an extensive theory in Convex Geometry generalizing positive bases.