Year: 2025
Type: article
Abstract: An expression is any mathematical formula that contains certain formal variables and opera-tions to be executed in a specified order. In computer science, it is usually convenient to represent each expression in the form of an expression tree. Here, we consider only arithmetic expressions, i.e., those that contain only the four standard arithmetic operations: addition, subtraction, multiplication and division, alongside additive inversion. We first provide certain theoretical results concerning the equivalence of such expressions and then disclose a ?(n2) algorithm that computes the number of inequivalent arithmetic expressions on n distinct variables.
Source: Filomat
DOI: 10.2298/fil2503949s
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4412898622