K-value: Algorithm Benchmarks & Kaon Decays

• K-value is defined in parameterized complexity as the largest integer k₀ for which the algorithm's running time remains below 10²⁰, serving as a benchmark for practical feasibility.
• In hadronic phenomenology, F_K and F_K' denote the weak decay coefficients of the kaon and its first radial excitation, derived from the extended NJL model.
• Understanding K-value reveals its dual role in measuring algorithm efficiency and elucidating kaon decay dynamics, bridging discrete mathematics and particle physics.

Searching arXiv for the cited papers and closely related terminology. arXiv search query: id:(Zehavi, 2015) OR all:"k-Leaf Spanning Tree Problem Admits a Klam Value of 39" In the arXiv literature under consideration, the label associated with “K-value” appears in two distinct technical senses. In parameterized complexity, it refers to the klam value of an algorithm for the $k$-Leaf Spanning Tree problem, namely the largest integer $k_0$ such that the parameter dependence $f(k)$ in a running time $O^*(f(k))$ satisfies $f(k)<10^{20}$ for all $0\le k\le k_0$ (Zehavi, 2015). In hadronic phenomenology, the symbols $F_K$ and $F_K'$ denote the weak decay coefficients of the kaon and of the first radial excitation $K(1460)$ in the extended NJL model (Volkov et al., 2019). The two usages belong to different domains and should not be conflated.

1. Scope of the term in different research contexts

The parameterized-complexity usage arises from the $k$-Leaf Spanning Tree ($k_0$0-LST) problem, which asks whether an undirected graph $k_0$1 contains a spanning tree with at least $k_0$2 leaves. Here $k_0$3 is the parameter, and the central quantitative object is the klam value attached to a parameterized running time (Zehavi, 2015).

The hadronic-physics usage arises in the study of the decays $k_0$4 and $k_0$5 in the extended NJL model. In that setting, the quantities of interest are the weak decay coefficients $k_0$6 and $k_0$7, extracted from amplitudes and decay widths involving the kaon, the first radial excitation $k_0$8, and the axial-vector mesons $k_0$9, $f(k)$0, and $f(k)$1 (Volkov et al., 2019).

A common source of ambiguity is that the same letter $f(k)$2 indexes conceptually different objects. In the algorithmic setting, it appears in the name of the problem parameter and in the phrase “klam value.” In the hadronic setting, it labels kaonic states and their weak decay coefficients. This suggests that “K-value” is not a single standardized technical term across these literatures.

2. Klam value in parameterized complexity

For a parameterized algorithm with running time $f(k)$3, the klam value is defined as the largest integer $f(k)$4 such that

$f(k)$5

The $f(k)$6 notation suppresses factors polynomial in $f(k)$7 (Zehavi, 2015).

The threshold $f(k)$8 was suggested in the very first parameterized-algorithm papers as a yardstick of practical feasibility: a running time $f(k)$9 is already astronomically large, so showing $O^*(f(k))$0 up to $O^*(f(k))$1 attests that the method is “reasonable” for all $O^*(f(k))$2 (Zehavi, 2015).

This definition separates the parameterized exponent base from the problem parameter itself. The parameter is $O^*(f(k))$3, whereas the klam value is a derived benchmark for a specific algorithmic dependence on $O^*(f(k))$4. In the case of $O^*(f(k))$5-LST, the 2015 result gives an $O^*(f(k))$6-time algorithm, which yields a klam value of $O^*(f(k))$7 because

$O^*(f(k))$8

3. Historical progression for the $O^*(f(k))$9-Leaf Spanning Tree problem

The $f(k)<10^{20}$0-LST problem has been extensively studied over the past three decades. In 2000, Fellows et al. explicitly asked whether one can obtain a klam value of $f(k)<10^{20}$1. From 2000 to 2010, improved branching and measure-and-conquer methods steadily raised the klam value from $f(k)<10^{20}$2 to $f(k)<10^{20}$3, and the 2010 algorithm of Binkele-Raible and Fernau first reached a klam value of $f(k)<10^{20}$4, with running time $f(k)<10^{20}$5 (Zehavi, 2015).

Reference	klam value	Running time
Fellows et al. [FL88]	0	FPT (non-constructive)
Bodlaender [B89]	1	$f(k)<10^{20}$6
Fellows et al. [DF95]	5	$f(k)<10^{20}$7
Fellows et al. [FMRS00]	17	$f(k)<10^{20}$8
Bonsma, Björklund et al. [BBW03]	20	$f(k)<10^{20}$9
Estivill-Castro et al. [ECFLR05]	22	$0\le k\le k_0$0
Bonsma et al. [BBW08]	24	$0\le k\le k_0$1
Kneis et al. [KLR08]	33	$0\le k\le k_0$2
Daligault et al. [DGKY08]	35	$0\le k\le k_0$3
Binkele-Raible & Fernau [RF10]	37	$0\le k\le k_0$4
This paper	39	$0\le k\le k_0$5

The 2015 result pushes the benchmark from $0\le k\le k_0$6 to $0\le k\le k_0$7. The paper describes this as a solid step toward the open question of reaching klam $0\le k\le k_0$8 (Zehavi, 2015).

4. The $0\le k\le k_0$9 algorithm and the attainment of klam value 39

The algorithm constructs a partial spanning tree $F_K$0 and maintains three distinguished sets of leaves: $F_K$1 for fixed leaves, $F_K$2 for floating leaves, and $F_K$3 for marked leaves. At each recursive call the instance is represented as $F_K$4 together with the remaining quota $F_K$5. The analysis uses the measure

$F_K$6

Initially $F_K$7, and once $F_K$8, the current partial tree already guarantees at least $F_K$9 leaves, so the algorithm accepts in polynomial time (Zehavi, 2015).

Each reduction or branching rule either rejects or accepts immediately, or decreases the measure by a positive amount. A branching rule is analyzed through a branching vector $F_K'$0, where branch $F_K'$1 decreases the measure by $F_K'$2. If $F_K'$3 is the unique positive root of

$F_K'$4

then standard recurrence arguments bound the contribution of that rule by $F_K'$5 whenever $F_K'$6. Since $F_K'$7, proving $F_K'$8 for all branching rules yields $F_K'$9 (Zehavi, 2015).

The main new ingredient is the dependency claim. Informally, as the algorithm assigns vertices to be leaves or internal vertices, some assignments become impossible because they would contradict earlier branching decisions. The invariant records that when a node $K(1460)$0 first became internal, its parent $K(1460)$1 must be internal in any global solution consistent with that branch. If $K(1460)$2 has a single sibling $K(1460)$3 in $K(1460)$4, then $K(1460)$5 is maintained to be unmarked and to have exactly one attachment path available. This history-dependent invariant is used to prune subbranches that would otherwise be explored (Zehavi, 2015).

Two representative rules illustrate the method. In Rule 8 (Reachability reduction), if a vertex $K(1460)$6 can be reached only through a single leaf-candidate $K(1460)$7, then $K(1460)$8 must become internal; the algorithm grafts the remaining neighbors of $K(1460)$9 onto $k$0, removes $k$1 from $k$2, and decreases the measure by at least $k$3. In Rule 37 (Two-leaf branching), if sibling leaves $k$4 each have exactly two neighbors outside $k$5 with disjoint neighborhoods, the algorithm branches into four exhaustive cases: both leaves, one leaf and one internal in two symmetric ways, and both internal. The branching vector is at least $k$6, with positive root approximately $k$7, and $k$8 (Zehavi, 2015).

By systematically verifying all rules, the worst-case branching factor is bounded by $k$9. The overall runtime is therefore

$k_0$00

