Related papers: Minimal Canonical Comprehensive Groebner Systems
We describe the foundation of the log minimal model program for log canonical pairs according to Ambro's idea. We generalize Koll\'ar's vanishing and torsion-free theorems for embedded simple normal crossing pairs. Then we prove the cone…
We investigate a hierarchy of arithmetical structures obtained by a transfinite addition of a canonic universal predicate, where the canonic universal predicate for M is defined as a minimum universal predicate for M in terms of…
In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…
Paul Van Dooren [Linear Algebra Appl. 27 (1979) 103-140] constructed an algorithm for the computation of all irregular summands in Kronecker's canonical form of a matrix pencil. The algorithm is numerically stable since it uses only unitary…
This article presents an identification methodology to capture general relationships, with application to piecewise nonlinear approximations of model predictive control for constrained (non)linear systems. The mathematical formulation…
A cofactor representation of an ideal element, that is, a representation in terms of the generators, can be considered as a certificate for ideal membership. Such a representation is typically not unique, and some can be a lot more…
Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…
Matrix completion aims to estimate missing entries in a data matrix, using the assumption of a low-complexity structure (e.g., low rank) so that imputation is possible. While many effective estimation algorithms exist in the literature,…
The Parameter Continuation Theorem is the theoretical foundation for polynomial homotopy continuation, which is one of the main tools in computational algebraic geometry. In this note, we give a short proof using Gr\"obner bases. Our…
We present an exact algorithm for computing all common subgraphs with the maximum number of vertices across multiple graphs. Our approach is further extended to handle the connected Maximum Common Subgraph (MCS), identifying the largest…
Given an NQC log canonical generalized pair $(X,B+M)$ whose underlying variety $X$ is not necessarily $\mathbb{Q}$-factorial, we show that one may run a $(K_X+B+M)$-MMP with scaling of an ample divisor which terminates, provided that…
We describe a method for solving linear systems over the localization of a commutative ring $R$ at a multiplicatively closed subset $S$ that works under the following hypotheses: the ring $R$ is coherent, i.e., we can compute finite…
We discuss a general approach to handling "multiple hypotheses" testing in the case when a particular hypothesis states that the vector of parameters identifying the distribution of observations belongs to a convex compact set associated…
We prove that given any $\alpha$-approximation LOCAL algorithm for Minimum Dominating Set (MDS) on planar graphs, we can construct an $f(g)$-round $(3\alpha+1)$-approximation LOCAL algorithm for MDS on graphs embeddable in a given Euler…
Solving multihomogeneous systems, as a wide range of structured algebraic systems occurring frequently in practical problems, is of first importance. Experimentally, solving these systems with Gr\"obner bases algorithms seems to be easier…
Canonical matrices are given for (a) bilinear forms over an algebraically closed or real closed field; (b) sesquilinear forms over an algebraically closed field and over real quaternions with any nonidentity involution; and (c) sesquilinear…
The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…
A new implementation of the canonical polyadic decomposition (CPD) is presented. It features lower computational complexity and memory usage than the available state of art implementations available. The CPD of tensors is a challenging…
Markov Chain Monte Carlo (MCMC) methods have become a cornerstone of many modern scientific analyses by providing a straightforward approach to numerically estimate uncertainties in the parameters of a model using a sequence of random…
Markov Chain Monte Carlo (MCMC) algorithms are a workhorse of probabilistic modeling and inference, but are difficult to debug, and are prone to silent failure if implemented naively. We outline several strategies for testing the…