Related papers: Grobner Basis Techniques for Computing Actions of …
We compute Ext-groups between classical exponential functors (i.e. symmetric, exterior or divided powers) and their Frobenius twists. Our method relies on bar constructions, and bridges these Ext-groups with the homology of Eilenberg-Mac…
Many rings and algebras arising in quantum mechanics, algebraic analysis, and non-commutative algebraic geometry can be interpreted as skew PBW (Poincar\'e-Birkhoff-Witt) extensions. In the present paper we study two aspects of these…
Grayson, developing ideas of Quillen, has made computations of the K-theory of "semi-linear endomorphisms". In the present text we develop a technique to compute these groups in the case of Frobenius semi-linear actions. The main idea is to…
With view to applications, we establish a correspondence between two problems: (i) the problem of finding continuous positive definite extensions of functions $F$ which are defined on open bounded domains $\Omega$ in $\mathbb{R}$, on the…
Keyphrase boundary classification (KBC) is the task of detecting keyphrases in scientific articles and labelling them with respect to predefined types. Although important in practice, this task is so far underexplored, partly due to the…
Problems of dense and closed extension of actions of compact transformation groups are solved. The method developed in the paper is applied to problems of extension of equivariant maps and of construction of equivariant compactifications.
While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…
We study degree bounds on rational but not necessarily polynomial generators for the field $\mathbf{k}(V)^G$ of rational invariants of a linear action of a finite abelian group. We show that lattice-theoretic methods used recently by the…
Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…
In this article we show the rough outline of a computer algorithm to generate lower bounds on the exponential function of (in principle) arbitrary precision. We implemented this to generate all necessary analytic terms for the Boltzmann…
The Groebner walk is an algorithm for conversion between Groebner bases for different term orders. It is based on the polyhedral geometry of the Groebner fan and involves tracking a line between cones representing the initial and target…
Fix a non-negative integer g and a positive integer I dividing 2g-2. For any Henselian, discretely valued field K whose residue field is perfect and admits a degree I cyclic extension, we construct a curve C over K of genus g and index I.…
This note computes a Gr\"obner basis for the ideal defining a union of Schubert varieties. More precisely, it computes a Gr\"obner basis for unions of schemes given by northwest rank conditions on the space of all matrices of a fixed size.…
In this work, we investigate an effective method for showing that functors between categories are left adjoints. The method applies to a large class of categories, namely locally finitely presentable categories, which are ubiquitous in…
Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute multiplicities of K-types in the discrete series using a rational expression for a generating function…
Computation of the K- and KO-theory for the classifying G-spaces for proper actions of certain infinite discrete groups G via a special version of the equivariant Atiyah- Hirzebruch spectral sequence.
In this article, we develop tools for computing $G$-crossed extensions of braided tensor categories. Their equivariantisations appear as categories of modules of fixed-point subalgebras (or orbifolds) of vertex operator algebras and are…
The most important families of non-linear codes are systematic. A brute-force check is the only known method to compute their weight distribution and distance distribution. On the other hand, it outputs also all closest word pairs in the…
Gr\"{o}bner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gr\"{o}bner bases is the multivariate polynomial system solving, which enables us to construct…
Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis…