On compatibility of discrete relations

Authors:
Vladimir V. Kornyak
Affiliations:
Laboratory of Information Technologies, Joint Institute for Nuclear Research, Dubna, Russia
Venue:
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Year:
2005

Citing 2
Cited 7

Finite fields

Finite fields
A new kind of science

A new kind of science

A pommaret division algorithm for computing Grobner bases in boolean rings

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Involutive method for computing Gröbner bases over $$ \mathbb{F}_2 $$

Programming and Computing Software
Role of involutive criteria in computing Boolean Gröbner bases

Programming and Computing Software
On computation of Boolean involutive bases

Programming and Computing Software
Cellular automata with symmetric local rules

CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
BIBasis, a package for reduce and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases

Programming and Computing Software
Symmetries and dynamics of discrete systems

CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach to compatibility analysis of systems of discrete relations is proposed. Unlike the Gröbner basis technique, the proposed scheme is not based on the polynomial ring structure. It uses more primitive set-theoretic and topological concepts and constructions. We illustrate the approach by application to some two-state cellular automata. In the two-state case the Gröbner basis method is also applicable, and we compare both approaches.