Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lopsided Sets: Asymmetry in Mathematics

Updated 12 July 2026
  • 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 L⊆{−1,+1}EL \subseteq \{-1,+1\}^E 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 ℓ1\ell_1-metric (Bandelt et al., 29 Mar 2026). In additive combinatorics, the phrase refers to subsets of Z/nZ\mathbb Z/n\mathbb Z 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 L⊆{−1,+1}EL \subseteq \{-1,+1\}^E Equality in Dress’s criterion; equivalent to Lawrence lopsidedness
Additive combinatorics A⊆Z/nZA \subseteq \mathbb Z/n\mathbb Z ∣A+A∣≠∣A−A∣|A+A| \neq |A-A|
Amoeba theory x∈Rnx \in \mathbb R^n for a Laurent polynomial ff 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 RE\mathbb R^E, 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 EE be finite and let ℓ1\ell_10 denote the set of sign vectors ℓ1\ell_11. For ℓ1\ell_12 and ℓ1\ell_13, the paper defines the projection and full-fiber operators

ℓ1\ell_14

ℓ1\ell_15

These induce two simplicial complexes on ℓ1\ell_16: ℓ1\ell_17

ℓ1\ell_18

Here ℓ1\ell_19 records shattered sets and Z/nZ\mathbb Z/n\mathbb Z0 strongly shattered sets (Bandelt et al., 29 Mar 2026).

The fundamental inequality is the Dress–Pajor inequality

Z/nZ\mathbb Z/n\mathbb Z1

Dress called Z/nZ\mathbb Z/n\mathbb Z2 ample when

Z/nZ\mathbb Z/n\mathbb Z3

The paper also states that ample sets satisfy the “sparseness” equality Z/nZ\mathbb Z/n\mathbb Z4, 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 Z/nZ\mathbb Z/n\mathbb Z5: Z/nZ\mathbb Z/n\mathbb Z6 is lopsided if for all Z/nZ\mathbb Z/n\mathbb Z7 with Z/nZ\mathbb Z/n\mathbb Z8 and Z/nZ\mathbb Z/n\mathbb Z9, either L⊆{−1,+1}EL \subseteq \{-1,+1\}^E0 or L⊆{−1,+1}EL \subseteq \{-1,+1\}^E1. 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 L⊆{−1,+1}EL \subseteq \{-1,+1\}^E2, and total asymmetry (Bandelt et al., 29 Mar 2026).

The examples in the paper illustrate both sides of the dichotomy. For L⊆{−1,+1}EL \subseteq \{-1,+1\}^E3, the set L⊆{−1,+1}EL \subseteq \{-1,+1\}^E4 is ample, with L⊆{−1,+1}EL \subseteq \{-1,+1\}^E5, while L⊆{−1,+1}EL \subseteq \{-1,+1\}^E6 with the two constant maps removed is not ample: L⊆{−1,+1}EL \subseteq \{-1,+1\}^E7 lies strictly between the sizes of the shattered and strongly shattered complexes (Bandelt et al., 29 Mar 2026).

3. Cubihedra, L⊆{−1,+1}EL \subseteq \{-1,+1\}^E8 geometry, and metric characterizations

The central geometric realization associates to L⊆{−1,+1}EL \subseteq \{-1,+1\}^E9 the cubihedron

A⊆Z/nZA \subseteq \mathbb Z/n\mathbb Z0

where A⊆Z/nZA \subseteq \mathbb Z/n\mathbb Z1 is viewed as a cube complex. The vertices of A⊆Z/nZA \subseteq \mathbb Z/n\mathbb Z2 are precisely A⊆Z/nZA \subseteq \mathbb Z/n\mathbb Z3, its A⊆Z/nZA \subseteq \mathbb Z/n\mathbb Z4-skeleton is the induced subgraph A⊆Z/nZA \subseteq \mathbb Z/n\mathbb Z5 in the hypercube graph, and its facets are the maximal faces contained in A⊆Z/nZA \subseteq \mathbb Z/n\mathbb Z6 (Bandelt et al., 29 Mar 2026).

The ambient metric is the A⊆Z/nZA \subseteq \mathbb Z/n\mathbb Z7 metric

A⊆Z/nZA \subseteq \mathbb Z/n\mathbb Z8

If A⊆Z/nZA \subseteq \mathbb Z/n\mathbb Z9 is connected, ∣A+A∣≠∣A−A∣|A+A| \neq |A-A|0 carries an intrinsic path metric ∣A+A∣≠∣A−A∣|A+A| \neq |A-A|1. The paper calls a subset ∣A+A∣≠∣A−A∣|A+A| \neq |A-A|2 weakly convex if it is complete and Menger-convex, equivalently if the intrinsic path metric equals the ambient ∣A+A∣≠∣A−A∣|A+A| \neq |A-A|3 metric on ∣A+A∣≠∣A−A∣|A+A| \neq |A-A|4. Weak convexity is therefore a path-∣A+A∣≠∣A−A∣|A+A| \neq |A-A|5-isometric condition (Bandelt et al., 29 Mar 2026).

