Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rudenko's Quadrangular Polylogarithms

Updated 5 July 2026
  • Rudenko’s quadrangular polylogarithms are defined by alternating sums of motivic correlators over even-sided polygon configurations, capturing key cluster polylogarithmic structures.
  • They provide a canonical generating family for type A cluster varieties and precisely describe the intrinsic depth-2 components in the Lie coalgebra of multiple polylogarithms.
  • Their interpretations span functional equations, geometric volume formulas, and applications in Feynman integrals and de Sitter cosmology.

Searching arXiv for the cited papers and related work on quadrangular polylogarithms. Rudenko’s quadrangular polylogarithms are motivic polylogarithmic functions attached to configurations of $2n+2$ points on P1\mathbb{P}^1, equivalently to even-sided polygons and their quadrangulations. In the formulation of Matveiakin–Rudenko, they are specific alternating sums of motivic correlators CorL\mathrm{Cor}^L, indexed by sequences of vertices with a parity constraint, and they define cluster polylogarithms on the type AA cluster varieties M0,2n+2\mathfrak{M}_{0,2n+2} (Matveiakin et al., 2022). In weight $4$, the same sector appears in the Lie-coalgebraic model of multiple polylogarithms as the depth-$2$ generators [x,y]3,1[x,y]_{3,1}, identified with the Goncharov–Rudenko symbol {x,y}3,1\{x,y\}_{3,1} up to depth-$1$ corrections, so that the “quadrangular” part is precisely the first genuinely new nonclassical layer beyond the Bloch groups (Greenberg et al., 2022).

1. Definition by alternating correlator sums

For integers P1\mathbb{P}^10 and P1\mathbb{P}^11, let P1\mathbb{P}^12 be the set of all nondecreasing sequences

P1\mathbb{P}^13

such that each even number P1\mathbb{P}^14 appears at most once. Let P1\mathbb{P}^15 consist of those sequences for which, for every pair P1\mathbb{P}^16, at least one of the two indices appears. The sign is defined by

P1\mathbb{P}^17

For P1\mathbb{P}^18, the quadrangular polylogarithm of weight P1\mathbb{P}^19 is

CorL\mathrm{Cor}^L0

and the symmetrized quadrangular polylogarithm is obtained by summing over CorL\mathrm{Cor}^L1 instead of CorL\mathrm{Cor}^L2 (Matveiakin et al., 2022).

This definition places quadrangular polylogarithms directly in the Lie coalgebra CorL\mathrm{Cor}^L3 of motivic multiple polylogarithms. In that setting, CorL\mathrm{Cor}^L4 denotes the motivic correlator, and motivic iterated integrals are written as

CorL\mathrm{Cor}^L5

The weight is CorL\mathrm{Cor}^L6, while the polygon underlying CorL\mathrm{Cor}^L7 has CorL\mathrm{Cor}^L8 vertices, so the same construction simultaneously tracks transcendental weight and polygonal combinatorics (Matveiakin et al., 2022).

The term “quadrangular” refers to the quadrangulation model. For a convex CorL\mathrm{Cor}^L9-gon with vertices AA0, Rudenko’s quadrangulation formula states

AA1

where AA2 is the set of quadrangulations of the polygon, and AA3 is the dual tree whose vertices correspond to quadrilaterals (Matveiakin et al., 2022). Each quadrilateral contributes a cross-ratio, and the full function is a sum over all noncrossing decompositions into quadrilaterals. That combinatorial origin is the source of both the terminology and the symmetry properties.

Quadrangular polylogarithms are projectively invariant. They depend on the configuration of points only through projective equivalence, so they naturally descend from AA4 to AA5 (Matveiakin et al., 2022). This projective invariance is essential: it distinguishes them from bare iterated integrals AA6, which are only affine invariant.

2. Cluster-polylogarithmic interpretation on type AA7 varieties

The ambient cluster varieties are the type AA8 spaces AA9 and their quotients M0,2n+2\mathfrak{M}_{0,2n+2}0. In the polygon model, cluster variables are the Plücker coordinates M0,2n+2\mathfrak{M}_{0,2n+2}1, with noncrossing chords corresponding to cluster-compatible variables. An element of the tensor algebra on cluster variables is called cluster adjacent if all letters in each tensor lie in a single cluster, and it is integrable if Chen’s condition is satisfied in the form

M0,2n+2\mathfrak{M}_{0,2n+2}2

for every M0,2n+2\mathfrak{M}_{0,2n+2}3 (Matveiakin et al., 2022).

Quadrangular polylogarithms are cluster polylogarithms in the precise sense that their symbols lie in the space M0,2n+2\mathfrak{M}_{0,2n+2}4 of cluster integrable symbols. Proposition 2.10 in Matveiakin–Rudenko states that

