Searcharxiv⌕ Search

arXiv subjects

Saad A. Awan

Publications and source records attributed to Saad A. Awan.

2 recordsLinked to original sources

Gaps in the Most Frequent Sizes of Integer Sumsets

Nathanson observed that, for four-element sets $A$ of integers, the most frequent sizes of the iterated sumset $hA$ are separated by triangular numbers. Senger proved this and suggested an analogue for larger sets. We establish this pattern for $k$-element subsets of $\{1,\ldots,q\}$, for every fixed $k\geq3$, where $h\geq2$ is either fixed or grows slower than $q^{1/(2k-1)}$. As $q\to\infty$, almost every such set has the largest possible $h$-fold sumset, and almost every exception has one of $h-1$ explicit smaller sizes. The differences between consecutive sizes among these $h$ values are consecutive $(k-2)$-dimensional simplex numbers.

math.CO↗

First-Derivative Chromatic Symmetric Reconstruction For Proper Trees

Richard Stanley asked whether every tree $T$ is determined up to isomorphism by its chromatic symmetric function $X_T$. We approach this open problem by regarding $X_T$ as a polynomial in the power-sum symmetric functions $p_1, p_2, \dots$ and studying the invariant $Φ_T = \left.\frac{\partial {X_T}}{\partial p_1}\right\rvert_{p_1 = 0}$. We prove that $Φ_T$ distinguishes, among proper trees, every proper tree in which any non-leaf vertex with two or more non-leaf neighbors has a number of leaf neighbors occurring at no other non-leaf vertex. We give an equivalent formulation of Stanley's question in terms of $Φ_T$. Finally, we show that counts of spanning forests with at most $t$ edges cannot distinguish all $k$-vertex trees when $t<\left\lfloor k/2\right\rfloor$, for every $k\ge4$.

math.CO↗