Related papers: Rosenbrock's Theorem on System Matrices over Eleme…
Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…
The article presents results on the well-known problem concerning the structure of integer polynomials $p_n(z; x, y)$, which define multiplication laws in $n$-valued groups $\mathbb{G}_n$ over the field of complex numbers $\mathbb{C}$. We…
We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…
Initiated by a result of Gorin and Marcus [Int. Math. Res. Not., (3):883--913, 2020] and an observation of Steinerberger [Proc. Amer. Math. Soc., 147(11):4733--4744, 2019], there has been a recent growing body of literature connecting…
Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…
Although a deterministic polytime algorithm for primality testing is now known, the Rabin-Miller randomized test of primality continues being the most efficient and widely used algorithm. We prove the correctness of the Rabin-Miller…
We introduce the class E2 (resp. SE2) of commutative rings R with the property that each unimodular 2 x 2 matrix with entries in R extends to an invertible 3 x 3 matrix (resp. invertible 3 x 3 matrix whose (3, 3) entry is 0). Among…
The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…
The Deligne-Simpson problem in the multiplicative version is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\in SL(n,{\bf C})$ so that there exist irreducible $(p+1)$-tuples…
Polynomial $n\times n$ matrices $A(\lambda)$ and $B(\lambda)$ over a field $\mathbb F $ are called semi-scalar equivalent if there exist a nonsingular $n\times n$ matrix $P$ over the field $\mathbb F $ and an invertible $n\times n$ matrix…
As a homomorphic image of the hyperalgebra $U_{q,R}(m|n)$ associated with the quantum linear supergroup $U_\upsilon(\mathfrak{gl}_{m|n})$, we first give a presentation for the $q$-Schur superalgebra $S_{q,R}(m|n,r)$ over a commutative ring…
Elements of the Riordan group $\cal R$ over a field $\mathbb F$ of characteristic zero are infinite lower triangular matrices which are defined in terms of pairs of formal power series. We wish to bring to the forefront, as a tool in the…
Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
General computational methods based on descriptor state-space realizations are proposed to compute coprime factorizations of rational matrices with minimum degree denominators. The new methods rely on recursive pole dislocation techniques,…
A technique is described in this paper to avoid order reduction when integrating reaction-diffusion initial boundary value problems with explicit exponential Rosenbrock methods. The technique is valid for any Rosenbrock method, without…
The Peterson-Thom conjecture asserts that any diffuse, amenable subalgebra of a free group factor is contained in a unique maximal amenable subalgebra. This conjecture is motivated by related results in Popa's deformation/rigidity theory…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…
In a previous paper, the third author proved that finite-degree polynomial functors over infinite fields are topologically Noetherian. In this paper, we prove that the same holds for polynomial functors from free $R$-modules to finitely…