Related papers: Noncommutative Valiant's Classes: Structure and Co…
Using the theory of resolving classes, we show that if $X$ is a CW complex of finite type such that $\map_*(X, S^{2n+1})\sim *$ for all sufficiently large $n$, then $\map_*(X, K) \sim *$ for every simply-connected finite-dimensional CW…
We establish a connection between continuous-variable quantum computing and high-dimensional integration by showing that the outcome probabilities of continuous-variable instantaneous quantum polynomial (CV-IQP) circuits are given by…
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…
Some 25 years ago Valiant introduced an algebraic model of computation in order to study the complexity of evaluating families of polynomials. The theory was introduced along with the complexity classes VP and VNP which are analogues of the…
For Dynkin quivers, we find the Laurent polynomials $\widetilde{X}_{a, c}^{b}(v)$ and use $\widetilde{X}_{a, c}^{b}(v)$ to construct the Hall algebra $\hc_v(\cc(\cp))$ over $\mz[v, v^{-1}]$, where $\widetilde{X}_{a, c}^{b}(|\mf_q|)$'s are…
Let $p>0$ be a prime, $G$ be a finite $p$-group and $\Bbbk$ be an algebraically closed field of characteristic $p$. Dave Benson has conjectured that if $p=2$ and $V$ is an odd-dimensional indecomposable representation of $G$ then all…
We study functions satisfying the composition law $F(xy)+F(x/y)=P(F(x),F(y))$ with a symmetric polynomial combiner $P$. We prove that symmetry together with a quadratic degree bound on $P$ forces a composition law of d'Alembert type. We…
This paper introduces and systematically studies Weyl-type, Witt-type, and non-associative algebras defined over expolynomial rings -- commutative rings generated by exponential functions $e^{\alpha x}$, exponentials of exponentials $e^{\pm…
A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective…
Consider $(G, V)$ a finite-dimensional representation of a connected reductive complex Lie group $G$ and $\mathbb{P}\left( V\right) $ the projective space of $V$. Denote by $G'$ the derived subgroup of $G$ and assume that the categorical…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…
In this paper, we apply the power-partible reduction to study arithmetic properties of sums involving Delannoy numbers $D_k$ and polynomials $D_k(z)$. Let $v\in\bN$ and $p$ be an odd prime. It is proved that, for any…
A central task in knowledge compilation is to compile a CNF-SAT instance into a succinct representation format that allows efficient operations such as testing satisfiability, counting, or enumerating all solutions. Useful representation…
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The…
The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…
We analyze the complexity of decision problems for Boolean Nonassociative Lambek Calculus admitting empty antecedent of sequents ($\mathsf{BFNL^*}$), and the consequence relation of Distributive Full Nonassociative Lambek Calculus…
Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on monochromatic subgraphs and the Erd\H{o}s-Rado sunflower lemma.…
Valued constraint satisfaction problems (VCSPs) constitute a large class of computational optimization problems. It was shown recently that, over finite domains, every VCSP is in P or NP-complete, depending on the admitted cost functions.…
This work settles the Eichler-Shimura congruence relation of Blasius and Rogawski for certain 5-dimensional Hodge-type Shimura varieties, that were not tractable by previously known methods. In a more general context we introduce a…
In this paper we develop a novel approach to Witt vector rings and to the (relative) de Rham Witt complex. We do this in the generality of arbitrary commutative algebras and arbitrary truncation sets. In our construction of Witt vector…