and the algorithm uses polynomial space. Since $k_0$01, the algorithm’s klam value is exactly $k_0$02, and the problem admits a klam value of $k_0$03 (Zehavi, 2015).

5. $k_0$04 and $k_0$05 as kaon weak decay coefficients

In the extended NJL model, the quantities $k_0$06 and $k_0$07 are the weak decay coefficients of the kaon ground state and the first radial excitation $k_0$08. The calculation uses constituent quark masses

$k_0$09

together with two cutoffs,

$k_0$10

Ground-state and radially excited pseudoscalar and axial-vector interactions are introduced through the extended NJL Lagrangian, with form factors $k_0$11, parameter

$k_0$12

and mixing angles

$k_0$13

(Volkov et al., 2019).

The basic loop integrals are

$k_0$14

and

$k_0$15

The ground-state couplings satisfy

$k_0$16

Because the pseudoscalar $k_0$17 can fluctuate via the axial-vector nonet back into $k_0$18, one has

$k_0$19

where the SU(3) mixing angle is $k_0$20, with physical masses $k_0$21 and $k_0$22. Numerically,

$k_0$23

The weak interaction is introduced through

$k_0$24

Writing the hadronic current as

$k_0$25

the standard NJL model gives the well-known relation

$k_0$26

In the extended variant,

$k_0$27

Here $k_0$28 is the contact term, $k_0$29 is the contribution from $k_0$30 and $k_0$31, and $k_0$32 is the contribution from the radially excited pole $k_0$33 (Volkov et al., 2019).

6. Numerical values, comparison, and significance

For a pseudoscalar meson $k_0$34, the decay width is

$k_0$35

Accordingly, once $k_0$36 or $k_0$37 is known, the width follows immediately, and conversely $k_0$38 can be read off from the measured $k_0$39 width (Volkov et al., 2019).

By varying the phase $k_0$40 of the $k_0$41 contribution, the best overall fit to

$k_0$42

and

$k_0$43

is obtained for $k_0$44. The resulting predictions are:

Quantity	Value
$k_0$45	$k_0$46
$k_0$47	$k_0$48
$k_0$49	$k_0$50
$k_0$51	$k_0$52
$k_0$53	$k_0$54
$k_0$55	$k_0$56

These values reproduce the PDG value

$k_0$57

to better than $k_0$58. Lattice QCD with $k_0$59 gives $k_0$60–$k_0$61; light-front quark models give $k_0$62–$k_0$63; and improved holographic models predict $k_0$64–$k_0$65. The NJL result lies in the same $k_0$66 window (Volkov et al., 2019).

The estimated theoretical uncertainty is $k_0$67. The sources identified are cutoff dependence, constituent masses, mixing angles, and the relative phase $k_0$68 of the radially excited pole. Varying $k_0$69 and $k_0$70 by $k_0$71 shifts $k_0$72 by at most $k_0$73; a $k_0$74 change in $k_0$75 modifies $k_0$76 by $k_0$77–$k_0$78; uncertainties of $k_0$79 in $k_0$80, $k_0$81, and $k_0$82 produce a similar $k_0$83–$k_0$84 variation; and different choices of $k_0$85 can shift $k_0$86 by as much as $k_0$87, while affecting $k_0$88 only at the $k_0$89 level (Volkov et al., 2019).

The phenomenological implications are stated explicitly. The agreement of $k_0$90 with lattice and experiment confirms that extended NJL dynamics correctly encodes chiral-symmetry breaking and the role of axial-vector resonances. Since $k_0$91 enters Standard Model predictions for leptonic kaon decays such as $k_0$92, it can serve as an independent theoretical input in tests of lepton flavor universality. The ratio

$k_0$93

with $k_0$94 in the same model agrees at the few-percent level with lattice and ChPT values $k_0$95, and the predicted constant $k_0$96 together with

$k_0$97

is proposed as a target for future $k_0$98-factory measurements (Volkov et al., 2019).