Wiki
Wiki

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 GG be a finite abelian 22-group. Choose a descending subgroup chain whose successive indices are two, terminating at zero. Its cosets form a binary tree. For any nonempty X⊆GX\subseteq G, the occupied cosets form a finite tree with ∣X∣|X| leaves.

If ∣X∣>2t−2|X|>2^{t-2}, t≥2t\ge2, there is a path with at least t−1t-1 branching vertices. The sibling subtrees at its first t−1t-1 branches, and the continuing subtree, partition XX into tt 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

∣X∣≤2daff(X)−1.(1)|X|\le2^{d_{\rm aff}(X)-1}. \tag{1}

There is also a useful rigidity consequence: if every affinely dissociated tt-subset of XX has total zero, then

∣X∣≤max⁡{t,2t−2}.(2)|X|\le\max\{t,2^{t-2}\}. \tag{2}

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 r≥4r\ge4 be even and E⊆GE\subseteq G. Suppose there is k∈Gk\in G such that, for every affinely dissociated rr-subset D⊆ED\subseteq E,

k∈Σr−1(D):={∑x∈D∖{a}x:a∈D}.k\in\Sigma_{r-1}(D) :=\left\{\sum_{x\in D\setminus\{a\}}x:a\in D\right\}.

Then

∣E∣≤2r−2+max⁡{r−1,2r−3}.(3)\boxed{|E|\le2^{r-2}+\max\{r-1,2^{r-3}\}.} \tag{3}

The bound is seven for r=4r=4, and 3⋅2r−33\cdot2^{r-3} for every even r≥6r\ge6.

Multiplication by r−1r-1 is invertible on GG. Translate EE by −(r−1)−1k-(r-1)^{-1}k; affine dissociation is preserved, and the common subsum becomes zero. If the subgroup HH generated by the translated set is zero, the result is immediate. Otherwise choose an index-two subgroup H0⊂HH_0\subset H and put

U=E∖H0,V=E∩H0.U=E\setminus H_0,\qquad V=E\cap H_0.

The generating property gives U≠∅U\ne\varnothing.

No affinely dissociated rr-set can lie in UU: each of its (r−1)(r-1)-sums has nonzero image in H/H0H/H_0, since r−1r-1 is odd. Thus daff(U)≤r−1d_{\rm aff}(U)\le r-1, and (1) gives ∣U∣≤2r−2|U|\le2^{r-2}.

For every affinely dissociated (r−1)(r-1)-set D⊆VD\subseteq V and every u∈Uu\in U, the set D∪{u}D\cup\{u\} is affinely dissociated. A relation using uu is excluded modulo H0H_0, and one omitting it is excluded by the hypothesis on DD. Among this set's (r−1)(r-1)-sums, only ∑D\sum D can be zero: every other one uses uu exactly once. Hence every such DD has total zero. Applying (2) with t=r−1t=r-1 gives ∣V∣≤max⁡{r−1,2r−3}|V|\le\max\{r-1,2^{r-3}\}, proving (3).

A modular unit-class endpoint

Let N=2MN=2^M and let q=2s≥8q=2^s\ge8 divide NN. Suppose

A⊆a+qZ/NZ,a odd,d(A)=q,A\subseteq a+q\mathbb Z/N\mathbb Z,\qquad a\text{ odd}, \qquad d(A)=q,

where dd is ordinary modular dissociation. Then

∣A∣≤2q−1.(4)\boxed{|A|\le2^{q-1}.} \tag{4}

The case q=Nq=N is vacuous, so split into two classes modulo 2q2q. On either fiber, ordinary and affine dimensions agree: any ordinary relation on at most q+1<2qq+1<2q elements has coefficient sum divisible by 2q2q, and hence zero. If the ordinary dimension is d0≤qd_0\le q, an affinely dissociated (d0+1)(d_0+1)-set would therefore be ordinarily dissociated as well, proving equality of the dimensions.

If both fibers have dimension at most q−1q-1, (1) bounds each by 2q−22^{q-2}, proving (4). Otherwise let EE have dimension qq and denote the other fiber by BB. The case B=∅B=\varnothing also follows from (1). Multiplication by an odd unit normalizes

E≡1(mod2q),B≡1+q(mod2q).E\equiv1\pmod{2q},\qquad B\equiv1+q\pmod{2q}.

Take any affinely dissociated qq-set D⊂ED\subset E and b∈Bb\in B. The set DD is ordinarily dissociated. A relation on D∪{b}D\cup\{b\}, oriented with coefficient one at bb, has coefficient sum ss on DD satisfying s≡q−1(mod2q)s\equiv q-1\pmod{2q} and ∣s∣≤q|s|\le q. Thus s=q−1s=q-1. Among qq ternary coefficients, this forces exactly q−1q-1 plus signs and one zero. Consequently

−b∈Σq−1(D)for every such D.-b\in\Sigma_{q-1}(D) \quad\text{for every such }D.

Theorem (3) gives ∣E∣≤3⋅2q−3|E|\le3\cdot2^{q-3}. Fixing one DD also gives ∣B∣≤q|B|\le q. Therefore

∣A∣≤3⋅2q−3+q≤2q−1,|A|\le3\cdot2^{q-3}+q\le2^{q-1},

since q≤2q−3q\le2^{q-3} for q≥8q\ge8.

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.