Arrow-Chasing: Techniques and Applications

• Arrow-chasing is a polysemous concept that encapsulates methods for following arrow-based rules in areas such as Ramsey theory, game theory, communication complexity, combinatorics, and topology.
• It employs a range of methodologies, including optimization via MAX-CUT reductions, state isomorphism in impartial play, pointer chasing in distributed computation, and symbolic assembly in combinatorial enumeration.
• These techniques reveal deep interconnections among local rule propagation, global structural behavior, and practical applications in algorithms, robotics pursuit, and data interface processing.

to=arxiv_search 总代理联系 code omitted 北京赛车投注json omitted Arrow-chasing is a polysemous technical term used in several research areas to denote either a property of structures constrained by arrows, a procedure that follows arrows through a system, or a proof technique that reduces global behavior to local arrow-based rules. In contemporary arXiv literature, the term and closely related notions appear in Ramsey theory through graph arrowing and Folkman numbers, in combinatorial game theory through legal edge orientations on trees, in communication complexity through pointer-chasing, in enumerative combinatorics through the arrow product and arrow patterns, in visual proofs on Pascal’s triangle, in welded-knot theory through Arrow calculus, in homological algebra through diagram-chasing in double complexes, and in autonomous pursuit planning where a chaser repeatedly follows a moving target (Lange et al., 2012, Mathews, 2021, Fischer et al., 26 Aug 2025, Panafieu et al., 2019, Fu et al., 5 Jul 2026, Krapf, 22 Aug 2025, Meilhan et al., 2017, Bergman, 2011, Jeon et al., 2019).

1. Ramsey arrowing and Folkman-type graph constructions

In graph theory, arrow-chasing is most literally formalized by Ramsey arrowing notation. For a graph $G$, the relation

$G \to (a_1,\dots,a_k)^e$

means that every edge $k$-coloring of $G$ contains a monochromatic $K_{a_i}$ in some color $i$, and

$G \to (a_1,\dots,a_k)^v$

is defined analogously for vertex colorings. The edge Folkman number

$F_e(a_1,\dots,a_k;p)$

is the minimum order of a graph that arrows $(a_1,\dots,a_k)^e$ while containing no $K_p$; the vertex version $G \to (a_1,\dots,a_k)^e$0 is defined similarly for $G \to (a_1,\dots,a_k)^e$1-free graphs (Lange et al., 2012, Hassan et al., 15 May 2026).

A classical instance is

$G \to (a_1,\dots,a_k)^e$2

the smallest order of a $G \to (a_1,\dots,a_k)^e$3-free graph $G \to (a_1,\dots,a_k)^e$4 such that every red/blue edge-coloring of $G \to (a_1,\dots,a_k)^e$5 yields a monochromatic triangle. The formulation is equivalent to the Erdős–Hajnal question asking whether there exists a $G \to (a_1,\dots,a_k)^e$6-free graph that is not the union of two triangle-free graphs: if the edge set can be partitioned into two triangle-free spanning subgraphs, then the corresponding 2-coloring avoids monochromatic triangles, and conversely a triangle-free 2-coloring gives such a partition (Lange et al., 2012).

The paper "Use of MAX-CUT for Ramsey Arrowing of Triangles" reduces this triangle-arrowing problem to a cut problem on an auxiliary graph $G \to (a_1,\dots,a_k)^e$7. Its vertex set is

$G \to (a_1,\dots,a_k)^e$8

and two vertices $G \to (a_1,\dots,a_k)^e$9 are adjacent exactly when there exists an edge $k$0 such that $k$1 forms a triangle in $k$2. If $k$3 denotes the number of triangles of $k$4, then

$k$5

The central theorem, due to Dudek and Rödl and used in the paper, is

$k$6

where $k$7 is the MAX-CUT value of $k$8 (Lange et al., 2012).

This reduction turns an arrowing statement into an optimization certificate. A 2-edge-coloring of $k$9 is a bipartition of $G$0; each bichromatic triangle of $G$1 contributes exactly $G$2 crossing edges in the induced $G$3 of $G$4, whereas a monochromatic triangle contributes $G$5. Hence a cut of size $G$6 corresponds exactly to a coloring with no monochromatic triangle, while any strict upper bound below $G$7 certifies $G$8 (Lange et al., 2012).

