WorksMathematics
Distinct partial products in prime dihedral groups
Abstract
Let be the dihedral group of order , where is prime. For every fixed , we prove that every subset with admits an ordering whose nonempty partial products are pairwise distinct. Combined with the known small- and large-set theorems, this covers every subset size for all sufficiently large primes. Pairing reflections reduces the products to partial sums with fixed parity-labelled offsets. Two passes of block rotations remove distant collisions; bounded displacement allows the local condition to exclude the remaining collisions. The existence of suitable rotations follows from Pham–Sauermann's subset-sum anticoncentration theorem, an affine-rank estimate, and a count of clustered collision witnesses.
Introduction
An ordering of a finite subset of a group is valid if its nonempty partial products
are pairwise distinct. The empty product is excluded from this condition. Graham [7 Problem 10, p. 36] asked whether every subset of has a valid ordering, for every prime ; the question was repeated by Erdős and Graham [6 p. 95]. The corresponding nonabelian problem asks for distinct partial products. We consider the dihedral group of order .
Theorem 1.1. For every there is an integer such that, for every prime , every subset satisfying
has a valid ordering.
Corollary 1.2. For all sufficiently large primes , every subset of has a valid ordering.
The proof of Corollary 1.2 uses the eventual overlap of three size ranges and leaves a finite set of primes untreated. The assertion for every prime is unresolved. The constants in Theorem 1.1 are not optimised.
The size range in Theorem 1.1 lies between two existing results. The small-set theorem [4 Theorem 1.3] gives a stronger sequencing property for dihedral subsets of size at most , with an absolute . It extends the small-set method of Bedert and Kravitz [2] to suitable semidirect products. The general large-set theorem [3 Theorem 1.4] guarantees that, for an absolute , every subset of any finite group with has a valid ordering. These ranges overlap the range of Theorem 1.1 for a suitable fixed , giving Corollary 1.2.
Ollis [12] studied distinct partial products in dihedral groups. For prime cyclic groups, Pham and Sauermann [13, Theorem 1.2] proved the intermediate range $C_\alpha \le |A| \le p^\alpha$, and hence Graham’s conjecture for sufficiently large primes. Their exponent is written $1-\alpha$; we have reparametrised it. Their proof combines subset-sum anticoncentration with local changes to a random ordering. The dihedral intermediate range is explicitly identified as a further problem after extensions to cyclic groups {citep}[5 Section 7]. {xref}Theorem 1.1` supplies that range by an additive reduction which retains the signs caused by reflections.
There is also a graph formulation. In the directed Cayley graph, give the edge colour . For nonempty , a valid ordering exists if and only if some can be omitted so that the remaining colours form a simple directed rainbow path. Indeed, left multiplication of by gives the distinct prefixes, including the empty prefix, of . Conversely, prepending the omitted element to such an ordering translates its entire prefix list. This equivalence explains the endpoint convention: a simple path using all colours would impose the additional requirement that be distinct from every .
The proof
Write , with
A reflection reverses every subsequent sign until the next reflection. Pairing reflections into cells of length at most four produces variable positions, all with coefficient . After the other entries have been fixed, the variables form a uniform permutation of a fixed subset of . Every partial product in cell then belongs to
where the sets remain attached to their positions when variables are permuted. Parity-preserving permutations in semidirect products already appear in [4 Section 2].
For each fixed , the permutation local lemma gives a probability that every short identity subword is absent, even after arbitrary variable permutations in any window of at most cells. The lower bound is uniform in the ratio of the rotation and reflection counts. For a small reflection pool, a pattern count proportional to its size cancels the corresponding probability denominator; see Appendix § 10. Separately, with probability tending to one on every fixed-decoration fibre, each member of a predetermined linear-size family of blocks has a cyclic rotation avoiding all distant target sets. Two staggered passes of these rotations preserve selected cut sums and move every variable by a bounded distance. Any remaining collision can therefore be reproduced by a permutation inside an original bounded window, contradicting the local condition.
The distant-avoidance estimate uses the sharp subset-sum theorem [13 Theorem 1.3]. If all cyclic rotations of one block fail, one collision per rotation gives an affine system . Suppose its target anchors form clusters separated from the source cluster. The affine dimension of the columns of is at least ; long gaps also supply independent differences of repeated columns. Conditioning on disjoint position pools then yields
With gap scale , there are anchor tuples, giving a total of . Clustered targets have fewer possible locations; separated targets give stronger anticoncentration. This balance permits a union bound over the entire repair family.
The reservoir exposure is related to the chain estimate [13 Corollary 4.2] and to the standard rank-exposure argument [11]; see also [9 Lemma 3.7]. The boundary constraints [2 Section 6] and transposition repairs [13 Section 5] are antecedents of the random-ordering and local-repair approach. The fixed-offset calculation, the repeated-column estimate and the two-pass rotation argument are proved below.
Cells and fixed offsets
For an odd prime , use coordinates
Let be nonempty. Write and for its rotation and reflection coordinate sets, and put , and . Coordinates within either pool are distinct; the two pools may intersect. For and , write .
Lemma 2.1. There is a random arrangement of into consecutive cells, each beginning with a variable, such that and every cell has length at most four. All variables have the same type and distinct coordinates. Conditional on the nonvariable entries and the variable coordinate set , their coordinates form a uniform permutation of . There are fixed sets , , such that, for every assignment of to the variables, the nonempty prefixes ending in cell are exactly
The prefixes within each cell are pairwise distinct for every assignment.
Proof. In the rotation-majority case , take cells, each starting with a variable rotation. For , append two reflection slots to each of distinct cells. For , reserve the last cell for one reflection and append two reflections to each of earlier cells. Any such choice of cells is allowed and is fixed before sampling. The reservation is feasible since implies . The types are
Choose independent uniform assignments of and to their slots, with an empty permutation space interpreted as a singleton. Conditioning on the reflections leaves a uniform permutation of . Here , and each cell has length at most three. In the reflection-majority case , start with successive reflection slots. Choose arbitrary distinct reflection slots after which to place the rotations, and fix an arbitrary bijection from these rotation slots to before sampling. Only the reflection assignment is random in this case. Assign uniformly to its slots, pair successive reflections into cells and retain each following rotation in its reflection’s cell. The types are
possibly a final , where brackets indicate optional entries and odd reflection slots are variable. Then , and cells have length at most four. Conditioning on the even reflection slots leaves a uniform bijection from the odd slots to the remaining set .
Every nonfinal cell has even reflection parity, so the prefix preceding each variable has parity zero and its coordinate has coefficient . Permutations within fixed parity classes that preserve the total product in a semidirect product also occur in [4 Section 2]. Let be the common variable type. If cell has fixed entries following its variable, let be the product of their first entries, including . Set
The product before cell is , proving (1). The possible odd parity of the final cell occurs after its variable and causes no exception.
Subtracting , a paired rotation cell with reflections has prefixes
Its equal-parity pair differs by . A paired reflection cell with second reflection and optional rotations has prefixes
If is absent, set and omit the second point; if is absent, omit the fourth. Every remaining equal-parity pair differs by a present nonzero rotation coordinate. The shorter cells satisfy the same checks.
Robust local separation
Fix an integer and consider the full probability space of Lemma 2.1. In the rotation-majority case this includes both independent permutation factors; in the reflection-majority case only the reflection assignment is random. Let be the event that, in every interval of at most cells, every permutation of its variables leaves every nonempty contiguous subword in that interval with nonidentity product. For each realisation, these permutations move only variable coordinates among variable slots in the chosen window. All nonvariable entries, including sampled nonvariable reflections, remain fixed during these permutations.
Lemma 3.1. There are and , depending only on , such that implies
in either cell construction, uniformly over , , the permitted placements and the ratio of the two pool sizes.
The proof, given in Appendix § 10, applies the quantitative permutation local lemma to canonical assignments. Its probability is unconditional in the cell construction. In particular, no lower bound on each fixed-decoration fibre is asserted. The condition excludes short identity subwords beginning at the first entry as well as those between two nonempty prefixes; the final conclusion still concerns nonempty prefixes only.
Two-pass repair
Fix , put and suppose . Let , set , , and fix with . All indices refer to the original ordering, and decorations remain attached to positions. For , define
Then and .
A source consists of a window of length , disjoint sets with , and a cyclic order of . A rotation is safe if
for every nonempty proper prefix of the rotation, every and every with . A prefix denotes its set of original labels when used in a sum. The window bounds original labels; the rotating list may occupy different positions. Since the safety test includes every decoration in the source interval, it protects the list’s proper prefixes whenever they end at positions in and the list has starting sum .
Partition into consecutive intervals , , . Such a partition exists by using lengths when , . For , let be the original cyclic order of starting after and omitting . Before sampling coordinates, list the following sources:
For each , use , , , and its original cyclic order.
For each and , use , , , and cyclic order .
Let assert that every listed source has a safe rotation. The list has at most
items, all satisfying the source restrictions.
Proposition 4.1. If holds, there is a permutation of with such that, on setting , equality between a point of and a point of , , implies .
Proof. For each source of the first family, choose a safe rotation, let be its first label, and write the block as . After this first pass, completed blocks retain their sums, so every proper nonempty prefix inside block is . With its position’s decoration, this lies in and avoids for . Put a cut at . Since , its prefix is proper and has sum
The list between cuts and is , of length . Rotate it safely using the second-family source indexed by . These position intervals are disjoint. Their preserved sums, together with the fixed first label , preserve every cut sum (5), even if its label moves. Thus remains the starting sum for , even though the sum through the original boundary may change. For , the final prefix is
where is a proper nonempty prefix of the chosen rotation of . The labels in lie within original positions after , and . Thus (2) and (3) give membership and protection at the original anchor .
Leave the final tail unchanged. Its preceding cut sum is preserved, so its prefixes retain their first-pass values. The cuts, interiors between cuts and final tail cover every position . For each such , the corresponding original boundary satisfies
When there is one block, the first pass alone gives these conclusions. At the final position, and ; set .
Each pass moves labels within intervals of length at most , so their composition has displacement at most . If decorated points at coincide, protection at and membership at force . Hence .
Lemma 4.2. Suppose a cell realisation satisfies for . After any variable permutation with , no equal nonempty prefixes can end in distinct cells with .
Proof. Equal prefixes give an identity subword by left cancellation. It begins after the selected prefix in cell , which already contains that cell’s variable, and ends in cell . The subword therefore starts strictly after the variable of cell and uses exactly the variable slots ; its other entries remain fixed. The interval
contains the subword’s cells and every original variable label it uses, and . The prescriptions for form a partial injection of into itself. Extend it to a permutation of by matching unused domain and range points. That local permutation reproduces the identity subword in the original realisation, contradicting .
Subset-sum anticoncentration
The analytic input is the following theorem of Pham and Sauermann.
Theorem 5.1 ([13 Theorem 1.3]). There is an absolute constant such that the following holds. Let be prime, let have size , and let be a uniformly random -element subset of , where
Then
Zero is allowed in . Fix and put
The cube-root scale balances the scalar estimate with the count of clustered collision witnesses.
Lemma 5.2. For each fixed , there is a threshold , depending only on and , with the following property. Suppose , , and . If is a uniform -subset of an arbitrary -element set , then
Proof. Choose so that, for every ,
Such a threshold exists and is independent of . Then , , and
The last inequality uses and . Theorem 5.1 therefore bounds the largest atom by
Affine systems in a random permutation
For an matrix with columns , set
An actual column value is a vector that occurs as some ; its multiplicity is . When is a permutation of , replacing every column by translates $H_x by the fixed vector . The affine column dimension is therefore the relevant quantity. The rank-exposure argument is standard; see [11 proof of Proposition 2.2] and [9 Lemma 3.7]. Related exposures retaining a large reservoir occur in the chain estimate [13 Corollary 4.2]. Disjoint position pools recover independent scalar sums inside a permutation.
Lemma 6.1. Fix an integer and . Suppose is an matrix over with an actual column value of multiplicity at least . Suppose actual column values each have multiplicity at least and the differences are independent. If is a uniform bijection onto an arbitrary -element set , then, for every fixed ,
provided and exceeds a threshold depending only on . The constant has the same parameter dependence. The independence assumption implies . The cases and are allowed.
Proof. If , every column is , necessarily , and is deterministic. Assume . Extend the specified differences to a basis
by choosing further actual column values. For , select positions of column value ; for , select one. Denote these disjoint position sets by and their sizes by . None is a baseline position.
Put
For , one has . Choose disjoint sets of baseline positions, also disjoint from every . There are enough baseline positions because . The disjoint pools have sizes .
Condition on the assignments outside these pools and on the unordered value set assigned to each pool. Every nonempty fibre has exactly assignments, one for each tuple of bijections from the pools to their value sets. The restrictions to the pools are therefore independent uniform bijections. Pool contributes
to . The baseline terms and the contribution outside the pools are fixed. Since are independent, permits at most one tuple .
For , Lemma 5.2 bounds the largest atom of by . For , the singleton value is uniform on and has largest atom . Multiplying the bounds on each fibre and averaging proves (10), with
Increase the threshold to include and . This constant also covers
The residual right-hand side may vary between fibres, since the bound is uniform in . It is fixed on each fibre before the independent pool assignments are exposed.
Collision matrices and circular clusters
The standard incidence-rank formula gives the number of vertices minus the number of components; see [1 Theorem 2.3]. The following extension includes disjoint cluster indicators.
Lemma 7.1. Let have no fixed points, and let partition , with possibly empty and for . Over a field of characteristic zero or characteristic , put
If are the directed cycles of and is the matrix with , , interpreted in the field, then
Proof. The equations read
Each functional-graph component consists of a directed cycle with trees feeding into it. Deleting leaves forces to vanish off the cycles; on each cycle it is constant. Thus has basis and . The map has kernel , by inclusion and dimension. The images form , proving the rank equality.
Write and select rows spanning its row space. For every nonzero column , choose a vertex of on a selected cycle where that column is nonzero. A zero column has no cycle intersection: a positive intersection size is at most and cannot vanish in the stated characteristic. For such a column choose an off-cycle vertex of . These distinct representatives avoid all unselected cycles. Each such cycle has at least two vertices. Hence , which proves the inequality.
Let be integers with
Fix , disjoint sets with , and a cyclic order of . For each , let be a nonempty proper cyclic prefix beginning at , let satisfy , and choose
Define the matrix
Mark on . Join consecutive distinct marks when their clockwise gap is shorter than ; the connected components are the clusters. Equal residues are in the same cluster. If there is only one distinct mark, its sole gap has length . Let count the clusters not containing , and set , with corresponding to the source cluster. The linear anchors and remain distinct in (13).
Lemma 7.2. Under (12), in characteristic zero or characteristic , the affine column dimension of satisfies . There are actual column values such that occurs at least times, each other occurs at least times, and are independent.
Proof. Let be the cyclic position immediately after . Neither nor meets , and the prefix difference in (13) is constant on . Let be the matrix of Lemma 7.1 for this map , and write for its -th column. Taking consecutive cyclic source-column differences gives
Thus .
At least one circular gap has length at least , by (12). Every cluster lies in an arc of length less than , and there are intercluster gaps. Write , with . For an intercluster gap of length from to the next mark , the columns are constant on the half-open circular arc . Here a position of residue zero means column . Retain the positions at distances clockwise from , including the next mark itself. The corrections are supported at distances clockwise after marked anchors. Since no mark lies strictly inside the gap, these corrections vanish at every retained position. There are such positions, all with the same column value. The largest gap supplies an actual column value occurring at least
times.
Extend periodically. Its circular jump at residue is
At residue zero the left side is . Indeed the circular derivative of is , including . Crossing free cluster changes the constant gap value by ; crossing the source cluster changes it by . The are independent because their supports are disjoint and nonempty. The actual gap values therefore have affine dimension and are affinely independent. Choose the largest-gap value as . Their differences span all and supply the required repeated independent directions. Together with (14), Lemma 7.1 gives . □
Lemma 7.3. For fixed , , , satisfying , the number of ordered anchor tuples with free clusters is at most
Proof. Partition the labels into their clusters, with label zero representing . There are at most partitions. The least label of each free cluster has at most anchor choices. Every other target lies at circular distance less than from its representative, which has at most possible linear anchors, counting both representatives of residue zero. The resulting bound is (16), since . □
The probability of a safe repair menu
We retain the potential target sets (2), the safety condition (3), and the predetermined menu from Section 4. The variable order is sampled uniformly; the decorations remain fixed.
Proposition 8.1. Fix , an integer , and a decoration bound . Put and . There are constants and such that, whenever , , and is a uniform ordering of an arbitrary -element set ,
The threshold depends only on and the absolute constant of Theorem 5.1, and not on . The bound is uniform over and all fixed decorations of size at most . In particular the failure probability tends to zero if .
Proof. First fix one source configuration, with cyclic order , where . If all its rotations fail, choose one collision for each rotation. For the rotation starting at , this specifies a nonempty proper prefix , a remote anchor with , a set
and source and target decorations of equal parity. Writing for target coordinate minus source coordinate, its equation is
After these choices are fixed, the system is with (13). We sum over fixed witness tuples, rather than condition on the failure of other rotations.
Set
Choose large enough for Lemma 6.1, for , for , and for . These conditions depend only on and the absolute scalar constant; they hold eventually. The prime-size condition gives . If the anchors have free clusters, Lemma 7.2 gives affine dimension at least , a baseline of multiplicity at least , and repeated independent directions. Pad with zero rows to height . Neither its affine dimension nor its column multiplicities change. Lemma 6.1 therefore gives
For fixed , , , Lemma 7.3 bounds the anchor tuples by . The remoteness restrictions only reduce this count. For each rotation, the prefix has at most choices, each decoration has at most choices, and has at most choices. Thus, for fixed anchors, the remaining witness choices number at most , where
Counting pairs of incompatible parities only enlarges this bound. Combining the counts with (19) gives
where
The second inequality uses ; the last uses . The case is included. By (4), the predetermined menu has at most entries. A union bound proves (17) with
All configurations are listed before sampling, so the later selection of rotations introduces no additional conditioning.
The scalar saving and the clustered-anchor saving coincide at the cube-root scale. More generally, gives gains and , whose minimum is maximised at . The estimate is uniform on every fibre fixing the nonvariable entries and variable coordinate set of the cell construction. The local-separation event is intersected with this event only after averaging the fibre bounds.
Completion of the proofs
Proof of Theorem 1.1. Fix and set
Thus . Choose above the thresholds in Lemma 3.1 and Proposition 8.1 for these fixed parameters and . Increase it, if necessary, so that and
where is the lower bound in Lemma 3.1 and is the constant in Proposition 8.1. All choices depend only on and the absolute constants in the cited theorems. Take an integer .
Suppose that . In particular is odd. The construction of Lemma 2.1 gives and
In the original probability space, Lemma 3.1 gives . Condition on the nonvariable entries and the variable set . The decorations are fixed on each such fibre, and the variables remain a uniform permutation of . Proposition 8.1 therefore bounds the conditional probability of by on every nonempty fibre. Averaging gives
No independence of these events is required. For an outcome in their intersection, apply the variable permutation from Proposition 4.1 to the cell arrangement and read off the resulting word. This is an ordering of , since only its variable coordinates have been permuted. Nonempty prefixes ending in the same cell are distinct by Lemma 2.1. If two equal prefixes end in distinct cells, Proposition 4.1 places them at distance at most , whereas Lemma 4.2 excludes such a collision because and . Thus the ordering is valid.
Proof of Corollary 1.2. The large-set theorem [3 Theorem 1.4] gives an absolute such that, for every finite group , every with has a valid ordering. Put and . Then
Thus the polynomial range of Theorem 1.1 eventually overlaps the large-set range for . For the small-set range, the semidirect-product theorem [4 Theorem 1.3] applies to when the fixed finite abelian group is strongly sequenceable and acts by signs. The group is strongly sequenceable, since its only nonempty identity-free subset is a singleton. Taking its action by inversion gives an absolute such that every identity-free dihedral subset of size at most
has a sequencing. Their condition also excludes intermediate identity prefixes and hence implies the validity required here. This endpoint eventually exceeds the fixed . The small-set, polynomial and large-set intervals therefore cover every integer from to for sufficiently large primes. The empty set is immediate.
Proof of robust local separation
Proof of Lemma 3.1. Put
An index pattern consists of a -cell window, a permutation of its variables and a nonempty contiguous subword in the resulting window. It has at most entries and subwords. There are at most patterns, and every original random slot belongs to at most patterns. In rotation majority, at most patterns meet a reflection slot. Pull the random entries of each subword back to their original slots; this pullback is injective and remains within the window. Discard deterministically nonidentity patterns. In rotation majority, a subword without rotations lies in a run of at most two distinct reflections and is nonidentity. A retained pattern uses rotations; if , it uses an even number of reflections. In reflection majority, a subword without reflections contains at most one rotation, so a retained pattern uses an even number of reflections. Identity in a retained pattern is one affine equation in the random coordinates, each with coefficient or . The coefficients depend only on the type pattern. A canonical bad event specifies an injective assignment to the used random slots satisfying that equation. Its index includes the pattern, so identical events may occur as different vertices. Their simultaneous avoidance is exactly .
Write , with . In rotation majority, an assignment using slots has probability . Solving the affine equation for one rotation bounds the total event weight of one pattern by
For a fixed rotation value and , choose its slot and solve for another rotation. There are at most assignments, of weight at most
If , solve instead for a reflection after fixing and the other reflections; the weight is at most
since for every feasible . For a fixed reflection value, choose its slot and solve for a rotation, obtaining weight at most
In reflection majority, solving for one reflection gives pattern weight at most
If a fixed reflection value must occur, choose its slot and solve for another reflection, giving weight at most
These inequalities use , and in reflection majority. Only feasible patterns contribute denominators.
Let . Summing pattern weights gives . Every position label has event weight at most . In rotation majority, a rotation-value label has weight at most : use all patterns when and the at most reflection-using patterns when . A reflection-value label has weight at most . In reflection majority its weight is at most . Thus every position or value label satisfies
A value label includes its permutation-factor tag, even when rotation and reflection coordinates coincide. For , reflection cases are absent; for , retained rotation-majority patterns have no reflections, so the case is absent. For every other bounded , the number of reflection-using patterns cancels the small-pool denominator.
Join events sharing a position or value label in one permutation factor. This overlap graph is a negative dependency graph, as in the permutation framework of [8 Section 1.1]. For completeness, force the prescribed matches of one event successively by swapping each desired value into its prescribed position. Injectivity of the prescribed assignment preserves all previously forced matches. With matches already forced in a factor of size , each permutation satisfying the next match has exactly preimages satisfying the preceding matches. The resulting law is the product-permutation law conditioned on . An occurring non-neighbour survives each swap: its prescribed positions include neither the forced position nor the current position of the desired value. Hence, for avoidance of any collection of non-neighbours, . Bayes’ formula gives whenever . This argument also applies to two independent factors or an empty factor.
The quantitative lopsided local lemma [10 Lemma 3] gives an avoidance probability at least if
Each event uses at most matches and labels, so (A.2) gives
Take . The pattern bound (A.1) and its reflection-majority analogue give , while gives . Thus , proving the local-lemma hypothesis. Finally for yields
References
- [1]R. B. Bapat. Graphs and Matrices. Springer London, 2010. ISBN 9781848829817. doi: 10.1007/978-1-84882-981-7.DOI
- [2]Benjamin Bedert and Noah Kravitz. Graham’s rearrangement conjecture beyond the rectification barrier. Israel Journal of Mathematics, 273(1):471–500, 2026. doi: 10.1007/s11856-025-2871-6. Published online 30 November 2025.DOI
- [3]Benjamin Bedert, Matija Bučić, Noah Kravitz, Richard Montgomery, and Alp Müessner. On Graham’s rearrangement conjecture over ℱ₂, 2025. URL https://arxiv.org/abs/2508.18254v1. Version 1, 25 August 2025.
- [4]Simone Costa, Stefano Della Fiore, and Eva R. Engel. Graham’s rearrangement for a class of semidirect products, 2025. URL https://arxiv.org/abs/2503.18101v2. Version 2, 19 August 2025.
- [5]Simone Costa, Stefano Della Fiore, Tao Feng, and Hengrui Liu. Kneserized anticoncentration and reverse absorption for Graham’s rearrangement conjecture, 2026. URL https://arxiv.org/abs/2608.10015v2. Version 2, 18 August 2026.
- [6]P. Erdős and R. L. Graham. Old and new problems and results in combinatorial number theory. Number 28 in Monographies de L’Enseignement Mathématique. L’Enseignement Mathématique, Université de Genève, Genève, 1980. URL https://mathweb.ucsd.edu/~ronspubs/80_11_number_theory.pdf.
- [7]R. L. Graham. On sums of integers taken from a fixed sequence. In Proceedings of the Washington State University Conference on Number Theory, pages 22–40, 1971. URL https://mathweb.ucsd.edu/~ronspubs/71_08_integer_sums.pdf.
- [8]David G. Harris and Aravind Srinivasan. A constructive Lovász local lemma for permutations. Theory of Computing, 13(17):1–41, 2017. doi: 10.4086/toc.2017.v013a017.DOI
- [9]Matthew Kwan and Lisa Sauermann. Resolution of the quadratic Littlewood–Offord problem. Compositio Mathematica, 161(12):3089–3139, 2025. doi: 10.1112/S0010437X25102789. Lemma 3.7 is cited from arXiv:2312.13826v1.DOI
- [10]Linyuan Lu and László Székely. Using Lovász local lemma in the space of random injections. The Electronic Journal of Combinatorics, 14(1):R63, 2007. doi: 10.37236/981. Research Paper R63.DOI
- [11]A. M. Odlyzko. On subspaces spanned by random selections of ±1 vectors. Journal of Combinatorial Theory, Series A, 47(1):124–133, 1988. doi: 10.1016/0097-3165(88)90046-5. URL https://www-users.cse.umn.edu/~odlyzko/doc/arch/random.vectors.pdf. Proof of Proposition 2.2 is cited from the author’s manuscript, pp. 5–6.DOI
- [12]M. A. Ollis. Sequences in dihedral groups with distinct partial products. Australasian Journal of Combinatorics, 78(1):35–60, 2020. URL https://ajc.maths.uq.edu.au/pdf/78/ajc_v78_p035.pdf.arxiv.org/abs/1904.07646
- [13]Huy Tuan Pham and Lisa Sauermann. On Graham’s rearrangement conjecture, 2026. URL https://arxiv.org/abs/2602.15797v1. Version 1, 17 February 2026.