相关论文: Gr\"obner geometry of vertex decompositions and of…

Polynomial system solving arises in many application areas to model non-linear geometric properties. In such settings, polynomial systems may come with degeneration which the end-user wants to exclude from the solution set. The…

The main idea in this paper is merging two techniques that have been recently developed. On the one hand, we consider MCCGS, standing for Minimal Canonical Comprehensive Groebner Systems, a recently introduced computational tool yielding…

We study the algebraic combinatorics of monomial degenerations of Pl\"ucker forms which is governed by matching fields in the sense of Sturmfels and Zelevinsky. We provide a necessary condition for a matching field to yield a Khovanskii…

Our first result realizes the toric variety of every marked chain-order polytope (MCOP) of the Gelfand--Tsetlin poset as an explicit Gr\"obner (sagbi) degeneration of the flag variety. This generalizes the…

We introduce vector space norms associated to the Mahler measure by using the L^p norm versions of the Weil height recently introduced by Allcock and Vaaler. In order to do this, we determine orthogonal decompositions of the space of…

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…

Border complexity captures functions that can be approximated by low-complexity ones. Debordering is the task of proving an upper bound on some non-border complexity measure in terms of a border complexity measure, thus getting rid of…

This is the fifth in a series of papers where we prove a conjecture of Deser and Schwimmer regarding the algebraic structure of ``global conformal invariants''; these are defined to be conformally invariant integrals of geometric scalars.…

We study three aspects of commutation classes of reduced decompositions: the number of commutation classes, the structures of their corresponding graphs, and the enumeration of subnetworks, a concept recently introduced by Warrington [21].…

In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…

Tensor decompositions, which represent an $N$-order tensor using approximately $N$ factors of much smaller dimensions, can significantly reduce the number of parameters. This is particularly beneficial for high-order tensors, as the number…

The configuration space of $n$ marked points on the complex plane is considered. We investigate a decomposition of this space by so-called Gauss-skizze i.e. a class of graphs being forests, introduced by Gauss. It is proved that this…

We provide a general method to prove the existence and compute efficiently elimination orderings in graphs. Our method relies on several tools that were known before, but that were not put together so far: the algorithm LexBFS due to Rose,…

We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…

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…

Decomposing an algebraic variety into irreducible or equidimensional components is a fundamental task in classical algebraic geometry and has various applications in modern geometry engineering. Several researchers studied the problem and…

We develop a method for optimization in shape spaces, i.e., sets of surfaces modulo re-parametrization. Unlike previously proposed gradient flows, we achieve superlinear convergence rates through a subtle approximation of the shape Hessian,…

Any finite-dimensional commutative (associative) graded algebra with all nonzero homogeneous subspaces one-dimensional is defined by a symmetric coefficient matrix. This algebraic structure gives a basic kind of $A$-graded algebras…

This article is about a decoding algorithm for error-correcting subspace codes. A version of this algorithm was previously described by Rosenthal, Silberstein and Trautmann. The decoding algorithm requires the code to be defined as the…

In this survey on local additive invariants of real and complex definable singular germs we systematically present classical or more recent invariants of different nature as emerging from a tame degeneracy principle. For this goal, we…