The paper first uses the spectral MAX-CUT bound

$G$9

where $K_{a_i}$0 is the minimum adjacency eigenvalue of $K_{a_i}$1, and then strengthens it using the Goemans–Williamson semidefinite relaxation

$K_{a_i}$2

subject to $K_{a_i}$3. The SDP optimum is used only as an upper bound on $K_{a_i}$4, not for randomized rounding, because certification of arrowing requires an upper certificate rather than a large cut (Lange et al., 2012).

Quantitatively, this program improves the best upper bound on $K_{a_i}$5 from $K_{a_i}$6 to $K_{a_i}$7, and then to $K_{a_i}$8. The 860-vertex graph comes from an induced subgraph of $K_{a_i}$9; the 786-vertex graph $i$0 is obtained from $i$1 by adding one new vertex joined to a specified set of 60 vertices. For $i$2,

$i$3

so $i$4, while SDP computations give an upper bound $i$5, and an additional computation by Rinaldi using SpeeDP improves this to

$i$6

This yields

$i$7

while the paper recalls the lower bound $i$8 (Lange et al., 2012).

Recent work on small Folkman graphs broadens this arrow-chasing landscape for parameters $i$9 and $G \to (a_1,\dots,a_k)^v$0. The paper "On Small Folkman Graphs Arrowing $G \to (a_1,\dots,a_k)^v$1 or $G \to (a_1,\dots,a_k)^v$2" gives new exact values and bounds for both vertex and edge Folkman numbers under forbidden subgraphs such as $G \to (a_1,\dots,a_k)^v$3, $G \to (a_1,\dots,a_k)^v$4, and $G \to (a_1,\dots,a_k)^v$5. Among the new exact values are

$G \to (a_1,\dots,a_k)^v$6

and

$G \to (a_1,\dots,a_k)^v$7

The same paper proves the existence of $G \to (a_1,\dots,a_k)^v$8 by combining a $G \to (a_1,\dots,a_k)^v$9-free graph $F_e(a_1,\dots,a_k;p)$0 with $F_e(a_1,\dots,a_k;p)$1 and the observation that adding one universal vertex converts vertex-arrowing $F_e(a_1,\dots,a_k;p)$2 into edge-arrowing $F_e(a_1,\dots,a_k;p)$3, while preserving $F_e(a_1,\dots,a_k;p)$4-freeness when $F_e(a_1,\dots,a_k;p)$5 is $F_e(a_1,\dots,a_k;p)$6-free (Hassan et al., 15 May 2026).

These results show that in Ramsey theory, arrow-chasing is not merely notation. It is a structural principle: an arrowing statement can be certified by optimization, symmetry-restricted search, extension arguments based on independent sets, SAT unsatisfiability, or by transferring vertex-arrowing to edge-arrowing through universal-vertex constructions (Lange et al., 2012, Hassan et al., 15 May 2026).

2. Games of arrows and impartial play on trees

In combinatorial game theory, "The Game of Arrows on 3-Legged Spider Graphs" defines the Game of Arrows as the tree specialization of Francis Su’s Game of Cycles. A move consists of orienting one previously unmarked edge of a graph, subject to the condition that the resulting partial orientation creates no internal sinks or sources; on trees the cycle-cell victory condition is irrelevant, so the game becomes a finite impartial normal-play game in which the last legal move wins (Mathews, 2021).

For a graph $F_e(a_1,\dots,a_k;p)$7, the set of possible directed edge-marks is

$F_e(a_1,\dots,a_k;p)$8

A decoration $F_e(a_1,\dots,a_k;p)$9 is a partial orientation with at most one direction chosen on each edge. A state is a decoration with no internal sinks or sources. If $(a_1,\dots,a_k)^e$0 denotes the set of legal followers of $(a_1,\dots,a_k)^e$1, then the Sprague–Grundy value is defined by

$(a_1,\dots,a_k)^e$2

For disjoint unions,

$(a_1,\dots,a_k)^e$3

These are the computational foundations of the paper’s arrow-chasing analysis (Mathews, 2021).

