Related papers: Complexity problems associated with matrix rings, …
As is well known, any complex cyclic matrix $A$ is similar to the unique companion matrix associated with the minimal polynomial of $A$. On the other hand, a cyclic matrix over a division ring $\mathbb F$ is similar to a companion matrix of…
In this paper we study the complexity of the problems: given a loop, described by linear constraints over a finite set of variables, is there a linear or lexicographical-linear ranking function for this loop? While existence of such…
This paper is devoted to the theory of $GL_n({\mathbb Z})$-conjugacy classes of regular integer $n\times n$ matrices. Such a matrix is $GL_n({\mathbb Q})$-conjugate to the companion matrix of its characteristic polynomial. But the set of…
We systematically study the computational complexity of a broad class of computational problems in phylogenetic reconstruction. The class contains for example the rooted triple consistency problem, forbidden subtree problems, the quartet…
We study some sum-product problems over matrix rings. Firstly, for $A, B, C\subseteq M_n(\mathbb{F}_q)$, we have $$ |A+BC|\gtrsim q^{n^2}, $$ whenever $|A||B||C|\gtrsim q^{3n^2-\frac{n+1}{2}}$. Secondly, if a set $A$ in $M_n(\mathbb{F}_q)$…
Let G < SL(V) be a finite group, V is finite dimensional over a field F, p=char F and S(V) is the symmetric algebra of V. We determine when the subring of G-invariants S(V)^G is a polynomial ring. As a consequence, we classify, if F is…
In this paper we study the ring $\mathcal{P}$ of combinatorial convex polytopes. We introduce the algebra of operators $\mathcal{D}$ generated by the operators $d_k$ that send an $n$-dimensional polytope $P^n$ to the sum of all its…
In this paper, we examine the computational complexity of enumeration in certain genome rearrangement models. We first show that the Pairwise Rearrangement problem in the Single Cut-and-Join model (Bergeron, Medvedev, & Stoye, J. Comput.…
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…
Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|) time. This generalizes a quantum algorithm of Arvind et al.…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the…
Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…
In this paper we illustrate by some examples the connection between the number of solutions of polynomial equations satisfying degree conditions and the number of rank I matrices related to persymmetric matrices.
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…
This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…
Connection matrices for graph parameters with values in a field have been introduced by M. Freedman, L. Lov{\'a}sz and A. Schrijver (2007). Graph parameters with connection matrices of finite rank can be computed in polynomial time on graph…
We investigate the notion of \textit{semi-nil clean} rings, defined as those rings in which each element can be expressed as a sum of a periodic and a nilpotent element. Among our results, we show that if $R$ is a semi-nil clean NI ring,…
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…