9 problems
- 0 votes0 replies0 views
Conjecture 8 on limits of the ordered complexity sets
Let for be the sets … ordered by if and only if . For a well-ordered set and an ordinal , let denote the elemen…
- 0 votes0 replies0 views
Conjecture 3 on ordered complexity sequences
Let the sequences referred to in Conjecture 3 be sequences of natural numbers intended to describe numbers of complexity . Conjecture 3. There should be sequences satisfying…
- 0 votes0 replies0 views
The wqo characterization of hereditary ages avoiding finite-subset inclusion
Let be an age of finite structures, ordered by embeddability, and let denote the collection of finite subsets of , ordered by inclusion. A…
- 0 votes0 replies0 views
Amenable strongly transitive action on a totally ordered set
Let be a group acting strongly transitively on a totally ordered set by order-preserving bijections. Amenability conjecture. There exists an amenable group admitting su…
- 0 votes0 replies0 views
Characterization of closed upper sets in the MacNeille completion of the free monoid
Closed-upper-set characterization. An upper set of is closed if and only if it satisfies the four rules.
- 0 votes0 replies0 views
Kaplansky's characterization conjecture for prime spectra of commutative rings
Kaplansky's conjecture. These two properties characterize the prime spectrum of a commutative ring.
- 0 votes0 replies0 views
Least-upper-bound conjecture for labeled Fibonacci trees
Let be the set of labeled Fibonacci trees, and let be the partial order on defined by the subtree relation. For ,…
- 0 votes0 replies0 views
The 1/3-2/3 conjecture for finite ordered sets
Let be a finite ordered set, meaning that is finite and is reflexive, antisymmetric, and transitive. A linear extension of is a linear ordering of e…
- 0 votes0 replies0 views
Finiteness conjecture for chain obstructions in algebraic lattices
Let be a countable chain, and let be a set of join-semilattices with least element such that an algebraic lattice contains no chain of order type…