SearcharxivSearch

arXiv subjects

Xiangjie Yi

Publications and source records attributed to Xiangjie Yi.

2 recordsLinked to original sources

An Almost-Covering Threshold for Golomb-Ruler Difference Packings

For a fixed integer $t\geq 3$, consider families of $t$-mark Golomb rulers whose positive-difference sets are pairwise disjoint and contained in $[1,U]$. Let $P_t(U)$ be the largest number of integers covered by such a family. We determine the threshold for asymptotically complete coverage: \[ P_t(U)=U-o(U) \quad\Longleftrightarrow\quad 3\leq t\leq 5. \] The cases $t=3,4$ follow from the known existence spectra for perfect difference families. For $t=5$, Wild's product construction, in the form recorded by Mathon and applied to perfect families of orders $121$ and $161$, gives a multiplicative semigroup of exact-covering scales; an elementary density lemma on its logarithms then supplies a scale $(1-o(1))U$ below every sufficiently large $U$. For the converse, we give a self-contained one-frequency Fourier obstruction. If $x_0\in(π,3π/2)$ is the first positive solution of $\tan x=x$ and \[ γ_0=-\frac{2\sin x_0}{x_0}=0.4344672564\ldots, \] then, for every fixed $t\geq 6$, \[ \liminf_{U\to\infty}\left(1-\frac{P_t(U)}{U}\right) \geq \frac{(t-1)γ_0-2}{2(t-2)}. \] In particular, the forced gap for six-mark rulers is at least $2.1542035\%$. We also prove a discrete small-difference bound which yields a stronger obstruction for every $t\geq14$ and forces a gap of \[ \frac12-\frac1{\sqrt t}-\frac7{8t}+O(t^{-3/2}) \] as $t\to\infty$.

math.CO

A Linear Lower Bound for Dominating Sets in $k$-Majority Tournaments

A $k$-majority tournament on a finite vertex set is defined by $2k-1$ linear orders, with $u\to v$ when $u$ lies above $v$ in at least $k$ of the orders. Let $F(k)$ be the maximum, over all $k$-majority tournaments, of the size of a minimum dominating set. Alon, Brightwell, Kierstead, Kostochka, and Winkler proved that $C_1k/\log k \leq F(k) \leq C_2k\log k$ for suitable positive constants $C_1$ and $C_2$. In this paper, we prove the linear lower bound $F(k)\ge \left\lfloor\frac{k+1}{2}\right\rfloor $ for $k\ge 3$.

math.CO