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

Let $K$ be a field and let $\mathbb N = \{1,2, \dots \}$. Let $R_n=K[x_{ij} \mid 1\le i\le n, j\in \mathbb N]$ be the ring of polynomials in $x_{ij}$ $(1 \le i \le n, j \in \mathbb N)$ over $K$. Let $S_n = Sym (\{1,2, \ldots, n \})$ and…

Permutation Pattern Matching (or PPM) is a decision problem whose input is a pair of permutations $\pi$ and $\tau$, represented as sequences of integers, and the task is to determine whether $\tau$ contains a subsequence order-isomorphic to…

We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…

The structure of Poisson polynomial algebras of the type obtained as semiclassical limits of quantized coordinate rings is investigated. Sufficient conditions for a rational Poisson action of a torus on such an algebra to leave only…

We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in the complex projective plane. Such pair of arrangements has an additional property: they admit conjugated equations on the ring…

Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work,…

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…

We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…

The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…

The Realization Problem for (von Neumann) regular rings asks what are the conical refinement monoids which can be obtained as the monoids of isomorphism classes of finitely generated projective modules over a regular ring. The analogous…

Optimizing and certifying the positivity of polynomials are fundamental primitives across mathematics and engineering applications, from dynamical systems to operations research. However, solving these problems in practice requires large…

Let $\mathbb{F}_q$ denote the finite field of characteristic $p$ and order $q$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic rational integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. Given two positive…

Let $M_n(\mathbb{Z})$ the ring of $n$-by-$n$ matrices with integral entries, and $n \geq 2$. This paper studies the set $G_n(\mathbb{Z})$ of pairs $(A,B) \in M_n(\mathbb{Z})^2$ generating $M_n(\mathbb{Z})$ as a ring. We use several…

We consider the MIN-r-LIN(R) problem: given a system S of length-r linear equations over a ring R, find a subset of equations Z of minimum cardinality such that S-Z is satisfiable. The problem is NP-hard and UGC-hard to approximate within…

We interpret a counterexample to Hilbert's 14th problem by S. Kuroda geometrically in two ways: As ring of regular functions on a smooth rational quasiprojective variety over any field K of characteristic 0, and, in the special case where K…

We study skew polycyclic codes over a finite field $\mathbb{F}_q$, associated with a skew polynomial $f(x) \in \mathbb{F}_q[x;\sigma]$, where $\sigma$ is an automorphism of $\mathbb{F}_q$. We start by proving the Roos-like bound for both…

We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair of rows in the resulting matrix has a Hamming distance within a specified range.…

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…

We consider realization and isomorphism problems for formal matrix rings over a given ring. Principal multiplier matrices of such rings play an important role in this case.\\ The work of A.A.Tuganbaev is supported by Russian Scientific…

We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…