Related papers: The conjugacy problem for two by two matrices over…
In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the…
Many results have been established that show how the number of conjugacy classes appearing in the product of classes affect the structure of a finite group. The aim of this paper is to show several results about solvability concerning the…
We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.
We study the conjugacy problem in cyclic extensions of free groups. It is shown that the conjugacy problem is solvable in split extensions of finitely generated free groups by virtually inner automorphisms. An algorithm for construction of…
We use ideas from our previous work to obtain some theorems that will allow us to obtain the integer solution of a quadratic polynomial in two variables that represents a natural number
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.
The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…
We study the conjugate gradient method for solving s system of linear equations with coefficients which are measurable functions and establish the rate of convergence of this method.
Let F be a perfect field. Then the diagonal quadratic form $a_iX_i^2$ over $F$ is universal over $M_2(F)$ if and only if atleast two of the $a_i$ are non-zero.
We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.
We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…
We will describe a combinatorial game that models the problem of resolution of singularities of algebraic varieties over a field of characteristic zero. By giving a winning strategy for this game, we give another proof of the existence of…
Effective matrix methods for solving standard linear algebra problems in a commutative domains are discussed. Two of them are new. There are a methods for computing adjoined matrices and solving system of linear equations in a commutative…
The row (column) completion problem of polynomial matrices of given degree with prescribed eigenstructure has been studied in \cite{AmBaMaRo23}, where several results of prescription of some of the four types of invariants that form the…
Let $M$ be a positive homogeneously presented monoid ${\langle L \mid R\,\rangle}_{mo}$. If $M$ satisfies the cancellation condition and carries certain particular elements similar to the \emph{fundamental elements} in Artin monoids, then…
An algorithm is proposed that solves two decision problems for pseudo-Anosov elements in the mapping class group of a surface with at least one marked fixed point. The first problem is the root problem: decide if the element is a power and…
In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…
We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…
We give a necessary and sufficient condition on a matrix for its centralizer in $\sf{GL}(n,\mathbb{Z})$ to be polycyclic, or equivalently in this case, not to contain a non-abelian free subgroup. We give a simple condition on the matrix…