M0,2n+2\mathfrak{M}_{0,2n+2}5

so the symbol simultaneously satisfies cluster adjacency and Chen integrability (Matveiakin et al., 2022). In particular, the symbol is a linear combination of tensors in M0,2n+2\mathfrak{M}_{0,2n+2}6 of Plücker coordinates, with only weakly separated variables appearing together.

The classification theorem for type M0,2n+2\mathfrak{M}_{0,2n+2}7 gives quadrangular polylogarithms a canonical role. For M0,2n+2\mathfrak{M}_{0,2n+2}8 and M0,2n+2\mathfrak{M}_{0,2n+2}9,

$4$0

and $4$1 is generated by symbols of quadrangular polylogarithms

$4$2

(Matveiakin et al., 2022). Thus, in type $4$3, quadrangular polylogarithms span all cluster polylogarithms.

The same theme reappears in later work on de Sitter wavefunctions: the symbol of the chain-graph wavefunction is stated to satisfy total compatibility with the $4$4 cluster algebra, and Rudenko’s quadrangular polylogarithms provide, by construction, a complete basis for such functions (Ferro et al., 7 May 2026). In that paper, “total compatibility” is stronger than ordinary cluster adjacency: all letters in every symbol term belong simultaneously to a single cluster. Rudenko’s construction achieves this because each contribution is attached to one quadrangulation, hence to one maximal compatible family of chords.

A plausible implication is that quadrangular polylogarithms occupy for type $4$5 cluster geometry the role that classical polylogarithms occupy for the Bloch group: they are not merely examples of cluster polylogarithms, but the canonical generating family singled out by the geometry of $4$6.

3. Weight $4$7, depth $4$8, and the Lie coalgebra of multiple polylogarithms

In the Lie-coalgebraic approach to multiple polylogarithms, the graded Lie coalgebra $4$9 is generated by symbols

$2$0

with a cobracket $2$1 transplanted from Goncharov’s coproduct on motivic multiple polylogarithms (Greenberg et al., 2022). The resulting relations encode inversion, shuffle, and specialization identities. Within this structure, the weight-$2$2 depth-$2$3 sector is the first genuinely new one.

Goncharov–Rudenko’s concrete model in weights $2$4 uses generators $2$5 and $2$6, with a quadrangular relation $2$7 in weight $2$8. The comparison map

$2$9

satisfies

[x,y]3,1[x,y]_{3,1}0

and crucially

[x,y]3,1[x,y]_{3,1}1

Hence the Goncharov–Rudenko quadrangular symbol [x,y]3,1[x,y]_{3,1}2 is realized inside the Lie coalgebra as a depth-[x,y]3,1[x,y]_{3,1}3 symbol [x,y]3,1[x,y]_{3,1}4 plus depth-[x,y]3,1[x,y]_{3,1}5 corrections (Greenberg et al., 2022).

This identification is decisive for the meaning of “quadrangular polylogarithm” in weight [x,y]3,1[x,y]_{3,1}6. The weight-[x,y]3,1[x,y]_{3,1}7 piece [x,y]3,1[x,y]_{3,1}8 is generated, up to torsion, by [x,y]3,1[x,y]_{3,1}9 and {x,y}3,1\{x,y\}_{3,1}0. By contrast, in weights {x,y}3,1\{x,y\}_{3,1}1 and {x,y}3,1\{x,y\}_{3,1}2, depth-{x,y}3,1\{x,y\}_{3,1}3 symbols are reducible to depth {x,y}3,1\{x,y\}_{3,1}4. Example 2.2 gives

{x,y}3,1\{x,y\}_{3,1}5

and Proposition 2.8 expresses weight-{x,y}3,1\{x,y\}_{3,1}6 depth-{x,y}3,1\{x,y\}_{3,1}7 and depth-{x,y}3,1\{x,y\}_{3,1}8 classes in depth {x,y}3,1\{x,y\}_{3,1}9 (Greenberg et al., 2022). In weight $1$0, however, the relation

$1$1

shows that the depth-$1$2 generators $1$3 are intrinsic and cannot all be eliminated (Greenberg et al., 2022).

The same weight-$1$4 sector is central in Gangl’s reduction theory for multiple polylogarithms of weight $1$5. There the depth-$1$6 iterated integral $1$7 has symbol

$1$8

so $1$9 is the symbol-theoretic avatar of P1\mathbb{P}^100 in P1\mathbb{P}^101 (Gangl, 2016). This is the same quadratic dilogarithmic content that the quadrangular sector isolates motivically.

