Quasidominance Condition: Controlled Domination
- The quasidominance condition is a versatile concept enforcing controlled domination constraints across diverse areas like graph theory, ideal theory, and universal algebra.
- It encapsulates structured limitations, such as k-quasiperfect domination in graphs and exact factor-lifting properties in sharp domains, bridging theory with measurable criteria.
- Its applications extend to matrix dynamics, probability, and potential theory, providing a unifying framework for controlled domination principles in complex systems.
The expression quasidominance condition does not denote a single standardized concept across the arXiv literature. In the cited papers it is used, or explicitly identified as a useful label, for several distinct formal conditions: a bounded-overlap domination requirement in graph theory, a Schreier-type ideal factor-lifting property in integral domains, an intermediate near-unanimity condition in universal algebra, singular-value criteria equivalent to dominated splitting for matrix sequences, and several dominance or tail-control conditions in matrix theory, probability, and potential theory (Cáceres et al., 2014, Ahmad et al., 2011, Lipparini, 2021, Sun et al., 27 Jan 2025). This suggests a common organizing idea—controlled domination subject to upper constraints—but the technical content depends entirely on the surrounding discipline.
1. Terminological scope and formal patterns
In the supplied literature, the same label is attached to conditions that are formally unrelated. What unifies them is not a shared definition, but a recurring schema: one asks that an object dominate another while preserving a bounded multiplicity, an exact factorization, an eventual tail pattern, or an integrable majorant.
| Area | Ambient object | Formal core |
|---|---|---|
| Graph theory | ||
| Ideal theory | nonzero ideals of | or with enlarged factors |
| Universal algebra | -ary term | identities (Eq. 3.1)–(Eq. 3.3) |
| Matrix cocycles | bounded | (SVG) + (FI) |
| qpr-sequences | once appears, the tail is all 0 | |
| Potential theory | family 1 | 2 with 3 plus structural hypotheses |
Because these notions live in different subjects, direct transfer of results between them is generally impossible. The same phrase therefore functions as a cross-disciplinary label rather than a universally fixed term.
2. Graph-theoretic quasidominance
In graph theory, the relevant notion is 4-quasiperfect domination. For a finite, undirected, simple, connected graph 5 and 6, a set 7 is a 8-quasiperfect dominating set if it is dominating and satisfies the quasidominance condition
9
The minimum cardinality of such a set is the 0-quasiperfect domination number 1, also written in the paper as 2 (Cáceres et al., 2014).
This condition interpolates between two classical extremes. When 3, every vertex outside 4 has exactly one neighbor in 5, so one recovers perfect domination: 6 When 7, the upper bound is vacuous for dominating sets, and ordinary domination is recovered: 8 Accordingly, the parameters form the decreasing chain
9
The paper interprets this chain as measuring how far a graph is from being perfectly dominated, and calls it short when 0 (Cáceres et al., 2014).
Several structural facts govern these parameters. If 1, then the tail stabilizes: 2 There are also local constraints that are frequently used in proofs: if a vertex 3 satisfies 4, then necessarily 5; if 6 is a clique and 7, then 8. The paper further gives a 9–0 integer programming formulation with the adjacency matrix 1, characteristic vector 2, and all-ones vector 3: 4 with objective 5 (Cáceres et al., 2014).
The principal structural theorem identifies broad graph classes in which the chain is short: if 6 satisfies any of the following, then 7: 8, 9, 0 is a cograph, or 1 is claw-free. The paper develops these cases in detail. For connected cographs, explicit values of 2 are obtained via the join decomposition 3; for claw-free graphs, broad realizability results for pairs 4 are established; and for extremal maximum degree families, the paper shows that the perfect domination number may vary widely even when the chain is short. Canonical examples include paths, cycles, complete graphs, stars, complete bipartite graphs, and wheels, all of which are analyzed explicitly (Cáceres et al., 2014).
3. Ideal-theoretic quasidominance: sharp and *-sharp domains
In multiplicative ideal theory, the phrase refers to a Schreier-type factor-lifting property. For an integral domain 5, the paper "A Schreier Domain Type Condition" introduces the class of sharp domains: 6 is sharp if for all nonzero ideals 7,
8
The paper explicitly identifies this condition with what is being called the quasidominance condition, and emphasizes that it strengthens the pre-Schreier and quasi-Schreier properties by requiring factor-lifting for all nonzero ideals, not merely principal or invertible ones (Ahmad et al., 2011).
A central characterization is the colon-factorization criterion: 9 for every two nonzero ideals 0. This gives canonical enlargements from any inclusion 1 by taking
2
The valuation-theoretic description is equally strong: for a valuation domain 3, sharpness is equivalent to pseudo-Dedekindness and to the value group 4 being a complete subgroup of 5. From this the paper derives the global structural theorem: if 6 is sharp, then each localization 7 at a maximal ideal is a valuation domain whose value group is a complete subgroup of 8; consequently, 9 is a Prüfer domain of Krull dimension at most 0. Further consequences include
1
and under additional hypotheses one gets Dedekind behavior, for example in TV, Noetherian, Krull, or countable settings (Ahmad et al., 2011).
The companion paper extends this framework to star operations. Let 2 be a star operation on an integral domain 3. The domain is **-sharp* if for all nonzero ideals 4 with 5, there exist nonzero ideals 6 such that
7
This is presented as the star-operation analogue of the same quasidominance pattern (Ahmad et al., 2011).
The *-sharp theory inherits many of the structural features of the sharp case, but now filtered through the star operation. If 8 and 9 is 0-sharp, then 1 is 2-sharp. If 3 is stable and of finite character and 4 is *-sharp, then every localization 5 at a maximal 6-ideal is a valuation domain with value group a complete subgroup of the reals; in particular, 7 is a Prüfer 8-multiplication domain and the 9-dimension is at most 0. The paper also identifies important special cases: 1-sharp is equivalent to complete integral closure, 2-sharp is equivalent to 3-sharp, every Krull domain is 4-sharp, and under TV or countability hypotheses one obtains *-Dedekind or Krull conclusions. Polynomial and Nagata-type extensions are analyzed as well: 5 is 6-sharp if and only if 7 is 8-sharp, and this is also equivalent to sharpness of the localization 9 (Ahmad et al., 2011).
4. Quasidominance as an intermediate near-unanimity condition
In universal algebra, the term is used for the condition that the paper equates with Lipparini’s 00-near-unanimity term. Fix 01. A term 02 of arity 03 witnesses quasidominance if it satisfies the identities
04
05
and
06
The paper proves that this condition is strictly intermediate between having an 07-ary near-unanimity term and having an 08-ary near-unanimity term, with the precise implications
09
and both implications are strict (Lipparini, 2021).
Strictness is witnessed in two directions. For the failure of the reverse implication on the right, the variety 10 has an 11-ary near-unanimity term but is not 12-distributive, whereas quasidominance would force that level of congruence distributivity. For the failure of the reverse implication on the left, the paper constructs a Boolean term-reduct with operation
13
which satisfies the quasidominance identities but admits no 14-ary near-unanimity term (Lipparini, 2021).
The main structural payoff is exact control of congruence identities. Every variety with quasidominance is 15 and 16, where 17 denotes 18-distributivity and 19 denotes 20-modularity. These bounds are sharp: the paper constructs a family 21 for which quasidominance holds but 22 fails and 23 fails. The proofs proceed by extracting directed Jónsson/Gumm chains from the identities above and then converting them into Day terms. The paper also relates the condition to other Maltsev and Taylor notions: quasidominance implies 24 and therefore implies Taylor, with the standard finite-idempotent CSP consequences that accompany near-unanimity polymorphisms (Lipparini, 2021).
5. Singular-value quasidominance for 25-sequences
In the study of bounded matrix sequences 26, the paper "Equivalent Conditions for Domination of 27-sequences" does not formally name a quasidominance condition, but the supplied data identifies the pair (SVG)+(FI) as functioning in precisely that role. Write
28
for the singular values. The relevant conditions are:
29
the singular-value gap condition (SVG), and
30
the fast invertibility condition (FI). The main theorem states that a bounded sequence 31 has dominated splitting if and only if it satisfies both (SVG) and (FI) (Sun et al., 27 Jan 2025).
Dominated splitting is formulated for possibly singular sequences by requiring one-dimensional subspaces 32 with 33-invariance, domination of the form
34
uniform separation 35, and uniform nondegeneracy of blocks. Under dominated splitting, one gets a uniform exponential singular-value gap: 36 Conversely, from (SVG)+(FI) the paper constructs invariant line fields as limits of most contracted and most expanded directions, proves uniform separation, and recovers the domination estimate (Sun et al., 27 Jan 2025).
This formulation clarifies the relationship with classical invertible settings. For bounded 37-sequences, domination reduces to uniform hyperbolicity and (SVG) is equivalent to uniform exponential growth. For bounded 38-sequences with determinants uniformly bounded away from zero, domination is equivalent to (SVG) alone; in the general 39 setting, however, (FI) is necessary, and the paper gives an example where (SVG) holds but uniform separation fails. The same work also proves an Avalanche Principle for possibly singular matrices: under local gap and local alignment assumptions, the sequence has dominated splitting and the quantity 40 is approximated by a telescoping combination of one-step and two-step terms with error bounded by 41 (Sun et al., 27 Jan 2025).
6. Other specialized meanings
A further usage appears in the theory of quasi principal rank characteristic sequences of symmetric matrices. If 42 with symbols in 43, the paper proves the N Theorem: if 44 for some 45, then 46 for all 47. Equivalently, once 48 appears, the sequence is an 49-tail, so the substrings 50 and 51 cannot occur. Over fields of characteristic 52, this tail property together with the terminal constraint 53 completely characterizes attainable qpr-sequences (Fallat et al., 2017).
In probability theory, the paper on strong laws for pairwise positively quadrant dependent random variables does not use the term directly, but the supplied data identifies a quasi-dominance requirement in the form of stochastic domination or necessary tail control. Under pairwise PQD and the dependence summability condition
54
if
55
for some finite 56 and 57, then necessarily
58
equivalently 59. In the sufficiency results cited there, the relevant domination hypothesis is that the sequence is stochastically dominated by a random variable 60: 61 Here the notion is not algebraic or combinatorial; it is a tail-comparison condition controlling large deviations in dependent sequences (Silva, 2020).
In potential theory, Riihentaus extends domination results of Domar and Rippon from subharmonic to quasinearly subharmonic functions. Let 62 be a family of 63-quasinearly subharmonic functions with 64, where 65 is Lebesgue measurable. Under structural hypotheses on increasing functions 66—including the inequality
67
and the convergence condition
68
together with local integrability of 69 on compact sets, the family is locally uniformly bounded and the upper semicontinuous regularization of
70
is 71-quasinearly subharmonic. In this setting the quasidominance idea is a domination-by-majorant principle strong enough to guarantee regularity of the envelope (Riihentaus, 2011).
Taken together, these usages show that quasidominance condition functions as a mathematically portable label rather than a single doctrine. In graph theory it bounds the number of dominators; in ideal theory it forces exact factor-lifting; in universal algebra it isolates a half-step between two near-unanimity arities; in matrix dynamics it becomes quantified singular-value separation; in qpr theory it is an irreversible tail phenomenon; and in probability and potential theory it appears as tail or majorant control. The phrase therefore names a family of analogous strategies—domination with additional quantitative restraint—rather than a unique formalism.