Evaluation of polynomials over finite rings via additive combinatorics

DOI10.5565/PUBLMAT6612208MaRDI QIDQ2075306

Yanyan Li

Publication date: 14 February 2022

Published in: Publicacions Matemàtiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.06543

zbMATH Keywords

dichotomynilpotent ringsadditive combinatoricspolynomial methodChevalley's theoremOlson's theoremequation solvability problem

Mathematics Subject Classification ID

Finite rings and finite-dimensional associative algebras (16P10) Other combinatorial number theory (11B75) Computational aspects of associative rings (general theory) (16Z05) Polynomials and finite commutative rings (13M10)

Cites Work

• Unnamed Item
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• Chevalley's theorem with restricted variables
• The complexity of equivalence for commutative rings
• Complexity of the identity checking problem for finite semigroups.
• An extension of Chevalley's theorem to congruences modulo prime powers
• Démonstration d'une hypothèse de M. Artin
• Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\).
• The complexity of the equivalence and equation solvability problems over meta-abelian groups
• The equivalence problem for finite rings
• Computational complexity of checking identities in 0-simple semigroups and matrix semigroups over finite fields
• A combinatorial problem on finite Abelian groups. I
• Complexity issues of checking identities in finite monoids
• The complexity of the equation solvability problem over semipattern groups
• TERM EQUATION SATISFIABILITY OVER FINITE ALGEBRAS
• MONOIDS AND COMPUTATIONS

This page was built for publication: Evaluation of polynomials over finite rings via additive combinatorics