Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · cs/0604084

A Recursive Method for Determining the One-Dimensional Submodules of Laurent-Ore Modules

Ziming Li·Michael F. Singer·Min Wu·Dabin Zheng
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a method for determining the one-dimensional submodules of a Laurent-Ore module. The method is based on a correspondence between hyperexponential solutions of associated systems and one-dimensional submodules. The hyperexponential solutions are computed recursively by solving a sequence of first-order ordinary matrix equations. As the recursion proceeds, the matrix equations will have constant coefficients with respect to the operators that have been considered.

Explore related subjects

cs.SCmath.CA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ziming Li, Michael F. Singer, Min Wu, Dabin Zheng. 2006-04-21. A Recursive Method for Determining the One-Dimensional Submodules of Laurent-Ore Modules. https://arxiv.org/abs/cs/0604084

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Where models of minimal height are hard to find: cubic rational maps with a multiple fixed point

Given a rational point of the moduli space of cubic rational maps, we seek a map in its class with the smallest integer coefficients. A recent algorithm (Shaska, arXiv:2610.33990) combines an exact descent and minimisation of the resultant with a reduction and a local search; it is nearly exact where the minimal height is known. Beyond that range, a certified deeper search shows that the instances in which a smaller model lies beyond its reach are not random: a classifier predicts them from the six invariants of the point, and asking what it relies on leads to an exact algebraic surface, the maps with a triple fixed point. Invariant theory and the stability hypothesis of reduction theory (Hutz and Stoll, 2019) then identify the larger locus that contains it: the hypersurface $ξ_1^3=6ξ_2^2$ of maps with a multiple fixed point, on which the fixed-point quartic is not stable. It holds most of the hard instances. On it the two invariants of the fixed-point quartic are $(ξ_1,ξ_2)=(6m^2,6m^3)$ for an integer $m\ge0$; we parametrise the integer points of the surface, and show that on its generic part the sign of $ξ_5$ is the sign of the cubic coefficient at the parabolic fixed point. A covariant defined on the locus, added to the reduction, resolves only a minority of the hard instances: they appear to be mainly a matter of the search's reach. These findings lead to a certified structured search that never returns a larger model than the original algorithm and finds most of the smaller models within reach, also at heights not used to design it, at a small multiple of its running time.

cs.SC↗
arXiv2026

Matrices with displacement structure: a deterministic approach for linear systems and nullspace bases

For matrices with a displacement structure, the fastest known algorithms for solving linear systems and computing nullspace bases are randomized, with respective costs of $\tilde{O}(α^{ω-1} n)$ and $\tilde{O}(α^2 n)$ operations in the base field. Here $n \times n$ is the matrix size, $α$ is its displacement rank, $ω> 2$ is a feasible exponent for matrix multiplication, and $\tilde{O}(\cdot)$ hides logarithmic factors. For a long time, such structured solvers were also the fastest known method to perform Hermite-Padé or simultaneous Padé approximations, and their interpolation variants, until recently when these problems received efficient and deterministic solutions via polynomial matrix algorithms. This work proposes to take the converse direction, by showing that these recent polynomial matrix tools can be used to improve structured matrix computations. We present a new approach which, for the Toeplitz-like, Vandermonde-like, and Cauchy-like structures, solves linear systems and computes nullspace bases in $\tilde{O}(α^{ω-1}(m+n))$ operations for an arbitrary $m \times n$ matrix, deterministically and with no assumption on the base field. This bound matches the best known randomized one for linear systems and improves upon it for nullspaces. The approach reformulates the problem as a modular equation on univariate polynomials, and describes all its solutions in three steps: computing a basis of solutions to a vector M-Padé approximation problem, solving a polynomial matrix equation to get rid of unwanted unknowns, and finding the sought unknowns via simultaneous M-Padé approximation.

cs.SC↗
arXiv2026

Construction and formal verification of a special topology on {\mathbb{Z}}^{n}: characterization of connected subsets

We examine whether the integers admit a topology whose connected subsets are precisely the sets of consecutive integers. The main result gives a construction for every integer lattice {\mathbb{Z}}^{n}, n>0; the answer for Z is then obtained as a corollary. We prove that the neighborhoods determined by the parity of the sum of the coordinates form a basis and that topological connectedness agrees exactly with accessibility by finite paths of unit lattice steps. We also present a deductive audit and the correspondence between this argument and a verification in Lean 4 and Mathlib, including the empty set and the independent formal characterization of integer intervals. The construction and mathematical result originate in Problem 5712, proposed by Dan Marcus and solved in 1970 by the Cleveland State University group; the present article contributes a detailed exposition and a report on formal verification.

cs.SC↗