Related papers: A presentation of general multipersistence modules…
Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…
An algorithm and its first implementation in C# are presented for assembling arbitrary quantum circuits on the base of Hadamard and Toffoli gates and for constructing multivariate polynomial systems over the finite field Z_2 arising when…
This paper is the first one of two papers whose goal is to give a converse to the main result of my previous paper [6], so to prove the existence of multiple poles for the distribution |f|2$\lambda$ with an hypothesis on a Higher Bernstein…
In his famous paper [2], Demazure introduced certain indecomposable modules and used them to give a short proof of Bott's theorem. In this paper we consider a generalization of these modules and give their cohomology.
Over the past decade, the Gr\"obner basis theory and automatic solver generation have lead to a large number of solutions to geometric vision problems. In practically all cases, the derived solvers apply a fixed elimination template to…
Mahler equations arise in a wide range of contexts including the study of finite automata, regular sequences, algebraic series over Fp(z), and periods of Drinfeld modules. Introduced a century ago by K. Mahler to study the transcendence of…
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…
We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…
Let $M$ be a compact torsion-free $G_2$ 7-manifold or Calabi-Yau 6-manifold. We prove Hodge decomposition theorems for the $dd^\phi$ operators, introduced by Harvey and Lawson, which generalize the $i\partial\bar\partial$ operator used in…
In the theory of persistent homology, a well known duality relates the barcodes of the absolute homology and relative cohomology of a one-parameter simplicial filtration. Motivated by the problem of computing free presentations of the…
Lyubeznik conjectured that local cohomology modules of regular rings have finitely many associated primes. We examine this conjecture for polynomial rings over the integers, and record some equational identities that arise from studying…
We consider kernels of discrete convolution operators or, equivalently, homogeneous solutions of partial difference operators and show that these solutions always have to be exponential polynomials. The respective polynomial space in…
A multiplication on persistence diagrams is introduced by means of Schubert calculus. The key observation behind this multiplication comes from the fact that the representation space of persistence modules has the structure of the Schubert…
The interpolation step of Guruswami and Sudan's list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is…
Computation of parallel lines (envelopes) to parabolas, ellipses, and hyperbolas is of importance in structure engineering and theory of mechanisms. Homogeneous polynomials that implicitly define parallel lines for the given offset to a…
Systems of polynomial equations arise frequently in computer vision, especially in multiview geometry problems. Traditional methods for solving these systems typically aim to eliminate variables to reach a univariate polynomial, e.g., a…
A motivation to study Gr\"{o}bner theory for fields with valuations comes from tropical geometry, for example, they can be used to compute tropicalization of varieties \citep{maclagan2009introduction}. The computational aspect of this…
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…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…
Let $H$ be a Hopf algebra. We consider $H$-equivariant modules over a Hopf module category $\mathcal C$ as modules over the smash extension $\mathcal C\# H$. We construct Grothendieck spectral sequences for the cohomologies as well as the…