Related papers: Noncommutative Valiant's Classes: Structure and Co…
We construct a polynomial family of semisimple left module categories over the representation category of the Drinfeld-Jimbo deformation, with the fusion rule of the representation category of each Levi subalgebra. In this construction we…
For each partition $\tau$ of $N$ there are irreducible modules of the symmetric groups $\mathcal{S}_{N}$ or the corresponding Hecke algebra $\mathcal{H}_{N}\left( t\right) $ whose bases consist of reverse standard Young tableaux of shape…
We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…
In (Kabanets, Impagliazzo, 2004) it is shown how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial family for arithmetical…
The authors give a detailed information about symmetry (Lie, non-Lie, conditional) of nonlinear PDEs for spinor, vector and scalar fields; using advanced methods of group-theoretical, symmetry analysis construct wide families of classical…
In this companion article to [HKK24], we apply the theory of equivariant Poincar\'e duality developed there in the special case of cyclic groups $C_p$ of prime order to remove, in a special case, a technical condition given by Davis--L\"uck…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \emph{constraint language}, a fixed set of cost functions over a finite domain. An instance of the problem is specified by…
We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages. By using linear algebra and a branching analog of the classic Euler theorem, we show that, under an…
For an irreducible complex reflection group $W$ of rank $n$ containing $N$ reflections, we put $g=2N/n$ and construct a $(g+1)^n$-dimensional irreducible representation of the Cherednik algebra which is (as a vector space) a quotient of the…
The paper presents an algebraic framework for optimization problems expressible as Valued Constraint Satisfaction Problems. Our results generalize the algebraic framework for the decision version (CSPs) provided by Bulatov et al. [SICOMP…
Nisan showed in 1991 that the width of a smallest noncommutative single-(source,sink) algebraic branching program (ABP) to compute a noncommutative polynomial is given by the ranks of specific matrices. This means that the set of…
The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…
We present a definition of the class NP in combinatorial context as the set of languages of structures defined by finitely many forbidden lifted substructures. We apply this to special syntactically defined subclasses and show how they…
A $r$-parameter ${u}_{\{\kappa_1, \kappa_2, \cdots, \kappa_r\}}(2)$ algebra is introduced. Finite unitary representations are investigated. This polynomial algebra reduces via a contraction procedure to the generalized Weyl-Heisenberg…
Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…
Let $V$ be a complete discrete valuation ring with residue field $k$ and with fraction field $K$ of characteristic 0. We clarify the analysis behind the Monsky--Washnitzer completion of a commutative $V$-algebra using spectral radius…
We construct Kn\"orrer type equivalences outside of the hypersurface case, namely, between singularity categories of cyclic quotient surface singularities and certain finite dimensional local algebras. This generalises Kn\"orrer's…
Previously, all known variants of the Quantum Satisfiability (QSAT) problem, i.e. deciding whether a $k$-local ($k$-body) Hamiltonian is frustration-free, could be classified as being either in $\mathsf{P}$; or complete for $\mathsf{NP}$,…
The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…