32 problems
- 0 votes0 replies1 view
Wise's virtual free-by-cyclic conjecture for hyperbolic one-relator groups
Let be a hyperbolic one-relator group. Wise's conjecture. Every such group is virtually free-by-cyclic. If true, this would imply that every hyperbolic one-relator group admits…
- 0 votes0 replies1 view
Convergence conjecture for the Temperley–Lieb algebra rewriting system
Convergence conjecture. This rewriting system is convergent, meaning that it is terminating and confluent.
- 0 votes0 replies0 views
The conjecture that higher-dimensional resource-management cells control type C bureaucracy
The discussion concerns a family of -dimensional resource-management cells arising from local computations on proofs, including cells for a weakening followed by a contraction,…
- 0 votes0 replies0 views
Converse property for the congruence on Petri-net 2-arrows
Converse property. If and are two parallel -arrows in such that , then
- 0 votes0 replies0 views
Nonexistence conjecture for finite terminal confluent link-diagram reductions
Nonexistence conjecture. For any given surface , there does not exist a set of terminal and confluent reduction rules with these properties. A proof would rule out this proposed…
- 0 votes0 replies1 view
Madlener–Otto conjecture on confluent length-reducing rewriting systems
Madlener–Otto conjecture. A group admits a finite confluent length-reducing rewriting system if and only if it is plain.
- 0 votes0 replies0 views
Koszulness and confluence conjecture for the family of associative–coassociative properads
Conjecture. For every , the following are equivalent: the properad induces a confluent system; the morphism is a bijection in weight…
- 0 votes0 replies0 views
Equivalence conjecture for amoeba immortality notions
Immortality-equivalence conjecture. The following properties of an amoeba are equivalent:
- 0 votes0 replies0 views
The plainness conjecture for inverse-closed finite convergent length-reducing rewriting systems
Let an inverse-closed finite convergent length-reducing rewriting system present a group. A group is plain if it is a free product of finitely many finite groups and finitely gener…
- 0 votes0 replies1 view
Madlener and Otto's plain group conjecture
Let be a group. Say that is plain if it is isomorphic to a free product of finitely many finite groups and finitely many copies of . A finite convergent length-r…
- 0 votes0 replies0 views
The finite complete rewriting system conjecture for one-relation monoids
A one-relation monoid is a monoid given by a finite presentation with one defining relation. A finite complete rewriting system is a finite rewriting system that is both terminatin…
- 0 votes0 replies0 views
Completeness conjecture for generalized controlled-not identities on Boolean isomorphisms
Completeness conjecture for generalized controlled-not identities. These identities are complete for : every equality of Boolean isomorphisms…
- 0 votes0 replies0 views
Madlener–Otto conjecture on length-reducing rewriting systems
Let be a group. A finite convergent length-reducing rewriting system for is a presentation by such a system. Madlener–Otto conjecture. admits a finite conv…
- 0 votes0 replies0 views
Gilman's conjecture on length-reducing rewriting systems
Let be a group. A finite convergent length-reducing rewriting system for is a presentation by such a system, where each rewriting rule has a right-hand side of…
- 0 votes0 replies1 view
Convergent presentation conjecture for the magmatic quotient by the arity-3 and arity-4 relations
Let be the quotient of the magmatic operad by the relations represented by the arity- and arity- trees. Consider the displayed rewrite rules, includi…
- 0 votes0 replies0 views
Nonexistence of finite tree-based convergent presentations for higher comb associative operads
Let be the higher comb associative operad, let be the magmatic operad of trees, and consider rewrite presentations whose left- a…
- 0 votes0 replies0 views
Nonexistence of finite convergent presentations for higher comb associative operads
Let denote the higher comb associative operad associated with , and let the algorithm described in the paper be the completion algorith…
- 0 votes0 replies1 view
Gilman's conjecture on monadic confluent rewriting systems
Let be a finite, monadic, confluent rewriting system presenting a group . A plain group is a free product of a finitely generated free group with finitely many fini…
- 0 votes0 replies0 views
Conjecture on padded semi-convergence for Artin–Tits monoids
Let be an Artin–Tits monoid. A padding of a multifraction is obtained by inserting an even number of trivial components at its beginning; semi-convergence up to -padding mea…
- 0 votes0 replies0 views
Conjecture A on semi-convergence for Artin–Tits monoids
Let be an Artin–Tits monoid, and let -reduction be the reduction system on multifractions associated with . Conjecture A. -reduction is semi-conver…
- 0 votes0 replies0 views
Normal forms for reduction sequences
Let be a gcd-monoid, let be its reduction system, and let an -multifraction be a multifraction with entries. A reduction sequence is a sequence of elem…
- 0 votes0 replies0 views
Tame reduction to the trivial multifraction for Artin-Tits monoids
Let be an Artin–Tits monoid, let be the set of multifractions over , and let denote tame reduction. A multifraction is un…
- 0 votes0 replies0 views
Uniform cross-confluence of reduction for Artin-Tits monoids
Let be an Artin–Tits monoid and let be its reduction system on multifractions. The system is uniformly cross-confluent if there is a map from multifr…
- 0 votes0 replies1 view
Cross-confluence of reduction for Artin-Tits monoids
Let be an Artin–Tits monoid and let be its reduction system on multifractions. Two multifractions are right reducts of the same multifraction if they are obta…
- 0 votes0 replies1 view
Dehornoy's conjecture on Property H for Artin–Tits groups
Let be an Artin–Tits presentation, let be a word, and write for the group element represented by . Let…