Canonical, finite-order, and rowmotion primitives for zero-mesies
Statement
Problem 1.2. Find simple and uniform constructions for such functions g for a wide range of 0-mesies f.
1.3 Dynamical closures
In most cases of combinatorial interest, the "feature space" V is not preserved by the map T; that is, for f: X → R a function in V, the time-shifted function
f ◦T: X → R typically is not in V. It therefore seems natural, when T is of finite order (order n, say), to replace V by a larger but still finite-dimensional space
V T (the "dynamical closure" of V ) defined as the smallest set of functions that contains V and contains f ◦ T whenever it contains f. Indeed, many important dynamical properties of (X, T, V ) reduce to linear (or more generally affine) relations satisfied in V T: invariance asserts that for some particular f ∈ V, f
equals f ◦ T; homomesy asserts that for some particular f ∈ V, f + f ◦ T + f ◦
T 2 + · · · + f ◦ T n−1 equals a constant function; and reciprocity asserts that for some particular f, g ∈ V and some particular k, f + g ◦ T k is the zero function. Also (to give an example that seems to be very narrow but whose seeming narrowness may be merely a reflection of our ignorance of analogous behavior in other dynamical systems), we may note that the combinatorial fact that underlies the existence of the Armstrong-Stanley way of looking at Panyushev complementation of antichains in [a] × [b], namely, the fact that A contains an element in the ith fiber if and only if the Panyushev complement of A contains an element in the ( i + 1 )st fiber (as long as i < a ), can also be expressed as a linear relation in V T.Here is an outline for how to approach V T systematically. Letting f1,..., f N
denote a basis for V T, define V T (X) to be the set of N -tuples (f1(x),..., f N (x))
as x varies over X. Figuring out what linear relations are satisfied by the functions f1,..., f N when they are restricted to V T (X) is equivalent to:
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.