A central methodological innovation is state isomorphism. A state isomorphism from a state $(a_1,\dots,a_k)^e$4 of $(a_1,\dots,a_k)^e$5 to a state $(a_1,\dots,a_k)^e$6 of $(a_1,\dots,a_k)^e$7 is a bijection on directed marks of the unmarked subgraphs that commutes with flip and induces a bijection between all descendants of $(a_1,\dots,a_k)^e$8 and all descendants of $(a_1,\dots,a_k)^e$9. This is stronger than matching immediate followers. The local verification mechanism is given by Theorem 4.8: a bijection commuting with flip is a state isomorphism if and only if the induced maps are locally state-preventing at every vertex (Mathews, 2021).

The paper’s main result concerns 3-legged spider graphs $K_p$0. After introducing trimming, which removes leaf obstructions and reduces each positive leg length by $K_p$1, the technical theorem is: $K_p$2 Consequently, for the original Game of Arrows, if $K_p$3 are odd and nonzero, then the initial state on $K_p$4 is a $K_p$5-position, so player two has a winning strategy (Mathews, 2021).

The proof is built by decomposing spider states into path-like subgames. The atomic path states have explicit Grundy values: $K_p$6 where $K_p$7. More elaborate spider states are then reduced to disjoint unions of these pieces. A representative decomposition is

$K_p$8

The final parity argument shows that every follower of an empty even-legged spider has odd Grundy value, so the empty spider itself has Grundy value $K_p$9 (Mathews, 2021).

Here arrow-chasing means chasing legal arrow placements through the game tree, but the paper’s deeper contribution is the replacement of global symmetry arguments by a local equivalence calculus on partially oriented states. This suggests a broader interpretation: in impartial graph-orientation games, arrow-chasing is the process of resolving a complex orientation state into smaller canonical arrow-configurations whose Grundy values are computable (Mathews, 2021).

3. Pointer chasing and communication complexity

In communication complexity, arrow-chasing appears as pointer chasing: Alice and Bob hold alternating parts of a functional directed graph, and the task is to determine the endpoint after $G \to (a_1,\dots,a_k)^e$00 alternations. In the formulation of "Pointer Chasing with Unlimited Interaction", Alice holds $G \to (a_1,\dots,a_k)^e$01, Bob holds $G \to (a_1,\dots,a_k)^e$02, and

$G \to (a_1,\dots,a_k)^e$03

More generally,

$G \to (a_1,\dots,a_k)^e$04

The $G \to (a_1,\dots,a_k)^e$05-step problem can be written as

$G \to (a_1,\dots,a_k)^e$06

where $G \to (a_1,\dots,a_k)^e$07 is fixed and nontrivial (Fischer et al., 26 Aug 2025).

There is a trivial $G \to (a_1,\dots,a_k)^e$08-round protocol: send the current pointer value at each step, for total communication $G \to (a_1,\dots,a_k)^e$09. The paper’s main result is that this protocol remains nearly tight even when the number of rounds is unrestricted. For constant error,

$G \to (a_1,\dots,a_k)^e$10

and for zero error, under $G \to (a_1,\dots,a_k)^e$11,

$G \to (a_1,\dots,a_k)^e$12

The first bound shows that if $G \to (a_1,\dots,a_k)^e$13 for constant $G \to (a_1,\dots,a_k)^e$14, then the trivial $G \to (a_1,\dots,a_k)^e$15 protocol is optimal up to constants (Fischer et al., 26 Aug 2025).

The proofs are reduction-based. The bounded-error lower bound embeds the communication problem

$G \to (a_1,\dots,a_k)^e$16

into a pointer-chasing instance by arranging $G \to (a_1,\dots,a_k)^e$17 gadgets so that the alternating walk checks one queried bit per gadget. The zero-error lower bound reduces from $G \to (a_1,\dots,a_k)^e$18, using the fact that whether a $G \to (a_1,\dots,a_k)^e$19-step alternating walk returns to the starting point distinguishes Hamiltonicity in a union of perfect matchings when $G \to (a_1,\dots,a_k)^e$20 is prime (Fischer et al., 26 Aug 2025).

A second 2025 paper gives a simple deterministic lower bound using a density-invariant round-elimination argument. For the standard $G \to (a_1,\dots,a_k)^e$21-pointer-chasing function on arrays $G \to (a_1,\dots,a_k)^e$22, with Alice seeing $G \to (a_1,\dots,a_k)^e$23, Bob seeing $G \to (a_1,\dots,a_k)^e$24, deterministic $G \to (a_1,\dots,a_k)^e$25-round communication is at least $G \to (a_1,\dots,a_k)^e$26. More strongly, the theorem is formulated for dense restricted domains $G \to (a_1,\dots,a_k)^e$27 with partially fixed coordinates and an “alive” starting pointer condition

