Cover Image

An Erdős problem on random subset sums in finite abelian groups

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ma, Jie, Tang, Quanyu
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 11B30, 60C05, 05D40
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On zero-sum free sequences contained in random subsets of finite cyclic groups
by: Lee, Sang June, et al.
Published: (2020)

On the largest Sidon subset in a finite subset of $\mathbb{R}^N$
by: Bailleul, Alexandre, et al.
Published: (2026)

Largest Sidon subsets in weak Sidon sets
by: Ma, Jie, et al.
Published: (2026)

Intersective sets over abelian groups
by: Xu, Zixiang, et al.
Published: (2022)

On the threshold for Szemerédi's theorem with random differences
by: Briët, Jop, et al.
Published: (2023)

Biembeddings of Archdeacon type: their full automorphism group and their number
by: Costa, Simone
Published: (2022)

Extending the Affirmative Action Problem: mixing numbers and integrated colorings of graphs
by: Burnette, Charles, et al.
Published: (2025)

Number of orbits of $k$-subsets of permutations
by: Bouthat, Ludovick, et al.
Published: (2025)

On the existence of reflecting $n$-queens configurations
by: Dai, Tantan, et al.
Published: (2024)

On increasing sequences formed by points from a random finite subset of a hypercube
by: Pittel, Boris
Published: (2025)

Improvement on the Erdős-Kleitman conjecture via the KKL theorem
by: Ge, Gennian, et al.
Published: (2026)

Paley-like quasi-random graphs arising from polynomials
by: Kim, Seoyoung, et al.
Published: (2024)

Optimal bounds for an Erdős problem on matching integers to distinct multiples
by: van Doorn, Wouter, et al.
Published: (2026)

Infinite unrestricted sumsets in subsets of abelian groups with large density
by: Charamaras, Dimitrios, et al.
Published: (2025)

A resolution of Erdős Problem #190 via Erdős-Lovász, BCT, and Baker-Harman-Pintz
by: Bae, Ji Ho
Published: (2026)

Robustness of the Sauer-Spencer Theorem
by: Allen, Peter, et al.
Published: (2025)

Product representations of polynomials over finite fields
by: Lee, Hyunwoo, et al.
Published: (2026)

Connectivity of random hypergraphs with a given hyperedge size distribution
by: Bergman, Elmer, et al.
Published: (2022)

A cube dismantling problem related to bootstrap percolation
by: Barát, János, et al.
Published: (2026)

$f$-Diophantine sets over finite fields via quasi-random hypergraphs from multivariate polynomials
by: Kim, Seoyoung, et al.
Published: (2025)

Finding large additive and multiplicative Sidon sets in sets of integers
by: Jing, Yifan, et al.
Published: (2022)

A Halász-type theorem for permutation anticoncentration
by: Hunter, Zach, et al.
Published: (2026)

A sparse canonical van der Waerden theorem
by: Alvarado, José D., et al.
Published: (2025)

Random Finite Sumsets and Product Sets in Subsets of the Natural Numbers
by: Chakraborty, Sukrit, et al.
Published: (2025)

The bunkbed problem and the random cluster model
by: Ayyer, Arvind, et al.
Published: (2025)

The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes
by: Asgarli, Shamil, et al.
Published: (2021)

Judicious partitions for restricted self-sumsets in cyclic groups
by: Irawan, Keane Maverick
Published: (2025)

Counterexamples to generalizations of the Erdős $B+B+t$ problem
by: Ackelsberg, Ethan
Published: (2024)

The number and structure of connected graphs with a fixed degree sequence
by: Bell, Sasha, et al.
Published: (2026)

An improved lower bound for Erdős--Szekeres products
by: Tang, Quanyu
Published: (2025)

Intersection problems for linear codes and polynomials over finite fields
by: Adriaensen, Sam
Published: (2025)

Robustness of Erdős--Ko--Rado theorems on permutations and perfect matchings
by: Gunderson, Karen, et al.
Published: (2024)

Note on down-set thresholds
by: Warnke, Lutz
Published: (2023)

Divisible design graphs from Higmanian association schemes
by: Ryabov, Grigory
Published: (2026)

Contiguity and remote contiguity of some random graphs
by: Kleijn, B. J. K., et al.
Published: (2024)

Asymptotic Bounds for CO-irredundant and Irredundant Ramsey Numbers
by: Ji, Meng, et al.
Published: (2021)

Sharp Threshold for Cliques in Random 0/1 Polytope Graphs
by: Babecki, Catherine, et al.
Published: (2025)

On likelihood of a Condorcet winner for uniformly random and independent voter preferences
by: Pittel, Boris
Published: (2025)

Moment conditions for the asymptotic completeness of iid gap sequences
by: Asatryan, Vahram, et al.
Published: (2025)

On strongly walk regular graphs, triple sum sets and their codes
by: Kiermaier, Michael, et al.
Published: (2020)