Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures

While researching dynamic data structures of polynomial size that are updated by extremely simple circuits, we have come across many interesting algebraic problems. Some of these simple questions about small sums and products in an algebra would give lower bounds on the complexity of dynamic data structures