相关论文: Complexity problems associated with matrix rings, …

We characterize the existence of a polynomial (rational) matrix when its eigenstructure (complete structural data) and some of its rows are prescribed. For polynomial matrices, this problem was solved in a previous work when the polynomial…

We study the complexity of algorithmic problems for matrices that are represented by multi-terminal decision diagrams (MTDD). These are a variant of ordered decision diagrams, where the terminal nodes are labeled with arbitrary elements of…

This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

This Paper defines and explores solution to the problem of \emph{Inversion of a finite Sequence} over the binary field, that of finding a prefix element of the sequence which confirms with a \emph{Recurrence Relation} (RR) rule defined by a…

In this paper two related simplification problems for systems of linear inequalities describing precedence relation systems are considered. Given a precedence relation system, the first problem seeks a minimum subset of the precedence…

In this paper, we study the hardness of solving graph-structured linear systems with coefficients over a finite field $\mathbb{Z}_p$ and over a polynomial ring $\mathbb{F}[x_1,\ldots,x_t]$. We reduce solving general linear systems in…

We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an $\omega$-categorical algebra $\mathfrak{A}$. There are $\omega$-categorical groups where this problem is…

Using modular arithmetic of the ring $\mathbb{Z}_{n+1}$ we obtain a new short solution to the problem of existence of at least one solution to the $N$-Queens problem on an $N \times N$ chessboard. It was proved, that these solutions can be…

We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…

Matrix rank minimization problems are gaining a plenty of recent attention in both mathematical and engineering fields. This class of problems, arising in various and across-discipline applications, is known to be NP-hard in general. In…

This is the first in a series of papers, where we introduce and study topological spaces that realize the algebras of quasi-invariants of finite reflection groups. Our result can be viewed as a generalization of a well-known theorem of A.…

Let $F$ be an affine flat group scheme over a commutative ring $R$, and $S$ an $F$-algebra (an $R$-algebra on which $F$ acts). We define an equivariant analogue $Q_F(S)$ of the total ring of fractions $Q(S)$ of $S$. It is the largest…

We say that two given polynomials $f, g \in R[X]$, over a ring $R$, are equivalent under shifts if there exists a vector $a \in R^n$ such that $f(X+a) = g(X)$. Grigoriev and Karpinski (FOCS 1990), Lakshman and Saunders (SICOMP, 1995), and…

A tropical (or min-plus) semiring is a set $\mathbb{Z}$ (or $\mathbb{Z \cup \{\infty\}}$) endowed with two operations: $\oplus$, which is just usual minimum, and $\odot$, which is usual addition. In tropical algebra the vector $x$ is a…

It is known from work by H. Abels and P. Abramenko that for a classical Fq-group G of rank n the arithemetic lattice G(Fq[t]) of Fq[t]-rational points is of type Fn-1 provided that q is large enough. We show that the statement is true…

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

We obtain a characterization of the binary commutator on completely simple semigroups, using their Rees matrix representation. Consequently, we prove that a regular semigroup is nilpotent (solvable) if and only if it is simple, and all its…

We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times. We show that…

Let $\mathbb{F}$ be an infinite field with characteristic different from two. For a graph $G=(V,E)$ with $V={1,...,n}$, let $S(G;\mathbb{F})$ be the set of all symmetric $n\times n$ matrices $A=[a_{i,j}]$ over $\mathbb{F}$ with…