Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0906.1780

Fine-Wilf graphs and the generalized Fine-Wilf theorem

Stuart A. Rankin
View original source ↗Read source document ↗Export metadata ↓

Abstract

In 1962, R. C. Lyndon and M. P. Shutzenberger established that for any positive integers r and s, any sequence of length at least r+s that is both r-periodic and s-periodic is then (r,s)-periodic. Shortly thereafter (1965), N. J. Fine and H. S. Wilf proved that for any positive integers r and s, if a is an infinite seqeunce of period r and b is an infinite sequence of period s such that a_i=b_i for all i with 1\le i\le r+s-(r,s), then a=b. This is equivalent to the following result, which is commonly referred to as the Fine-Wilf theorem: for any positive integers r and s, if w is a finite sequence that is both r-periodic and s-periodic, and |w|\ge r+s-(r,s), then w is (r,s)-periodic. The Fine-Wilf theorem was generalized to finite sequences with three periods by M. G. Castelli, F. Mignosi, and A. Restivo, and in general by J. Justin, and even more broadly by R. Tijdeman and L. Zamboni. They introduced functions f and fw from the set of all sequences of nonnegative integers to the set of positive integers, and they proved that for a sequence p=(p_1,p_2,...,p_n), a finite sequence w with periods p_i, i=1,2,..., n and length at least fw(p) must be (p)-periodic as well, and that there exists a sequence w of length fw(p)-1 that is p_i-periodic for all i, but not (p)-periodic. In this paper, we follow ideas introduced by S. Constantinescu and L. Ilie to obtain an alternative formulation of f and fw, and we establish important properties of f and fw, obtaining in particular new upper and lower bounds for each. We also begin an investigation of Fine-Wilf graphs for arbitrary finite sequences.

Explore related subjects

math.COmath.NT

Keep this discovery

BibTeXRIS

Stuart A. Rankin. 2009-06-09. Fine-Wilf graphs and the generalized Fine-Wilf theorem. https://arxiv.org/abs/0906.1780

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Balanced even cycles in signed graphs:Tur\'an bounds, double covers, and parity obstructions

We study Tur\'an problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the signed and ordinary Tur\'an numbers differ by at most a factor of two. Our main structural results concern the underlying graphs that admit a signing in which every $2k$-cycle is unbalanced. We characterize these graphs by the absence of an odd dependence among their $2k$-cycle incidence vectors, give a cohomological formulation, and construct subgraph-minimal obstructions of arbitrarily large order. In particular, there is no finite forbidden-subgraph characterization. We also give an exact closed-walk criterion for cycles in double covers and derive a direct signed breadth-first-search upper bound. As applications, we prove \[ \hex(n,C_{+4})=\left(\frac{\sqrt2}{2}+o(1)\right)n^{3/2} \] and study the signed hexagon number $R_6(n)=\hex(n,\{C_{-3},C_{+6}\})$. We characterize the underlying graphs counted by $R_6$ and express it as an extremal problem for ordinary $C_6$-free graphs with a prescribed involution. For every sufficiently large $n$, we construct examples with $\Omega(n^{4/3})$ edges, and we give an equivariant construction attaining the coefficient obtained from the F\"uredi--Naor--Verstra\"ete lower bound by double-cover transfer. Finally, we give $n$-vertex $C_{+10}$-free signed graphs with $\Omega(n^{6/5})$ edges and use octagon examples to illustrate the limitations of theta-freeness as a signing criterion.

math.CO↗
arXiv2026

Fractional DP-colorings of $d$-degenerate locally sparse graphs

Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $\chi_f^{\mathrm{DP}} \le (1 + o(1))\frac{d}{\log d}$, and that this bound is optimal---a stark contrast to ordinary fractional coloring. In this paper, we extend this upper bound to all $d$-degenerate triangle-free graphs, proving that $\chi_f^{\mathrm{DP}} \le (4 + o(1))\frac{d}{\log d}$. This generalizes a recent result of Martinsson and Steiner (2025) for ordinary fractional coloring. We derive this result as a corollary of a more general upper bound concerning locally sparse graph orderings. Specifically, a $d$-degenerate graph $G$ is left $k$-locally-sparse if it admits a degeneracy ordering in which, for every vertex $v$, the subgraph induced by its back-neighbors contains at most $k$ edges. We show that if a $d$-degenerate graph $G$ is left $\frac{d^2}{f}$-locally-sparse, then \[ \chi_f^{\mathrm{DP}}(G) \le (8 + o(1))\frac{d}{\log f}. \] This immediately yields an identical upper bound on the ordinary fractional chromatic number $\chi_f(G)$, improving upon the leading constants of previously known bounds. Additionally, we establish the asymptotic sharpness of this result up to the leading constant. For any $1 \ll f \le d^2$, we construct $d$-degenerate graphs that are left $\frac{d^2}{f}$-locally-sparse and satisfy $\chi_f(G) \ge (1 - o(1))\frac{d}{\log f}$. Finally, as applications of our main theorem, we obtain improved upper bounds on the fractional DP-chromatic number of $d$-degenerate $K_{1,t,t}$-free graphs, as well as $K_{t,t,t}$-free graphs with maximum degree $\Delta$. Notably, these bounds improve upon existing results even in the setting of ordinary fractional coloring.

math.CO↗
arXiv2026

Erd\H{o}s-S\'{o}s for digraphs

It is shown that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but opposite arcs are permitted. The bound is sharp for each fixed oriented tree, as witnessed by disjoint unions of complete bidirected graphs. Previously, such tight bounds were not known, even just for directed paths. This can be considered as a directed analog of the recently proved Erd\H{o}s-S\'os conjecture. The result was proved by GPT-6 Astra.

math.CO↗