Related papers: Desingularization of binomial varieties in arbitra…
An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional…
Let X be a smooth complex variety and Y be a closed subvariety of X, or more generally, a closed subscheme of X. We are interested in invariants attached to the singularities of the pair (X, Y). We discuss various methods to construct such…
We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also works for polynomials with multiple roots provided that the number $k$ of distinct roots is given as part of the input. It outputs $k$ pairwise…
The purpose of the present work is to describe a dequantization procedure for topological modules over a deformed algebra. We define the characteristic variety of a topological module as the common zeroes of the annihilator of the…
We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of…
This paper proposes seven combinatorial problems around formulas for the characteristic polynomial and the spectral numbers of a quasihomogeneous singularity. One of them is a new conjecture on the characteristic polynomial. It is an…
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…
Without any restrictions on the base field, we compute the hull and prove a conjecture of Eisenbud and Sturmfels giving an unmixed decomposition of a cellular binomial ideal. Over an algebraically closed field, we further obtain an explicit…
The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging…
In dimension two, we study complete monomial ideals combinatorially, their Rees algebras and develop effective means to find their defining equations.
A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set \Lambda_n^k consisting of all n\times n…
In this paper we introduce the notion of hybrid trigonometric parametrization as a tuple of real rational expressions involving circular and hyperbolic trigonometric functions as well as monomials, with the restriction that variables in…
Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…
Ore operators with polynomial coefficients form a common algebraic abstraction for representing D-finite functions. They form the Ore ring $K(x)[D_x]$, where $K$ is the constant field. Suppose $K$ is the quotient field of some principal…
This article is an exposition of an elementary constructive proof of canonical resolution of singularities in characteristic zero, presented in detail in Invent. Math. 128 (1997), 207-302. We define a new local invariant and get an…
We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.
In this work, under a mild assumption, we give the classification of the complete polynomial vector fields in two variables up to algebraic automorphisms of $\C^2$. The general problem is also reduced to the study of the combinatorics of…
Standard integration-by-parts (IBP) reduction methods typically yield Feynman integral bases where the reduction of some integrals gives rise to coefficients singular as the dimensional regulator $\epsilon\rightarrow 0$. These singular…