arXiv subjects
Publications and source records attributed to Aaron Slobodin.
We establish upper and lower bounds for the 2-limited broadcast domination number of various grid graphs, in particular the Cartesian product of two paths, a path and a cycle, and two cycles. The upper bounds are derived by explicit constructions. The lower bounds are obtained via linear programming duality by finding lower bounds for the fractional 2-limited multipacking numbers of these graphs.
We establish exact values for the $2$-limited broadcast domination number of various grid graphs, in particular $C_m\square C_n$ for $3 \leq m \leq 6$ and all $n\geq m$, $P_m \square C_3$ for all $m \geq 3$, and $P_m \square C_n$ for $4\leq m \leq 5$ and all $n \geq m$. We also produce periodically optimal values for $P_m \square C_4$ and $P_m \square C_6$ for $m \geq 3$, $P_4 \square P_n$ for $n \geq 4$, and $P_5 \square P_n$ for $n \geq 5$. Our method completes an exhaustive case analysis and eliminates cases by combining tools from linear programming with various mathematical proof techniques.
Given an homogeneous monomial ideal $I$, we provide a question- and example-based investigation of the stabilization patterns of the Betti tables shapes of $I^d$ as we vary $d$. We build off Whieldon's definition of the stabilization index of $I$, Stab$(I)$, to define the stabilization sequence of $I$, StabSeq$(I)$, and use it to explore changes in the shapes of the Betti tables of $I^d$ as we vary $d$. We also present the stabilization indices and sequences of the collection of ideals $\{I_{n}\}$ where $I_{n}=(a^{2n}b^{2n}c^{2n},b^{4n}c^{2n},a^{3n}c^{3n},a^{6n-1}b)\subseteq \Bbbk[a,b,c]$.