Accordingly, the paper on the Lie coalgebra of multiple polylogarithms states that all quadrangular functional equations satisfied by P1\mathbb{P}^102 are realized inside the larger Lie coalgebra as consequences of the general relation system P1\mathbb{P}^103, and that the comparison map sends the GR relation P1\mathbb{P}^104 to an element of P1\mathbb{P}^105 (Greenberg et al., 2022). Quadrangular polylogarithms are therefore not peripheral constructions; they are the canonical description of the first nonclassical piece of P1\mathbb{P}^106.

4. Functional equations and polygonal generalizations

The central functional equation for quadrangular polylogarithms is the quadrangular relation

P1\mathbb{P}^107

valid for P1\mathbb{P}^108 (Matveiakin et al., 2022). Its proof uses a generating function

P1\mathbb{P}^109

together with the identity

P1\mathbb{P}^110

which implies the absence of monomials of total degree P1\mathbb{P}^111 (Matveiakin et al., 2022).

Combined with the quadrangulation formula, this single identity recovers classical relations. For P1\mathbb{P}^112 it gives Abel’s 5-term relation for the dilogarithm; for P1\mathbb{P}^113 it yields Kummer’s 9-term and Goncharov’s 22-term relations for P1\mathbb{P}^114; for P1\mathbb{P}^115 it yields the P1\mathbb{P}^116 relation from Goncharov–Rudenko and Gangl’s 931-term relation for P1\mathbb{P}^117 (Matveiakin et al., 2022). In this sense, the quadrangular relation is a uniform generator of a large class of classical and higher functional equations.

Gangl’s weight-P1\mathbb{P}^118 work gives a complementary description. Goncharov’s conjecture is formulated there as the statement that for any 5-term relation P1\mathbb{P}^119,

P1\mathbb{P}^120

modulo products. Theorem 4.2 proves this explicitly for the standard five-term relation P1\mathbb{P}^121 with a sum of P1\mathbb{P}^122 tetralogarithms (Gangl, 2016). That result supplies the weight-P1\mathbb{P}^123 reduction theory behind the quadrangular relation.

The polygonal program extends beyond weight P1\mathbb{P}^124. The paper on “Functional equations of polygonal type” presents identities in weights P1\mathbb{P}^125 that generalize the crucial identity P1\mathbb{P}^126. These identities are built from polyangulations of convex P1\mathbb{P}^127-gons by even polygons and have highest-depth terms consisting of a single iterated integral P1\mathbb{P}^128, evaluated at all possible full quadrangulations of a P1\mathbb{P}^129-gon up to cyclic symmetry (Charlton et al., 2020). In particular, P1\mathbb{P}^130 yields depth reduction of P1\mathbb{P}^131, P1\mathbb{P}^132 reduces P1\mathbb{P}^133, and P1\mathbb{P}^134 reduces P1\mathbb{P}^135 (Charlton et al., 2020). This shows that the quadrangular identity is the first member of a broader polygonal hierarchy.

A plausible implication is that the quadrangular sector is not only the first nontrivial case of higher cluster polylogarithms, but also the template for systematically organized functional equations in all higher weights.

5. Geometric, analytic, and physical realizations

Rudenko’s quadrangular polylogarithms have a direct geometric realization in hyperbolic geometry. In the study of hyperbolic orthoschemes, a bijection is established between P1\mathbb{P}^136-dimensional orthoschemes and configurations

P1\mathbb{P}^137

with Gram matrix entries expressed through the P1\mathbb{P}^138 (Ren et al., 2023). Rudenko’s volume formula states that for an odd-dimensional hyperbolic orthoscheme P1\mathbb{P}^139,

P1\mathbb{P}^140

where P1\mathbb{P}^141 is an arborification word built recursively from generalized cross-ratios of even subsets, P1\mathbb{P}^142 is an alternating multiple polylogarithm, and P1\mathbb{P}^143 is Goncharov’s real period map (Ren et al., 2023).

In this context, the “quadrangular” structure is literal: the basic letters are four-point cross-ratios such as

P1\mathbb{P}^144

and for six points the arborification produces explicit combinations of depth-P1\mathbb{P}^145 words whose entries are products of four-point cross-ratios (Ren et al., 2023). For P1\mathbb{P}^146, the orthoscheme volume becomes a combination of P1\mathbb{P}^147; for P1\mathbb{P}^148, of P1\mathbb{P}^149 and P1\mathbb{P}^150 (Ren et al., 2023). Thus, alternating quadrangular polylogarithms furnish explicit formulas for volumes.

The same construction leads to explicit one-loop scalar P1\mathbb{P}^151-gon Feynman integrals in P1\mathbb{P}^152 dimensions, for even P1\mathbb{P}^153, through the relation

P1\mathbb{P}^154

