Lopsided Sets: Asymmetry in Mathematics
- Lopsided sets are families of objects defined by inherent asymmetry relative to a symmetric baseline, appearing in fields like combinatorics and astrophysics.
- In combinatorics, lopsided (ample) sets satisfy the Dress–Pajor inequality and are realized as weakly convex cubihedra within the ℓ1-metric framework.
- Other domains use lopsidedness to capture imbalances such as unequal sum/difference sets, dominant monomials in amoeba theory, and anisotropic satellite distributions.
Searching arXiv for the cited papers to ground the article. Lopsided sets is a polysemous technical term whose meaning depends strongly on context. In combinatorics and discrete geometry, it denotes families of sign vectors introduced by Lawrence and independently rediscovered by Dress under the name ample sets; these families satisfy equality cases in the Dress–Pajor inequality and admit geometric realizations as weakly convex cubihedra in the intrinsic -metric (Bandelt et al., 29 Mar 2026). In additive combinatorics, the phrase refers to subsets of for which the sumset and difference set have unequal sizes (Hemmady et al., 2016). In amoeba theory, lopsidedness is the dominance of one monomial magnitude over the sum of the others, yielding outer approximations to polynomial amoebas (Forsgård et al., 2016). In observational astrophysics, a “lopsided set” is a satellite system whose projected angular distribution around an isolated host departs significantly from isotropy (Heesters et al., 2024). The common thread is asymmetry relative to a natural symmetric baseline, but the underlying objects, metrics, and theorems are domain-specific.
1. Terminological scope
In the cited literature, the term appears in several technically distinct senses.
| Domain | Underlying object | Lopsidedness criterion |
|---|---|---|
| Combinatorics and cube complexes | Equality in Dress’s criterion; equivalent to Lawrence lopsidedness | |
| Additive combinatorics | ||
| Amoeba theory | for a Laurent polynomial | One monomial strictly dominates the others |
| Astrophysics | Satellite system around a host galaxy | Angular distribution is significantly asymmetric |
The combinatorial meaning is historically primary in the supplied corpus. Lawrence introduced lopsided sets in 1983 through the study of intersection patterns of convex sets with orthants of , while Dress later defined ample sets by equality in a combinatorial inequality and the two notions coincide (Bandelt et al., 29 Mar 2026). The other usages retain the same qualitative intuition—deviation from balance, isotropy, or non-dominance—but they do not describe the same mathematical structure.
2. Combinatorial lopsided sets and Dress’s ampleness
Let be finite and let 0 denote the set of sign vectors 1. For 2 and 3, the paper defines the projection and full-fiber operators
4
5
These induce two simplicial complexes on 6: 7
8
Here 9 records shattered sets and 0 strongly shattered sets (Bandelt et al., 29 Mar 2026).
The fundamental inequality is the Dress–Pajor inequality
1
Dress called 2 ample when
3
The paper also states that ample sets satisfy the “sparseness” equality 4, as proved in earlier work, and that Lawrence’s lopsidedness condition is equivalent to ampleness (Bandelt et al., 29 Mar 2026).
Lawrence’s formulation uses the complement 5: 6 is lopsided if for all 7 with 8 and 9, either 0 or 1. This condition encodes a global asymmetry in the occupancy of hypercube fibers. The paper further recalls a family of equivalent characterizations from earlier work, including superisometry of all fibers, superconnectivity, hereditary Euler characteristic 2, and total asymmetry (Bandelt et al., 29 Mar 2026).
The examples in the paper illustrate both sides of the dichotomy. For 3, the set 4 is ample, with 5, while 6 with the two constant maps removed is not ample: 7 lies strictly between the sizes of the shattered and strongly shattered complexes (Bandelt et al., 29 Mar 2026).
3. Cubihedra, 8 geometry, and metric characterizations
The central geometric realization associates to 9 the cubihedron
0
where 1 is viewed as a cube complex. The vertices of 2 are precisely 3, its 4-skeleton is the induced subgraph 5 in the hypercube graph, and its facets are the maximal faces contained in 6 (Bandelt et al., 29 Mar 2026).
The ambient metric is the 7 metric
8
If 9 is connected, 0 carries an intrinsic path metric 1. The paper calls a subset 2 weakly convex if it is complete and Menger-convex, equivalently if the intrinsic path metric equals the ambient 3 metric on 4. Weak convexity is therefore a path-5-isometric condition (Bandelt et al., 29 Mar 2026).
A principal theorem gives the metric characterization of ampleness. For 6, the following are equivalent:
- 7 is ample.
- 8 is weakly convex.
- 9 is sign-convex.
- 0 is sign-convex.
- 1 is isometric in 2 and every face of 3 is gated in 4.
- 5 and the ambient 6 metric coincide on 7.
- For any two parallel faces of 8 with barycenters 9, one has 0 (Bandelt et al., 29 Mar 2026).
This theorem relocates ampleness from a counting identity to a metric-geometric property of cube complexes. In particular, ample sets are exactly those sign-vector families whose cubihedra are isometric subspaces of 1-spaces in the sense used by the paper. The non-ample six-vertex example above becomes a solid hexagon whose intrinsic metric exceeds the ambient 2 metric on certain pairs, explicitly demonstrating failure of weak convexity (Bandelt et al., 29 Mar 2026).
4. Barycenter systems, orthants, and oriented-matroid-like structure
Faces of the hypercube are encoded by barycenter sign vectors in 3. If
4
then the barycenter 5 satisfies 6 for 7 and 8 for 9. The set 0 of barycenters of all faces of 1 is upward closed under the partial order 2, and the paper emphasizes the identity
3
for any 4 (Bandelt et al., 29 Mar 2026).
The paper introduces the signed-circuit axiom (SCA): a subset 5 satisfies SCA if for all 6 and 7 with 8, there exists 9 such that 0 and
1
For upward closed 2, SCA is equivalent to 3-convexity, and on such sets 4-convexity is equivalent to sign-convexity (Bandelt et al., 29 Mar 2026).
This leads to a barycenter characterization: for 5 and 6, the following are equivalent: 7 is weakly convex, 8 is sign-convex, 9 is 00-convex, 01 satisfies SCA, 02 is an isometric subgraph of the grid graph 03, and 04 is ample with 05 and 06 (Bandelt et al., 29 Mar 2026).
The oriented-matroid analogy is made through cocircuits. The minimal elements of 07 under 08 form
09
and 10. The paper states that 11 is ample if and only if 12 satisfies SCA, equivalently if 13 does, and similarly for the complementary circuit system 14 (Bandelt et al., 29 Mar 2026).
The resemblance to oriented matroids is structural rather than complete. SCA is presented as an analogue of weak elimination, but ample sets do not require global symmetry 15, nor the existence of the zero covector. The paper situates them instead within the broader framework of COMs, with ample sets characterized as those COMs whose cells are cubes (Bandelt et al., 29 Mar 2026).
5. Realizability, projection, and related constructions
Lawrence’s original orthant-intersection viewpoint is recovered through the construction
16
where
17
The paper proves that 18 is ample if and only if there exists a weakly convex 19, equivalently a compact weakly convex 20, such that 21. One direction uses 22; the converse derives ampleness from weak convexity of coordinate-hyperplane sections and superisometric fibers (Bandelt et al., 29 Mar 2026).
Projection provides another equivalent characterization. If 23, let 24 denote the orthogonal projection of 25 to 26, and let 27 be the cubihedron of the projected sign family 28. Then 29 is ample if and only if
30
equivalently if
31
(Bandelt et al., 29 Mar 2026).
These results connect lopsided sets to several established structures. The paper explicitly places them at the intersection of hypercube combinatorics, cube complexes, and 32-embeddability; it also notes earlier connections to median graphs, CAT(0) cube complexes, convex geometries, antimatroids, and conditional antimatroids (Bandelt et al., 29 Mar 2026). A plausible implication is that ampleness functions as a unifying criterion for when discrete hypercube data admit faithful 33-geometric realization without distortion under passage to faces, fibers, and projections.
6. Other established uses of “lopsided sets”
In additive combinatorics, a subset 34 is called lopsided when its sumset
35
and difference set
36
have different sizes. The paper distinguishes sum-dominated sets, difference-dominated sets, and balanced sets. For random 37 formed by including each residue independently with probability 38, it proves a phase transition near 39: if 40, then 41 almost surely; if 42, then 43; and if 44 with 45 prime, then 46 almost surely (Hemmady et al., 2016). Here “lopsided” means imbalance between additive and subtractive expansion rather than a sign-vector property.
In amoeba theory, lopsidedness is defined pointwise for a Laurent polynomial
47
For 48, write
49
Then 50 is lopsided at 51 if there exists 52 such that
53
The lopsided amoeba 54 is the set where 55 is not lopsided, and it contains the true amoeba 56. Purbhoo’s approximation scheme uses cyclic resultants 57, with 58 converging uniformly to 59 as 60; the paper then develops fast dyadic algorithms for computing 61 and reports speedups from 62 to roughly 63 relative to general resultant computation in the examples shown (Forsgård et al., 2016). In this setting, lopsidedness is a dominance inequality that certifies non-membership in the amoeba.
In observational astrophysics, lopsidedness refers to angular asymmetry in the projected distribution of satellite dwarf galaxies around an isolated host. The cited study analyzes 47 MATLAS systems and 21 ELVES systems using six metrics calibrated against 64 isotropic Monte Carlo realizations per host, with only angular positions randomized and radial distances fixed. The preferred diagnostic is the wedge metric
65
with a meta-66-value to control scanning over opening angles 67. Under this metric, about 68 of tested systems are significantly lopsided, compared to the 69 null expectation at 70; combining all six metrics raises the fraction to about 71 (Heesters et al., 2024). The paper further reports that outer satellites dominate the signal and that restricting all systems to satellites within 72 kpc reduces the wedge-significant fraction from 73 to 74 (Heesters et al., 2024). Here the term names a statistically significant anisotropy in phase-space projection.
Across these domains, the same word marks an excess on one side of a benchmark: imbalance between orthants, between sumset and difference-set sizes, between monomial contributions, or between angular sectors. This suggests a family resemblance centered on asymmetry detection, but the formal definitions are not interchangeable.