$G \to (a_1,\dots,a_k)^e$28

The key invariant is the unfixed density

$G \to (a_1,\dots,a_k)^e$29

and likewise for $G \to (a_1,\dots,a_k)^e$30; fixing a heavy coordinate doubles this density. Repeating the process yields a clean round-elimination contradiction (Viola, 11 Jul 2025).

The communication-complexity literature therefore uses arrow-chasing in its most literal algorithmic sense: one must follow a sequence of dependent arrows through distributed information. The surprising point is that unrestricted interaction does not substantially compress this dependence (Fischer et al., 26 Aug 2025, Viola, 11 Jul 2025).

4. Symbolic, visual, and enumerative arrow methods

A different family of meanings arises when arrows encode local combinatorial structure rather than a path to be followed.

In "Symbolic method and directed graph enumeration", the arrow product is introduced for families $G \to (a_1,\dots,a_k)^e$31 and $G \to (a_1,\dots,a_k)^e$32 of labeled digraphs. The arrow product consists of pairs $G \to (a_1,\dots,a_k)^e$33, with $G \to (a_1,\dots,a_k)^e$34, $G \to (a_1,\dots,a_k)^e$35, relabeled to have disjoint labels, together with an arbitrary set of directed edges from vertices of $G \to (a_1,\dots,a_k)^e$36 to vertices of $G \to (a_1,\dots,a_k)^e$37. The key generating-function rule is: $G \to (a_1,\dots,a_k)^e$38 where $G \to (a_1,\dots,a_k)^e$39 are graphical generating functions. This makes the arrow product a symbolic device for assembling digraphs from strongly connected components and acyclic inter-component wiring (Panafieu et al., 2019).

The same paper derives compact formulas for classical digraph families. For directed acyclic graphs,

$G \to (a_1,\dots,a_k)^e$40

where $G \to (a_1,\dots,a_k)^e$41 marks sources. For strongly connected digraphs,

$G \to (a_1,\dots,a_k)^e$42

More generally, if $G \to (a_1,\dots,a_k)^e$43 is the EGF of a family of allowed strongly connected components, then the GGF of digraphs whose SCCs all lie in $G \to (a_1,\dots,a_k)^e$44 is

$G \to (a_1,\dots,a_k)^e$45

Here arrow-chasing is not path-following but one-way dependency assembly: the arrow product formalizes how arrows may run from one component block to another (Panafieu et al., 2019).

In permutation theory, "When arrow patterns meet classical patterns" studies arrow patterns, introduced to connect one-line notation and cycle notation. An arrow pattern $G \to (a_1,\dots,a_k)^e$46 consists of a word $G \to (a_1,\dots,a_k)^e$47 and arrows $G \to (a_1,\dots,a_k)^e$48; a permutation $G \to (a_1,\dots,a_k)^e$49 contains $G \to (a_1,\dots,a_k)^e$50 when a pattern occurrence in $G \to (a_1,\dots,a_k)^e$51 is compatible with specified map relations in $G \to (a_1,\dots,a_k)^e$52, where $G \to (a_1,\dots,a_k)^e$53 erases parentheses in standard cycle notation. The paper completely enumerates the six classes

$G \to (a_1,\dots,a_k)^e$54

for

$G \to (a_1,\dots,a_k)^e$55

obtaining

$G \to (a_1,\dots,a_k)^e$56

$G \to (a_1,\dots,a_k)^e$57

and

$G \to (a_1,\dots,a_k)^e$58

For the distinct arrow pattern

$G \to (a_1,\dots,a_k)^e$59

the paper proves

$G \to (a_1,\dots,a_k)^e$60

by two independent bijective arguments, one through non-nesting involutions and one through Dyck paths (Fu et al., 5 Jul 2026).

In "Arrow-chasing in Pascal's triangle -- Visual proofs for summation formulas involving binomial coefficients", arrow-chasing becomes an explicitly visual proof technique based only on Pascal’s rule

$G \to (a_1,\dots,a_k)^e$61

