SearcharxivSearch

arXiv subjects

Ruiwen Dong

Publications and source records attributed to Ruiwen Dong.

2 recordsLinked to original sources

Skolem-Mahler-Lech in rings of positive characteristic: a shorter proof and a multi-dimensional generalization

Let $R$ be a commutative ring and $f(a_1, \ldots, a_n) = \sum_{i=1}^k r_{i1}^{a_1} \cdots r_{in}^{a_n} m_i$ be a linear-exponential map over an $R$-module $M$. Dong and Shafrir (2026) showed that, when $\ell M = 0$ for some $\ell \in \mathbb{N}_{>0}$, the zero set of $f$ is the intersection of effectively computable $p$-normal sets, where $p$ ranges over the prime divisors of $\ell$. This generalizes an earlier theorem of Derksen and Masser (2012) on the solution set of $S$-unit equations over fields of positive characteristic. The purpose of this paper is twofold. First, we give a shorter proof of Dong and Shafrir's result, using the theorem of Derksen-Masser as a blackbox. Our proof also yields a decomposition of the zero set as a positive Boolean combination of affine transformations of zero sets of linear-exponential equations over fields. Second, we prove a multi-dimensional generalization of the Skolem-Mahler-Lech theorem over rings of finite characteristic. Specifically, we show that the zero set of every $n$-dimensional linear recurrence sequence over an $R$-module $M$ satisfying $\ell M = 0$ is the intersection of effectively computable $p$-normal sets (in $\mathbb{N}^n$), where $p$ ranges over the prime divisors of $\ell$. For example, this gives a decision procedure for whether two classical linear recurrence sequences have a common value over a ring of characteristic $p^a$ or $p^a q^b$, where $p$ and $q$ are primes.

math.NT

Standard bases for shift-stable groups and Subgroup Membership in wreath products

We develop a notion of standard bases for subgroups of the restricted direct product $G^{(\mathbb{N}^n)}$ that are stable under translation by $\mathbb{N}^n$, where $G$ is an arbitrary finite group. We construct an algorithm that computes standard bases for such subgroups and use them to solve several algorithmic problems, including membership, saturation, and variable elimination. Our approach is inspired by Buchberger's algorithm and the theory of Gröbner bases for ideals in polynomial rings. Building on the standard bases and our solutions to the algorithmic problems above, we prove that Subgroup Membership is decidable in wreath products $G \wr \mathbb{Z}^n$ for finite $G$ and $n \in \mathbb{N}$.

math.GR