相关论文: Algorithms for D-modules --- restriction, tensor p…

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

We consider algorithmic approaches to the D-optimality problem for cases where the input design matrix is large and highly structured, in particular implicitly specified as a full quadratic or linear response-surface model in several levels…

We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…

This is a study of universal problems for semimodules, in particular coequalizers, coproducts, and tensor products. Furthermore the structure theory of semiideals of the semiring of natural numbers is extended.

We present some theorems and algorithms for calculating perpendicular categories and locally semi-simple decompositions. We implemented a computer program {\sc TETIVA} based on these algorithms and we offer this program for everybody's use.

Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology of it. In the literature, there exist various algorithms for computing the homology groups of simplicial complexes…

In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures,…

This work concerns the stable module category of a finite group over a field of characteristic dividing the group order. The minimal localising tensor ideals correspond to the non-maximal homogeneous prime ideals in the cohomology ring of…

We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…

We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable…

This works concerns cohomological support varieties of modules over commutative local rings. The main result is that the support of a derived tensor product of a pair of differential graded modules over a Koszul complex is the join of the…

We compute certain Ext and Tor groups in the category of all functors from an Z/p-linear additive category A to vector spaces in terms of Ext and Tor computed in the full subcategory of additive functors from A to vector spaces. We thus…

In this paper we study modular tensor categories (braided rigid balanced tensor categories with additional finiteness and non-degeneracy conditions), in particular, representations of quantum groups at roots of unity. We show that the…

We consider modal logics of products of neighborhood frames. We define n-product of modal logics as the logic of all products of neighborhood frames of corresponding logics and find n-product of any two pretransitive Horn axiomatizable…

We construct Landau-Ginzburg models for numerically effective complete intersections in toric manifolds as partial compactifications of families of Laurent polynomials. We show a mirror statement saying that the quantum D-module of the…

As a part of our program for Geometric Arithmetic, we develop an arithmetic cohomology theory for number fields using theory of locally compact groups.

This paper is devoted to the factorization of multivariate polynomials into products of linear forms, a problem which has applications to differential algebra, to the resolution of systems of polynomial equations and to Waring decomposition…

Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…

In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…

We study twisted D-modules on the weighted projective stacks. We determine for which values of the twist and the weight the global section functor is an equivalence, thus, proving a version of Beilinson-Bernstein Localisation Theorem.