Related papers: Noncommutative Valiant's Classes: Structure and Co…
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 study the complexity of the parameterised counting constraint satisfaction problem: given a set of constraints over a set of variables and a positive integer $k$, how many ways are there to assign $k$ variables to 1 (and the others to 0)…
Lie algebra $\mathfrak{sl}(2)$ can be realised by vector fields on $\mathbb{R}^1\ni x$ with polynomial coefficients $1$, $-2x$, $-x^2$; their Wronskian determinants yield the Lie bracket. Likewise, the monomials $1$, $\ldots$, $x^k/k!$,…
The Weil restriction functor, introduced in the late fifties, was recently extended by Karpenko to the category of Chow motives with integral coefficients. In this article we introduce the noncommutative (=NC) analogue of the Weil…
We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…
We study isometric representations of product systems of correspondences over the semigroup $\mathbb{N}^k$ which are minimal dilations of finite dimensional, fully coisometric representations. We show the existence of a unique minimal…
Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…
We compare two classes of polynomial automorphisms, strongly nilpotent and Pascal finite. We conclude that every strongly nilpotent automorphism is a Pascal finite one, but not vice versa. We observe that Nagata's automorphism is Pascal…
The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements. We introduce two auxiliary sets that characterize the…
Let $V$ be an $r$-dimensional vector space over an infinite field $F$ of prime characteristic $p$, and let $L_n(V)$ denote the $n$-th homogeneous component of the free Lie algebra on $V$. We study the structure of $L_n(V)$ as a module for…
Motivated by a recent conjecture of Zabrocki, Wallach described the alternants in the super-coinvariant algebra of the symmetric group in one set of commuting and one set of anti-commuting variables under the diagonal action. We give a…
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…
We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on an iterated application of the Pigeonhole Principle. This…
Let $\mathbb{k}$ be a field, and let $\Lambda$ be a (not necessarily finite dimensional) $\mathbb{k}$-algebra. Let $V$ be a left $\Lambda$-module such that is finite dimensional over $\mathbb{k}$. Assume further that $V$ has a weak…
We apply Painlev\'e test to the most general variable coefficient nonlinear Schrodinger (VCNLS) equations as an attempt to identify integrable classes and compare our results versus those obtained by the use of other tools like…
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden…
We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…
We study the computational complexity of planar valued constraint satisfaction problems (VCSPs), which require the incidence graph of the instance be planar. First, we show that intractable Boolean VCSPs have to be self-complementary to be…
The commutative ambiguity of a context-free grammar G assigns to each Parikh vector v the number of distinct leftmost derivations yielding a word with Parikh vector v. Based on the results on the generalization of Newton's method to…
We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…