Uniform Subpower Membership for Finite Algebras with Cube Terms of Fixed Dimension

The subpower membership problem asks whether a target tuple belongs to the subalgebra generated by given tuples in a product of finite algebras. We study the version in which the algebras are part of the input and are given by full operation tables, for algebras with a common cube term of dimension d, equivalently with a common edge term of dimension d. Here the dimension is a parameter of the problem. By a companion manuscript, a bound of the form f(d)·N^O(1) in the input length N is excluded unless FPT = W[2], already for two-element algebras whose only basic operation is a near-unanimity operation. For every fixed d we show that the problem is decidable in time N^O(d), with an absolute constant in the exponent, when an edge operation of dimension d is among the basic operations, or when an edge term can be evaluated in time N^O(d), and also when the algebras are idempotent and a cube term of dimension d is only promised to exist. For arbitrary algebras with a promised cube term of dimension d we obtain time N^O(d^2), and time N^O(d) if a term can be evaluated in time N^O(d) that is an edge term on the sections with nonabelian monoliths, in particular if the basic operations are idempotent on these sections. As a consequence, for a fixed finite family of finite algebras with a common cube term the exponent of a polynomial-time membership algorithm can be taken to depend only on d. The proofs build on a manuscript of the author on the uniform problem for Mal'tsev algebras, which is the case d = 2, and use statements of that manuscript as described in the text. The additions are a lemma that reaches every member of a relation closed under an edge operation by maps that act on d-1 tuples at a time, and a version of the central closure procedure of that manuscript for multiplications with a one-sided identity. Whether the exponent O(d) can be reached when a cube term is only promised to exist and some section with a nonabelian monolith is not idempotent remains open.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24223904
Citations
1
Primary Topic
Advanced Graph Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Uniform Subpower Membership for Finite Algebras with Cube Terms of Fixed Dimension

Asterios Gkantzounis
1 citations
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
preprint

Uniform Subpower Membership for Finite Algebras with Cube Terms of Fixed Dimension

Asterios Gkantzounis
preprint en
1 citations

Abstract

The subpower membership problem asks whether a target tuple belongs to the subalgebra generated by given tuples in a product of finite algebras. We study the version in which the algebras are part of the input and are given by full operation tables, for algebras with a common cube term of dimension d, equivalently with a common edge term of dimension d. Here the dimension is a parameter of the problem. By a companion manuscript, a bound of the form f(d)·N^O(1) in the input length N is excluded unless FPT = W[2], already for two-element algebras whose only basic operation is a near-unanimity operation. For every fixed d we show that the problem is decidable in time N^O(d), with an absolute constant in the exponent, when an edge operation of dimension d is among the basic operations, or when an edge term can be evaluated in time N^O(d), and also when the algebras are idempotent and a cube term of dimension d is only promised to exist. For arbitrary algebras with a promised cube term of dimension d we obtain time N^O(d^2), and time N^O(d) if a term can be evaluated in time N^O(d) that is an edge term on the sections with nonabelian monoliths, in particular if the basic operations are idempotent on these sections. As a consequence, for a fixed finite family of finite algebras with a common cube term the exponent of a polynomial-time membership algorithm can be taken to depend only on d. The proofs build on a manuscript of the author on the uniform problem for Mal'tsev algebras, which is the case d = 2, and use statements of that manuscript as described in the text. The additions are a lemma that reaches every member of a relation closed under an edge operation by maps that act on d-1 tuples at a time, and a version of the central closure procedure of that manuscript for multiplications with a one-sided identity. Whether the exponent O(d) can be reached when a cube term is only promised to exist and some section with a nonabelian monolith is not idempotent remains open.

Zenodo (CERN European Organization for Nuclear Research)
Technical University of Crete (GR)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon