Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
A uniform common-subsum bound in finite two-groups
These results use simultaneous representation constraints over every affinely dissociated set of the specified size, rather than one fixed basis. They do not prove the unrestricted odd-set bound or Erdős 963. Affine dissociation means absence of a nonzero balanced ternary relation, with balance taken over the integers, even when the values lie in a finite group.
Binary-tree extraction with variable transversals
Let be a finite abelian -group. Choose a descending subgroup chain whose successive indices are two, terminating at zero. Its cosets form a binary tree. For any nonempty , the occupied cosets form a finite tree with leaves.
If , , there is a path with at least branching vertices. The sibling subtrees at its first branches, and the continuing subtree, partition into nonempty clusters. Every transversal is affinely dissociated. Indeed, subtract its point in the continuing cluster from the other selected points. Their differences occupy distinct layers of the subgroup chain. In any nonzero balanced ternary relation, the unique term in the shallowest occupied layer cannot be canceled by deeper-layer terms, as reduction modulo the next subgroup shows.
Consequently
There is also a useful rigidity consequence: if every affinely dissociated -subset of has total zero, then
Otherwise the partition above has a nonsingleton cluster. Two transversals differing only in that cluster have distinct totals, contrary to the hypothesis.
Common almost-full subsums
Theorem. Let be even and . Suppose there is such that, for every affinely dissociated -subset ,
Then
The bound is seven for , and for every even .
Multiplication by is invertible on . Translate by ; affine dissociation is preserved, and the common subsum becomes zero. If the subgroup generated by the translated set is zero, the result is immediate. Otherwise choose an index-two subgroup and put
The generating property gives .
No affinely dissociated -set can lie in : each of its -sums has nonzero image in , since is odd. Thus , and (1) gives .
For every affinely dissociated -set and every , the set is affinely dissociated. A relation using is excluded modulo , and one omitting it is excluded by the hypothesis on . Among this set's -sums, only can be zero: every other one uses exactly once. Hence every such has total zero. Applying (2) with gives , proving (3).
A modular unit-class endpoint
Let and let divide . Suppose
where is ordinary modular dissociation. Then
The case is vacuous, so split into two classes modulo . On either fiber, ordinary and affine dimensions agree: any ordinary relation on at most elements has coefficient sum divisible by , and hence zero. If the ordinary dimension is , an affinely dissociated -set would therefore be ordinarily dissociated as well, proving equality of the dimensions.
If both fibers have dimension at most , (1) bounds each by , proving (4). Otherwise let have dimension and denote the other fiber by . The case also follows from (1). Multiplication by an odd unit normalizes
Take any affinely dissociated -set and . The set is ordinarily dissociated. A relation on , oriented with coefficient one at , has coefficient sum on satisfying and . Thus . Among ternary coefficients, this forces exactly plus signs and one zero. Consequently
Theorem (3) gives . Fixing one also gives . Therefore
since for .
Remaining limitation
The common-subsum hypothesis in (3) is essential to the proof. For unrestricted odd sets, crossing representations include several mixed-sign coefficient families, not a fixed almost-full subsum family. No reduction to (3) has been established there. In particular (4) does not establish the unrestricted modular odd bound from [[research/erdos_963/finite_group_observations|the cyclic route]], and gives no improvement to the current real-set estimates in the proof sketch.