Related papers: A solution to the finitizability problem for quant…

In this paper we analyze the structure of some subalgebras of quantized enveloping algebras corresponding to unipotent and solvable subgroups of a simple Lie group G. These algebras have the non--commutative structure of iterated algebras…

We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation.…

We study the completeness problem for propositionally quantified modal logics on quantifiable general frames, where the admissible sets are the propositions the quantifiers can range over and expressible sets of worlds are admissible, and…

We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…

We introduce the notion of a strong equivalence between graded algebras and prove that any partially-strongly-graded algebra by a group $G$ is strongly-graded-equivalent to the skew group algebra by a product partial action of $G$. As to a…

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

We show that C*-algebras generated by irreducible representations of finitely generated nilpotent groups satisfy the universal coefficient theorem of Rosenberg and Schochet. This result combines with previous work to show that these…

In this paper, a semigroup algebra consisting of polynomial expressions with coefficients in a field $F$ and exponents in an additive submonoid $M$ of $\mathbb{Q}_{\ge 0}$ is called a Puiseux algebra and denoted by $F[M]$. Here we study the…

We introduce a rigid analytification of the quantized coordinate algebra of a semisimple algebraic group and a quantized Arens-Michael envelope of the enveloping algebra of the corresponding Lie algebra, working over a non-archimedean field…

We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…

In this paper we are interested in the existence of small and big Ramsey degrees of classes of finite unary algebras in arbitrary (not necessarily finite) algebraic language $\Omega$. We think of unary algebras as $M$-sets where $M =…

An $\alpha$-approximate polynomial Turing kernelization is a polynomial-time algorithm that computes an $(\alpha c)$-approximate solution for a parameterized optimization problem when given access to an oracle that can compute…

We provide polynomial completeness results for finite algebras in congruence permutable varieties. In 2001, Idziak and S{\l}omczy{\'n}ska introduced the completeness concept of being \emph{polynomially rich}: a finite algebra is…

Let $\Gamma$ be a countable group acting on a countable set $X$ by permutations. We give a necessary and sufficient condition for the action to have a quasi-invariant mean with a given cocycle. This can be viewed as a combinatorial analogue…

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…

Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…