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

推荐订阅源

Engineering at Meta
Engineering at Meta
J
Java Code Geeks
I
InfoQ
腾讯CDC
Vercel News
Vercel News
IT之家
IT之家
V
Visual Studio Blog
P
Proofpoint News Feed
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
G
Google Developers Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
博客园 - 叶小钗
有赞技术团队
有赞技术团队
月光博客
月光博客
Martin Fowler
Martin Fowler
量子位
L
LangChain Blog
B
Blog
Last Week in AI
Last Week in AI
博客园 - 司徒正美
Microsoft Security Blog
Microsoft Security Blog
博客园 - 聂微东
Microsoft Azure Blog
Microsoft Azure Blog
A
About on SuperTechFans

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}}$
Generalizations of Alder's Conjecture via a Conjecture of...
Adriana L. Duncan, Simran Khunger, Holly Swisher, Ryan Tamura · 2020-10-17 · via math.CO updates on arXiv.org

Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical physics. Here, we focus on partitions with gap conditions and partitions with parts coming from fixed residue classes. Let $Δ_d^{(a,b)}(n) = q_d^{(a)}(n) - Q_d^{(b)}(n)$ where $q_d^{(a)}(n)$ counts the number of partitions of $n$ into parts with difference at least $d$ and size at least $a$, and $Q_d^{(b)}(n)$ counts the number of partitions into parts $\equiv \pm b \pmod{d + 3}$. In 1956, Alder conjectured that $Δ_d^{(1,1)}(n) \geq 0$ for all positive $n$ and $d$. This conjecture was proved partially by Andrews in 1971, by Yee in 2008, and was fully resolved by Alfes, Jameson and Lemke Oliver in 2011. Alder's conjecture generalizes several well-known partition identities, including Euler's theorem that the number of partitions of $n$ into odd parts equals the number of partitions of $n$ into distinct parts, as well as the first of the famous Rogers-Ramanujan identities. In 2020, Kang and Park constructed an extension of Alder's conjecture which relates to the second Rogers-Ramanujan identity by considering $Δ_d^{(a,b,-)}(n) = q_d^{(a)}(n) - Q_d^{(b,-)}(n)$ where $Q_d^{(b,-)}(n)$ counts the number of partitions into parts $\equiv \pm b \pmod{d + 3}$ excluding the $d+3-b$ part. Kang and Park conjectured that $Δ_d^{(2,2,-)}(n)\geq 0$ for all $d\geq 1$ and $n\geq 0$, and proved this for $d = 2^r - 2$ and $n$ even. We prove Kang and Park's conjecture for all but finitely many $d$. Toward proving the remaining cases, we adapt work of Alfes, Jameson and Lemke Oliver to generate asymptotics for the related functions. Finally, we present a more generalized conjecture for higher $a=b$ and prove it for infinite classes of $n$ and $d$.