with $G \to (a_1,\dots,a_k)^e$62 outside $G \to (a_1,\dots,a_k)^e$63. Two complementary modes are emphasized. Downward arrow-chasing uses Pascal’s rule directly, while upward arrow-chasing uses the weight rule: for a weighted row sum

$G \to (a_1,\dots,a_k)^e$64

moving one row upward preserves the total but replaces the weights by

$G \to (a_1,\dots,a_k)^e$65

This yields visual proofs of identities such as

$G \to (a_1,\dots,a_k)^e$66

$G \to (a_1,\dots,a_k)^e$67

$G \to (a_1,\dots,a_k)^e$68

The paper also develops a subtractive variant based on

$G \to (a_1,\dots,a_k)^e$69

for certain alternating identities (Krapf, 22 Aug 2025).

These works collectively show that in symbolic and enumerative combinatorics, arrow-chasing denotes local rule propagation: arrows organize how weights, dependencies, or structural constraints move through a combinatorial object (Panafieu et al., 2019, Fu et al., 5 Jul 2026, Krapf, 22 Aug 2025).

5. Topological and homological arrow calculi

Arrow-chasing also names local rewriting systems in topology and homological algebra.

In "Arrow calculus for welded and classical links", Arrow calculus encodes a welded or classical link diagram by a crossingless base diagram together with immersed oriented arrows or higher-order $G \to (a_1,\dots,a_k)^e$70-trees. A $G \to (a_1,\dots,a_k)^e$71-tree is a connected uni-trivalent tree immersed in the plane of the diagram, with oriented edges, virtual crossings only, and optional twist decorations. A $G \to (a_1,\dots,a_k)^e$72-tree is a $G \to (a_1,\dots,a_k)^e$73-tree with $G \to (a_1,\dots,a_k)^e$74 tails. An Arrow presentation is a pair $G \to (a_1,\dots,a_k)^e$75, where $G \to (a_1,\dots,a_k)^e$76 has no classical crossings and $G \to (a_1,\dots,a_k)^e$77 is a set of $G \to (a_1,\dots,a_k)^e$78-arrows such that surgery on $G \to (a_1,\dots,a_k)^e$79 along $G \to (a_1,\dots,a_k)^e$80 yields the original diagram (Meilhan et al., 2017).

The calculus is generated by six basic Arrow moves: virtual isotopy, head/tail reversal, tails exchange, isolated arrow, inverse, and slide. The key completeness theorem states that two Arrow presentations represent equivalent diagrams if and only if they are related by Arrow moves. The theory extends from arrows to $G \to (a_1,\dots,a_k)^e$81-tree presentations through the expansion move, which recursively resolves a $G \to (a_1,\dots,a_k)^e$82-tree into $G \to (a_1,\dots,a_k)^e$83-arrows. The $G \to (a_1,\dots,a_k)^e$84-tree version includes higher-order analogues of inverse, slide, head traversal, heads exchange, head–tail exchange, antisymmetry, and the fork move (Meilhan et al., 2017).

An algebraic shadow accompanies the diagrammatics. At a trivalent vertex, incoming labels $G \to (a_1,\dots,a_k)^e$85 induce the commutator label

$G \to (a_1,\dots,a_k)^e$86

Exchange lemmas appear as identities such as

$G \to (a_1,\dots,a_k)^e$87

while the fork relation is

$G \to (a_1,\dots,a_k)^e$88

These formulas make explicit that moving heads and tails past one another introduces higher-degree commutator corrections. In this sense, arrow-chasing is literally the local manipulation of arrow data through a diagram, controlled by exact rewrite rules and graded error terms (Meilhan et al., 2017).

In homological algebra, "On diagram-chasing in double complexes" gives a different but related local calculus. For an object $G \to (a_1,\dots,a_k)^e$89 in a double complex, besides the horizontal and vertical homology objects, Bergman defines two additional subquotients: $G \to (a_1,\dots,a_k)^e$90 where $G \to (a_1,\dots,a_k)^e$91 and $G \to (a_1,\dots,a_k)^e$92 are the diagonal composites into and out of $G \to (a_1,\dots,a_k)^e$93. These are called the receptor and donor. There are canonical intramural maps among $G \to (a_1,\dots,a_k)^e$94, the horizontal and vertical homology at $G \to (a_1,\dots,a_k)^e$95, and $G \to (a_1,\dots,a_k)^e$96, and every arrow $G \to (a_1,\dots,a_k)^e$97 induces an extramural map

