Polynomial interpolation and the Chinese remainder theorem for algebraic systems

DOI10.1007/BF01187059zbMath0292.08004OpenAlexW2093461317MaRDI QIDQ1211524

Publication date: 1975

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/172222

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Varieties (08B99) Algebraic structures (08Axx)

Related Items (83)

Quasi-median graphs from sets of partitions ⋮ THE LATTICE OF ALTER EGOS ⋮ General metrics and contracting operations ⋮ Dualizing clones as models of Lawvere theories. ⋮ A short introduction to clones. ⋮ Partition-induced natural dualities for varieties of pseudo-complemented distributive lattices ⋮ De Morgan clones and four-valued logics ⋮ Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) ⋮ Semantical conditions for the definability of functions and relations ⋮ О выразительных возможностях максимально паранепротиворечивых и параполных четырехзначных расширений FDE ⋮ Preserving near unanimity terms under products ⋮ Polymorphism clones of homogeneous structures: gate coverings and automatic homeomorphicity ⋮ Monotone clones, residual smallness and congruence distributivity ⋮ Critical relations of crowns in critical times of coronavirus depression ⋮ Subdirectly irreducible algebras in one class of algebras with one operator and the main near-unanimity operation ⋮ Representation of general and polyhedral subsemilattices and sublattices of product spaces ⋮ Piggyback-Dualitäten ⋮ Towards a characterization of constant-factor approximable finite-valued CSPs ⋮ Meet-irreducible submaximal clones determined by nontrivial equivalence relations ⋮ Restricted Priestley dualities and discriminator varieties ⋮ On the minimality of some generating sets of the aggregation clone on a finite chain ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Constraint satisfaction problem: what makes the problem easy ⋮ A short proof of the Baker–Pixley theorem for classes ⋮ New perspectives on semi-primal varieties ⋮ Submaximal clones over a three-element set up to minor-equivalence ⋮ Congruence-distributive varieties of algebras ⋮ Arithmeticity at 0 ⋮ On finitely related semigroups. ⋮ Baker–Pixley theorem for algebras in relatively congruence distributive quasivarieties ⋮ Learnability of quantified formulas. ⋮ On the number of finite algebraic structures ⋮ The existence of a near-unanimity function is decidable ⋮ Universal algebras ⋮ 𝜔-categorical structures avoiding height 1 identities ⋮ Varieties with few subalgebras of powers ⋮ A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots). ⋮ Counting relations on Ockham algebras. ⋮ THE SUBPOWER MEMBERSHIP PROBLEM FOR MAL'CEV ALGEBRAS ⋮ A clonoid based approach to some finiteness results in universal algebraic geometry ⋮ Infinitary Baker-Pixley theorem ⋮ On the clone of aggregation functions on bounded lattices ⋮ A Generalized Version of the Baker–Pixley Theorem ⋮ On orders of closed classes containing a homogeneous switching function ⋮ On polymorphism-homogeneous relational structures and their clones. ⋮ On the number of clonoids ⋮ SUBALGEBRAS OF THE SQUARES OF FINITE MINIMAL MAJORITY ALGEBRAS ⋮ Über kompatible Funktionen in universalen Algebren ⋮ Hardness results for the subpower membership problem ⋮ The generation of clones with majority operations ⋮ Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs ⋮ COUNTING THE RELATIONS COMPATIBLE WITH AN ALGEBRA ⋮ As Close as It Gets ⋮ Random models of idempotent linear Maltsev conditions. I. Idemprimality ⋮ Equivalence of operations with respect to discriminator clones ⋮ Characterizations of majority categories ⋮ Constraints, consistency and closure ⋮ Transferring Optimal Dualities: Theory and Practice ⋮ TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS ⋮ The existence of a near-unanimity term in a finite algebra is decidable ⋮ Term operations in \(\mathcal{V}(N_5)\) ⋮ Constant-Query Testability of Assignments to Constraint Satisfaction Problems ⋮ Mitschke's theorem is sharp ⋮ Minimal distance of propositional models ⋮ Bimonotone subdivisions of point configurations in the plane ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Orders of discriminator classes in multivalued logic ⋮ Unnamed Item ⋮ Recent Results on the Algebraic Approach to the CSP ⋮ Finite degree clones are undecidable ⋮ A representation theory for the variety generated by the triangle ⋮ 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 ⋮ Unnamed Item ⋮ BL-global representations ⋮ Between an n-ary and an n + 1-ary near-unanimity term ⋮ CLONES CONTAINING MAL'TSEV OPERATIONS ⋮ Affine Complete Algebras ⋮ Menger systems of idempotent cyclic and weak near-unanimity multiplace functions ⋮ MCP: capturing big data by satisfiability (tool description) ⋮ Bimonotone linear inequalities and sublattices of \(\mathbb R^n\)

Cites Work

This page was built for publication: Polynomial interpolation and the Chinese remainder theorem for algebraic systems