The following pages link to Unary polynomials in algebras. I (Q798350):
Displaying 26 items.
- Transformation monoids with finite monoidal intervals (Q522226) (← links)
- The order on the rationals has an orthogonal order with the same order type (Q651428) (← links)
- Relational systems with trivial endomorphisms and polymorphisms (Q762526) (← links)
- Weak orders admitting a perpendicular linear order (Q861798) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- Simple Abelian algebras (Q1208094) (← links)
- The set of types of a finitely generated variety (Q1210548) (← links)
- An approach to tame congruence theory via subtraces (Q1312169) (← links)
- Term minimal algebras (Q1342128) (← links)
- Perpendicular orders (Q1343793) (← links)
- The number of orthogonal permutations (Q1345530) (← links)
- Monoid intervals in lattices of clones (Q1918781) (← links)
- Semirigid sets of diamond orders (Q1923526) (← links)
- Orthogonal countable linear orders (Q2314417) (← links)
- On groups with every normal subgroup transitive or semiregular. (Q2482076) (← links)
- Monoidal intervals on three- and four-element sets (Q2973185) (← links)
- v*-ALGEBRAS, INDEPENDENCE ALGEBRAS AND LOGIC (Q3112588) (← links)
- Characterizing Translations on Groups by Cosets of Their Subgroups (Q3145427) (← links)
- CLONES CLOSED UNDER CONJUGATION I: CLONES WITH CONSTANTS (Q3502745) (← links)
- Categorical quasivarieties via Morita equivalence (Q4508266) (← links)
- SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS (Q5386972) (← links)
- TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS (Q5483456) (← links)
- Polynomially rich algebras (Q5929285) (← links)
- Efficient realizations of closure systems (Q6193266) (← links)
- The minimal closed monoids for the Galois connection \(\mathrm{End}\)-\(\mathrm{Con}\). (Q6648100) (← links)
- Finite algebras with Hom-sets of polynomial size (Q6653796) (← links)
