Related papers: On the Factorization of Nonlinear Recurrences in M…

We set up some basic module theory over semirings, with particular attention to what is needed in scheme theory over semirings. We show that while not all the usual definitions of vector bundle agree over semirings, all the usual…

In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…

We compute the divisor of the modular equation on the modular curve $\Gamma_0(N) \backslash \mathbb H^*$ and then find recurrence relations satisfied by the modular traces of the Hauptmodul for any congruence subgroup $\Gamma_0(N)$ of genus…

An associative ring with 1 is said to be semilocal provided it is semisimple artinian modulo its Jacobson radical, that is, modulo its Jacobson radical it is isomorphic to a finite product of matrices over division rings. Modules with a…

Let $A$ be an integer matrix, and let $f_A$ be the associated monomial map. We give a connection between the eigenvalues of $A$ and existence of a linear recurrence relation in the sequence of degrees.

LU-factorization of matrices is one of the fundamental algorithms of linear algebra. The widespread use of supercomputers with distributed memory requires a review of traditional algorithms, which were based on the common memory of a…

In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence.…

Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

A quasi-ordinary polynomial is a monic polynomial with coefficients in the power series ring such that its discriminant equals a monomial up to unit. In this paper we study higher derivatives of quasi-ordinary polynomials, also called…

We show that the category of corings over a fixed base ring with local units is equivalent to the category of comonads in (right) unital modules whose underlying functors preserve inductive limits. Changing base rings, we prove a…

This paper addresses an investigation on a factorization method for difference equations. It is proved that some classes of second order linear difference operators, acting in Hilbert spaces, can be factorized using a pair of mutually…

We study the problem of decomposition (non-commutative factorization) of linear ordinary differential operators near an irregular singular point. The solution (given in terms of the Newton diagram and the respective characteristic numbers)…

For a proper submodule $N$ of a finitely generated module $M$ over a Noetherian ring, the product of prime ideals which occur in a regular prime extension filtration of $M$ over $N$ is defined as its generalized prime ideal factorization in…

Consider the symmetric group $S_n$ acting as a reflection group on the polynomial ring $k[x_1, \ldots, x_n]$, where $k$ is a field such that Char$(k)$ does not divide $n!$. We use Higher Specht polynomials to construct matrix factorizations…

We define an equivalence relation on periodic continued fractions with partial quotients in a ring $\mathcal{O} \subseteq \mathbf{C}$, a group law on these equivalence classes, and a map from these equivalence classes to matrices in…

Matrix factorization is a well-studied task in machine learning for compactly representing large, noisy data. In our approach, instead of using the traditional concept of matrix rank, we define a new notion of link-rank based on a…

We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…

It has been recently observed that fundamental aspects of the classical theory of factorization can be greatly generalized by combining the languages of monoids and preorders. This has led to various theorems on the existence of certain…

Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…