The nonassociativity of the double minus operation

Jia Huang, Madison Mickey, Jianbai Xu

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The sequence A000975 in the Encyclopedia of Integer Sequences can be defined by A1 = 1, An+1 = 2An if n is odd, and An+1 = 2An+1 if n is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several interesting families of objects. We provide a new interpretation of this sequence using a binary operation defined by a ⊖ b := -a - b. We show that the number of distinct results obtained by inserting parentheses in the expression x0 ⊖ x1 ⊖ … ⊖ xn equals An, by investigating the leaf depth in binary trees. Our result can be viewed as a quantitative measurement for the nonassociativity of the binary operation ⊖.

Original languageEnglish (US)
Article number17.10.3
JournalJournal of Integer Sequences
Volume20
Issue number10
StatePublished - Jan 1 2017

Fingerprint

Binary operation
Integer Sequences
Binary Tree
Recurrence relation
Leaves
Odd
Distinct
Closed
Family
Object
Interpretation

Keywords

  • Binary sequence
  • Binary tree
  • Leaf depth
  • Nonassociativity
  • Parenthesization

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

The nonassociativity of the double minus operation. / Huang, Jia; Mickey, Madison; Xu, Jianbai.

In: Journal of Integer Sequences, Vol. 20, No. 10, 17.10.3, 01.01.2017.

Research output: Contribution to journalArticle

Huang, Jia ; Mickey, Madison ; Xu, Jianbai. / The nonassociativity of the double minus operation. In: Journal of Integer Sequences. 2017 ; Vol. 20, No. 10.
@article{f8829a9ecaae4974807174c85862da75,
title = "The nonassociativity of the double minus operation",
abstract = "The sequence A000975 in the Encyclopedia of Integer Sequences can be defined by A1 = 1, An+1 = 2An if n is odd, and An+1 = 2An+1 if n is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several interesting families of objects. We provide a new interpretation of this sequence using a binary operation defined by a ⊖ b := -a - b. We show that the number of distinct results obtained by inserting parentheses in the expression x0 ⊖ x1 ⊖ … ⊖ xn equals An, by investigating the leaf depth in binary trees. Our result can be viewed as a quantitative measurement for the nonassociativity of the binary operation ⊖.",
keywords = "Binary sequence, Binary tree, Leaf depth, Nonassociativity, Parenthesization",
author = "Jia Huang and Madison Mickey and Jianbai Xu",
year = "2017",
month = "1",
day = "1",
language = "English (US)",
volume = "20",
journal = "Journal of Integer Sequences",
issn = "1530-7638",
publisher = "University of Waterloo",
number = "10",

}

TY - JOUR

T1 - The nonassociativity of the double minus operation

AU - Huang, Jia

AU - Mickey, Madison

AU - Xu, Jianbai

PY - 2017/1/1

Y1 - 2017/1/1

N2 - The sequence A000975 in the Encyclopedia of Integer Sequences can be defined by A1 = 1, An+1 = 2An if n is odd, and An+1 = 2An+1 if n is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several interesting families of objects. We provide a new interpretation of this sequence using a binary operation defined by a ⊖ b := -a - b. We show that the number of distinct results obtained by inserting parentheses in the expression x0 ⊖ x1 ⊖ … ⊖ xn equals An, by investigating the leaf depth in binary trees. Our result can be viewed as a quantitative measurement for the nonassociativity of the binary operation ⊖.

AB - The sequence A000975 in the Encyclopedia of Integer Sequences can be defined by A1 = 1, An+1 = 2An if n is odd, and An+1 = 2An+1 if n is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several interesting families of objects. We provide a new interpretation of this sequence using a binary operation defined by a ⊖ b := -a - b. We show that the number of distinct results obtained by inserting parentheses in the expression x0 ⊖ x1 ⊖ … ⊖ xn equals An, by investigating the leaf depth in binary trees. Our result can be viewed as a quantitative measurement for the nonassociativity of the binary operation ⊖.

KW - Binary sequence

KW - Binary tree

KW - Leaf depth

KW - Nonassociativity

KW - Parenthesization

UR - http://www.scopus.com/inward/record.url?scp=85034214669&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034214669&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85034214669

VL - 20

JO - Journal of Integer Sequences

JF - Journal of Integer Sequences

SN - 1530-7638

IS - 10

M1 - 17.10.3

ER -