Related papers: Computing a holonomic submodule of the partial Wey…

In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…

The concept of open weak CAD is introduced. Every open CAD is an open weak CAD. On the contrary, an open weak CAD is not necessarily an open CAD. An algorithm for computing projection polynomials of open weak CADs is proposed. The key idea…

Let A \subseteq B be cancellative abelian semigroups, and let R be an integral domain. We show that the semigroup ring R[B] can be decomposed, as an R[A]-module, into a direct sum of R[A]-submodules of the quotient ring of R[A]. In the case…

Ritt-Wu's algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for…

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…

In this article the simple modules over the rank-two quantized Weyl algebras at roots of unity over an algebraically closed field are classified.

We aim at constructing an analog of the Weyl calculus in an infinite dimensional setting, in which the usual configuration and phase spaces are ultimately replaced by infinite dimensional measure spaces, the so-called abstract Wiener…

Given a foliation, there is a well-known notion of holonomy, which can be understood as an action that differentiates to the Bott connection on the normal bundle. We present an analogous notion for Lie subalgebroids, consisting of an…

We classify up to isomorphism all finite-dimensional Lie algebras that can be realised as Lie subalgebras of the complex Weyl algebra $A_1$. The list we obtain turns out to be discrete and for example, the only non-solvable Lie algebras…

In this paper we establish explicit lower bounds for pseudodifferential operators with a radial symbol. The proofs use classical Weyl calculus techniques and some useful, if not celebrated, properties of the Laguerre polynomials.

We consider a global semianalytic set defined by real analytic functions definable in an o-minimal structure. When the o-minimal structure is polynomially bounded, we show that the closure of this set is a global semianalytic set defined by…

Using the \texttt{WeylModules} \textsf{GAP} Package, we compute structural information about certain Weyl modules for type $G_2$ in characteristic $2$. This gives counterexamples to two conjectures stated by S.~Donkin in 1990. It also…

We propose a very simple preprocessing algorithm for semidefinite programming. Our algorithm inspects the constraints of the problem, deletes redundant rows and columns in the constraints, and reduces the size of the variable matrix. It…

We relate the analytic spread of a module expressed as the direct sum of two submodules with the analytic spread of its components. We also study a class of submodules whose integral closure can be obtained by means of a simple computer…

Let $G$ be a simple algebraic group of type $E_6$ over an algebraically closed field of characteristic $p>0$. We determine the submodule structure of the Weyl modul es with highest weight $r\omega_1$ for $0\leq r\leq p-1$, where $\omega_1$…

Weighted First-Order Model Counting (WFOMC) computes the weighted sum of the models of a first-order theory on a given finite domain. WFOMC has emerged as a fundamental tool for probabilistic inference. Algorithms for WFOMC that run in…

In this paper, we focus on computing the kernel of a map of polynomial rings $\varphi$. This core problem in symbolic computation is known as implicitization. While there are extremely effective Gr\"obner basis methods used to solve this…

Motivated by work of Kac and Lusztig, we define a root system and a Weyl groupoid for a large class of semisimple Yetter-Drinfeld modules over an arbitrary Hopf algebra. The obtained combinatorial structure fits perfectly into an existing…

In this work we find Hochschild cohomology groups of the Weyl associative conformal algebra with coefficients in all finite modules. The Weyl conformal algebra is the universal associative conformal envelope of the Virasoro Lie conformal…