SearcharxivSearch

arXiv subjects

Max Wiebe

Publications and source records attributed to Max Wiebe.

4 recordsLinked to original sources

A Fra\"iss\'e theory for partial orders of a fixed finite dimension

For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit $(D_n,<,<_1,\ldots,<_n)$. We give a finite axiomatization of this limit which specifies it uniquely up to isomorphism among countable structures, show that its class of finite substructures satisfies the Ramsey property, and conclude, by the Kechris--Pestov--Todor\v{c}evi\'{c} correspondence, that the automorphism group of the limit is extremely amenable. We then identify the universal minimal flow of the automorphism group of the reduct $(D_n,<)$. Similar results are established for the $n$-dimensional rational grid $(\mathbb{Q}^n,<)$ and its expansion by the coordinate orders.

math.CO

Correlations of minimal forbidden factors of the Fibonacci word

If $u$ and $v$ are two words, the correlation of $u$ over $v$ is a binary word that encodes all possible overlaps between $u$ and $v$. This concept was introduced by Guibas and Odlyzko as a key element of their method for enumerating the number of words of length $n$ over a given alphabet that avoid a given set of forbidden factors. In this paper we characterize the pairwise correlations between the minimal forbidden factors of the infinite Fibonacci word.

math.CO

Sums of products of binomial coefficients mod 2 and 2-regular sequences

Wu showed that certain sums of products of binomial coefficients modulo 2 are given by the run length transforms of several famous linear recurrence sequences, such as the positive integers, the Fibonacci numbers, the extended Lucas numbers, and Narayana's cows sequence. In this paper we show that the run length transform of such sequences are 2-regular sequences. This allows us to obtain Wu's results and some new ones using the computer program Walnut, eliminating the need for long technical proofs.

math.NT

A cyclic sieving phenomenon for symplectic tableaux

We give a cyclic sieving phenomenon for symplectic $\lambda$-tableaux $SP(\lambda,2m)$, where $\lambda$ is a partition of an odd integer $n$ and $gcd(m,p)=1$ for any odd prime $p\leq n$. We use the crystal structure on Kashiwara-Nakashima symplectic tableaux to get a cyclic sieving action as the product $\sigma$ of simple reflections in the Weyl group. The cyclic sieving polynomial is the $q$-anologue of the hook-content formula for symplectic tableaux. More generally, we give a CSP for symplectic skew tableaux with analogous conditions on the shape and a cyclic group action that rotates tableaux weights in a way motivated by the $\sigma$-action.

math.CO