A principal theorem gives the metric characterization of ampleness. For ∣A+A∣≠∣A−A∣|A+A| \neq |A-A|6, the following are equivalent:

  1. ∣A+A∣≠∣A−A∣|A+A| \neq |A-A|7 is ample.
  2. ∣A+A∣≠∣A−A∣|A+A| \neq |A-A|8 is weakly convex.
  3. ∣A+A∣≠∣A−A∣|A+A| \neq |A-A|9 is sign-convex.
  4. x∈Rnx \in \mathbb R^n0 is sign-convex.
  5. x∈Rnx \in \mathbb R^n1 is isometric in x∈Rnx \in \mathbb R^n2 and every face of x∈Rnx \in \mathbb R^n3 is gated in x∈Rnx \in \mathbb R^n4.
  6. x∈Rnx \in \mathbb R^n5 and the ambient x∈Rnx \in \mathbb R^n6 metric coincide on x∈Rnx \in \mathbb R^n7.
  7. For any two parallel faces of x∈Rnx \in \mathbb R^n8 with barycenters x∈Rnx \in \mathbb R^n9, one has ff0 (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 ff1-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 ff2 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 ff3. If

ff4

then the barycenter ff5 satisfies ff6 for ff7 and ff8 for ff9. The set RE\mathbb R^E0 of barycenters of all faces of RE\mathbb R^E1 is upward closed under the partial order RE\mathbb R^E2, and the paper emphasizes the identity

RE\mathbb R^E3

for any RE\mathbb R^E4 (Bandelt et al., 29 Mar 2026).

The paper introduces the signed-circuit axiom (SCA): a subset RE\mathbb R^E5 satisfies SCA if for all RE\mathbb R^E6 and RE\mathbb R^E7 with RE\mathbb R^E8, there exists RE\mathbb R^E9 such that EE0 and

EE1

For upward closed EE2, SCA is equivalent to EE3-convexity, and on such sets EE4-convexity is equivalent to sign-convexity (Bandelt et al., 29 Mar 2026).

This leads to a barycenter characterization: for EE5 and EE6, the following are equivalent: EE7 is weakly convex, EE8 is sign-convex, EE9 is ℓ1\ell_100-convex, ℓ1\ell_101 satisfies SCA, ℓ1\ell_102 is an isometric subgraph of the grid graph ℓ1\ell_103, and ℓ1\ell_104 is ample with ℓ1\ell_105 and ℓ1\ell_106 (Bandelt et al., 29 Mar 2026).

The oriented-matroid analogy is made through cocircuits. The minimal elements of ℓ1\ell_107 under ℓ1\ell_108 form

ℓ1\ell_109

and ℓ1\ell_110. The paper states that ℓ1\ell_111 is ample if and only if ℓ1\ell_112 satisfies SCA, equivalently if ℓ1\ell_113 does, and similarly for the complementary circuit system ℓ1\ell_114 (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 ℓ1\ell_115, 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).

Lawrence’s original orthant-intersection viewpoint is recovered through the construction

ℓ1\ell_116

where

ℓ1\ell_117

The paper proves that ℓ1\ell_118 is ample if and only if there exists a weakly convex ℓ1\ell_119, equivalently a compact weakly convex ℓ1\ell_120, such that ℓ1\ell_121. One direction uses ℓ1\ell_122; 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 ℓ1\ell_123, let ℓ1\ell_124 denote the orthogonal projection of ℓ1\ell_125 to ℓ1\ell_126, and let ℓ1\ell_127 be the cubihedron of the projected sign family ℓ1\ell_128. Then ℓ1\ell_129 is ample if and only if

ℓ1\ell_130

equivalently if

ℓ1\ell_131

(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 ℓ1\ell_132-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 ℓ1\ell_133-geometric realization without distortion under passage to faces, fibers, and projections.

6. Other established uses of “lopsided sets”

In additive combinatorics, a subset ℓ1\ell_134 is called lopsided when its sumset

ℓ1\ell_135

and difference set

ℓ1\ell_136

have different sizes. The paper distinguishes sum-dominated sets, difference-dominated sets, and balanced sets. For random ℓ1\ell_137 formed by including each residue independently with probability ℓ1\ell_138, it proves a phase transition near ℓ1\ell_139: if ℓ1\ell_140, then ℓ1\ell_141 almost surely; if ℓ1\ell_142, then ℓ1\ell_143; and if ℓ1\ell_144 with ℓ1\ell_145 prime, then ℓ1\ell_146 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

ℓ1\ell_147

For ℓ1\ell_148, write

ℓ1\ell_149

Then ℓ1\ell_150 is lopsided at ℓ1\ell_151 if there exists ℓ1\ell_152 such that

ℓ1\ell_153

The lopsided amoeba ℓ1\ell_154 is the set where ℓ1\ell_155 is not lopsided, and it contains the true amoeba ℓ1\ell_156. Purbhoo’s approximation scheme uses cyclic resultants ℓ1\ell_157, with ℓ1\ell_158 converging uniformly to ℓ1\ell_159 as ℓ1\ell_160; the paper then develops fast dyadic algorithms for computing ℓ1\ell_161 and reports speedups from ℓ1\ell_162 to roughly ℓ1\ell_163 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 ℓ1\ell_164 isotropic Monte Carlo realizations per host, with only angular positions randomized and radial distances fixed. The preferred diagnostic is the wedge metric

ℓ1\ell_165

with a meta-ℓ1\ell_166-value to control scanning over opening angles ℓ1\ell_167. Under this metric, about ℓ1\ell_168 of tested systems are significantly lopsided, compared to the ℓ1\ell_169 null expectation at ℓ1\ell_170; combining all six metrics raises the fraction to about ℓ1\ell_171 (Heesters et al., 2024). The paper further reports that outer satellites dominate the signal and that restricting all systems to satellites within ℓ1\ell_172 kpc reduces the wedge-significant fraction from ℓ1\ell_173 to ℓ1\ell_174 (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.

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 Lopsided Sets.