English
Related papers

Related papers: Algebras from Congruences

200 papers

A compact T-algebra is an initial T-algebra whose inverse is a final T-coalgebra. Functors with this property are said to be algebraically compact. This is a very strong property used in programming semantics which allows one to interpret…

Logic in Computer Science · Computer Science 2020-09-16 Vladimir Zamdzhiev

We prove that every distributive algebraic lattice with at most $\aleph\_1$ compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The $\aleph\_1$ bound is optimal, as…

General Mathematics · Mathematics 2007-05-23 Pavel Ruzicka , Jiri Tuma , Friedrich Wehrung

Polynomial completeness results aim at characterizing those functions that are induced by polynomials. Each polynomial function is congruence preserving, but the opposite need not be true. A finite algebraic structure $\mathbf{A}$ is called…

Rings and Algebras · Mathematics 2024-04-23 Bernardo Rossi

Let k be a global field and let k_v be the completion of k with respect to v, a non-archimedean place of k. Let \mathbf{G} be a connected, simply-connected algebraic group over k, which is absolutely almost simple of k_v-rank 1. Let…

Group Theory · Mathematics 2007-10-23 A. W. Mason , A. Premet , B. Sury , P. A. Zalesskii

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

General Mathematics · Mathematics 2017-02-27 Danica Jakubíková-Studenovská , Reinhard Pöschel , Sándor Radeleczki

The paper is devoted to the investigation of finite dimensional commutative nilpotent (associative) algebras N over an arbitrary base field of characteristic zero. Due to the lack of a general structure theory for algebras of this type (as…

Commutative Algebra · Mathematics 2011-08-08 Gregor Fels , Wilhelm Kaup

The subpower membership problem SMP(A) of a finite algebraic structure A asks whether a given partial function from A^k to A can be interpolated by a term operation of A, or not. While this problem can be EXPTIME-complete in general,…

Rings and Algebras · Mathematics 2023-09-29 Michael Kompatscher

We study the problem of whether a given finite algebra with finitely many basic operations contains a cube term; we give both structural and algorithmic results. We show that if such an algebra has a cube term then it has a cube term of…

Rings and Algebras · Mathematics 2020-09-17 Alexandr Kazda , Dmitriy Zhuk

We show that group C*-algebras of finitely generated, nilpotent groups have finite nuclear dimension. It then follows, from a string of deep results, that the C*-algebra $A$ generated by an irreducible representation of such a group has…

Operator Algebras · Mathematics 2015-05-15 Caleb Eckhardt , Paul McKenney

The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…

Computational Complexity · Computer Science 2023-07-07 Miguel Campercholi , Diego Castaño , Gonzalo Zigarán

Clonoids are sets of finitary operations between two algebraic structures that are closed under composition with their term operations on both sides. We conjecture that, for finite modules $\mathbf A$ and $\mathbf B$ there are only finitely…

Rings and Algebras · Mathematics 2026-02-05 Stefano Fioravanti , Michael Kompatscher , Bernardo Rossi

We prove a characterization of profinite algebras, i.e., topological algebras that are isomorphic to a projective limit of finite discrete algebras. In general profiniteness concerns both the topological and algebraic characteristics of a…

Logic · Mathematics 2020-08-25 Friedrich Martin Schneider , Jens Zumbrägel

The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…

Logic in Computer Science · Computer Science 2020-07-21 Andrei A. Bulatov

We give a Clifford correspondence for an algebra A over an algebraically closed field, that is an algorithm for constructing some finite-dimensional simple A-modules from simple modules for a subalgebra and endomorphism algebras. This…

Rings and Algebras · Mathematics 2007-05-23 Sarah J. Witherspoon

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…

Combinatorics · Mathematics 2020-06-09 A. Arnold , P. Cegielski , S. Grigorieff , I. Guessarian

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Logic · Mathematics 2014-06-26 Shohei Izawa

We show that if $A$ is a separable, simple and non-type I C$^{\ast}$ algebra, then for every properly infinite hyperfinite von Neumann algebra $M$ with separable predual, its Ocneanu ultrapower $M'\cap M^{\omega}$ arises as a sub-quotient…

Operator Algebras · Mathematics 2017-05-17 Hiroshi Ando , Eberhard Kirchberg

We give a classification result for a certain class of $C^{*}$-algebras $\mathfrak{A}$ over a finite topological space $X$ in which there exists an open set $U$ of $X$ such that $U$ separates the finite and infinite subquotients of…

Operator Algebras · Mathematics 2015-05-28 Soren Eilers , Gunnar Restorff , Efren Ruiz

The relative commutant $A'\cap A^{\mathcal{U}}$ of a strongly self-absorbing algebra $A$ is indistinguishable from its ultrapower $A^{\mathcal{U}}$. This applies both to the case when $A$ is the hyperfinite II$_1$ factor and to the case…

Logic · Mathematics 2016-04-19 Ilijas Farah , Bradd Hart , Mikael Rørdam , Aaron Tikuisis

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…

Logic in Computer Science · Computer Science 2015-07-01 Libor Barto , Marcin Kozik