After triangulating a general simplex into orthoschemes, the resulting integral is written as a sum of real periods of Rudenko-type alternating quadrangular polylogarithms (Ren et al., 2023). For P1\mathbb{P}^155, the paper states that the hexagon integral can be expressed in terms of P1\mathbb{P}^156 with algebraic functions of cross-ratios as arguments (Ren et al., 2023).

A second physical realization appears in de Sitter space. For an alternating polygon P1\mathbb{P}^157, Rudenko’s weighted symbol P1\mathbb{P}^158 is built by summing rooted-tree expressions over all quadrangulations, using a parity-dependent cross-ratio

P1\mathbb{P}^159

together with quasi-shuffle and dot products on weighted words (Ferro et al., 7 May 2026). Applying P1\mathbb{P}^160 to P1\mathbb{P}^161 produces P1\mathbb{P}^162, and from this one defines even and odd quadrangular polylogarithms P1\mathbb{P}^163 (Ferro et al., 7 May 2026).

These functions satisfy explicit coproduct recursions. For the basic polygon,

P1\mathbb{P}^164

is expressed as a term proportional to P1\mathbb{P}^165 plus a sum over admissible quadrilaterals P1\mathbb{P}^166, with coefficients that are products of lower-weight P1\mathbb{P}^167 on the three subpolygons (Ferro et al., 7 May 2026). The P1\mathbb{P}^168-site chain-graph de Sitter wavefunction is then written explicitly in terms of these P1\mathbb{P}^169, with a recursive structure matched to the coproduct recursion (Ferro et al., 7 May 2026). This establishes quadrangular polylogarithms as a complete basis for a nontrivial family of cosmological observables.

6. Algebraic reformulations and broader significance

The 2025 paper on multiple polylogarithms and the Steinberg module does not mention Rudenko’s quadrangular polylogarithms explicitly, but it provides a structural framework that illuminates them. It proves that every multiple polylogarithm of weight P1\mathbb{P}^170 and depth P1\mathbb{P}^171 can be expressed as a P1\mathbb{P}^172-linear combination of

P1\mathbb{P}^173

and products of lower-weight polylogarithms (Charlton et al., 4 May 2025). For the depth-P1\mathbb{P}^174 world relevant to quadrangular polylogarithms, this means that the entire depth-P1\mathbb{P}^175 content reduces to P1\mathbb{P}^176 modulo products.

More conceptually, for a rank-P1\mathbb{P}^177 torus P1\mathbb{P}^178 with character space P1\mathbb{P}^179, the depth-graded piece satisfies the P1\mathbb{P}^180-equivariant isomorphism

P1\mathbb{P}^181

This identifies pure depth-P1\mathbb{P}^182 polylogarithmic information with a Steinberg-module tensor square (Charlton et al., 4 May 2025). The same paper relates P1\mathbb{P}^183 to Milnor P1\mathbb{P}^184-theory through

P1\mathbb{P}^185

and develops a duality exchanging Steinberg polylogarithms and Steinberg iterated integrals (Charlton et al., 4 May 2025). For quadrangular polylogarithms, this suggests a precise interpretation of their depth-P1\mathbb{P}^186 symbols as Steinberg-module classes attached to four-point configurations.

This does not replace the cluster and polygonal descriptions. Rather, it complements them. The cluster-polylogarithmic picture emphasizes admissible symbol alphabets and total compatibility on P1\mathbb{P}^187; the Lie-coalgebraic picture identifies the quadrangular sector with P1\mathbb{P}^188 and the relation P1\mathbb{P}^189; the polygonal-functional-equation picture shows how quadrangulations generate higher-weight depth reductions; and the Steinberg-module picture gives an abstract homological model for the same depth-graded data (Matveiakin et al., 2022).

In summary, Rudenko’s quadrangular polylogarithms are a family of motivic and cluster polylogarithms defined by alternating correlator sums over configurations of P1\mathbb{P}^190 points, computable via sums over quadrangulations, projectively invariant on P1\mathbb{P}^191, and canonically spanning the type P1\mathbb{P}^192 cluster-polylogarithmic sector (Matveiakin et al., 2022). In weight P1\mathbb{P}^193 they coincide with the intrinsic depth-P1\mathbb{P}^194 generators of the Lie coalgebra of multiple polylogarithms (Greenberg et al., 2022); in higher weights they generate polygonal functional equations and explicit depth reductions (Charlton et al., 2020); and in geometric and physical applications they appear in orthoscheme volumes, one-loop P1\mathbb{P}^195-gon integrals, and de Sitter wavefunctions (Ren et al., 2023, Ferro et al., 7 May 2026).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Rudenko's Quadrangular Polylogarithms.