$G \to (a_1,\dots,a_k)^e$98

The main local statement, the Salamander Lemma, gives a 6-term exact sequence attached to each arrow; for a horizontal arrow this has the form

$G \to (a_1,\dots,a_k)^e$99

with the vertical analogue for vertical arrows (Bergman, 2011).

Classical “long-distance” diagram chases are then reconstructed as concatenations of these local salamander sequences. The Snake Lemma, the Sharp $k$00 Lemma, and long exact homology sequences become composites of donor–receptor identifications and homology maps. This makes explicit a viewpoint that is often tacit: diagram-chasing is a local transport process through named subquotients, not a mysterious jump between distant corners of a diagram (Bergman, 2011).

A plausible implication is that both papers—despite living in different fields—treat arrow-chasing as a local-to-global technology. In one case arrows are geometric surgery data; in the other they are maps in an abelian category. In both cases global invariants are recovered by systematic motion through a network of local arrow-attached objects (Meilhan et al., 2017, Bergman, 2011).

6. Pursuit, robotics, and systems interfaces

In applied settings, arrow-chasing often returns to literal pursuit.

"Investigating the classical problem of pursuit, in two modes" studies pursuit on a straight line and curved pursuit. In the rotational two-particle model, a fox and a rabbit move with equal speed $k$01, and the rabbit’s velocity makes a constant angle $k$02 with the line joining rabbit and fox. The paper derives coupled equations for the velocity components,

$k$03

and identifies a logarithmic-spiral law in the symmetric $k$04-particle cyclic pursuit setting: $k$05 For a regular $k$06-gon of side length $k$07, the radius evolves as

$k$08

The same spiral relation is proposed for moths circling a lamp under a constant-angle navigation rule (Kalameh et al., 2023).

In autonomous robotics, "Online Trajectory Generation of a MAV for Chasing a Moving Target in 3D Dense Environments" treats target chasing as a real-time planning problem for a multirotor equipped with a vision sensor. The environment is known through an occupancy map, and the target path is previewed over a short horizon

$k$09

The planner’s central visibility quantity is

$k$10

where $k$11 is the Euclidean distance field of obstacles and $k$12 is the line segment from chaser to target. Thus $k$13 means the target is visible, and larger $k$14 means more line-of-sight clearance (Jeon et al., 2019).

The planning architecture is cascaded. A graph-search preplanner first computes visibility-aware waypoints $k$15 and safe chasing corridors by minimizing a sum of interval distance, visibility cost, and tracking-distance error. The transitional visibility term is

$k$16

A second stage then solves a convex QP for a piecewise-polynomial minimum-jerk trajectory inside the chasing corridors, minimizing

$k$17

subject to initial conditions, $k$18 continuity, and corridor membership (Jeon et al., 2019).

The method is evaluated in the “mini garden” and “complex city” environments. With horizon $k$19 s, average total runtime is $k$20 s in the mini garden and $k$21 s in the complex city, corresponding to about $k$22 Hz replanning. Increasing the visibility weight $k$23 improves average visibility and reduces occlusion duration, at the cost of longer travel distance (Jeon et al., 2019).

A different systems use of “Arrow” appears in data processing rather than pursuit. "Zero-Cost, Arrow-Enabled Data Interface for Apache Spark" introduces Arrow-Spark, a Spark FileFormat integration that uses the Apache Arrow Dataset API as a data layer. The system routes data through Arrow IPC messages and JNI into Spark’s ColumnarBatch abstraction. The paper’s empirical claim is that consuming data through Apache Arrow is “zero-cost” in the sense that performance is on par with or better than native Spark for the tested workloads. In particular, for CSV ingestion the implementation is reported to be approximately $k$24 faster than Spark, while the batch-size study identifies $k$25 rows—corresponding to $k$26 KB for rows of four 64-bit integers—as the best-performing size on the evaluated hardware (Rodriguez et al., 2021).

This systems usage is semantically distinct from Ramsey arrowing or pointer chasing, but it still fits the broad encyclopedia pattern: arrow-chasing names technical workflows in which arrows or arrow-like interfaces mediate the transport of information, visibility, or structure across a constrained architecture (Jeon et al., 2019, Rodriguez et al., 2021).