Related papers: Desingularization of binomial varieties in arbitra…
In our paper "Non-commutative desingularization of determinantal varieties, I" we constructed and studied non-commutative resolutions of determinantal varieties defined by maximal minors. At the end of the introduction we asserted that the…
This survey of methods surrounding lattice point methods for binomial ideals begins with a leisurely treatment of the geometric combinatorics of binomial primary decomposition. It then proceeds to three independent applications whose…
The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop…
This paper proposes an efficient probabilistic method that computes combinatorial gradient fields for two dimensional image data. In contrast to existing algorithms, this approach yields a geometric Morse-Smale complex that converges almost…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
In the first chapter we present new results related on monomial ideals of Borel type. Also, we introduce a new class of monomial ideals, called $\de$-fixed ideals, which generalize the class of $p$-Borel ideals and we extend several results…
Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…
In the paper we investigate an algorithmic associative binary operation $*$ on the set $\mathcal{LR}_1$ of Littlewood-Richardson tableaux with entries equal to one. We extend $*$ to an algorithmic nonassociative binary operation on the set…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common…
We present a symbolic perturbation scheme for arbitrary polynomial geometric predicates which combines the benefits of Emiris and Canny's simple randomized linear perturbation scheme with Yap's multiple infinitesimal scheme for general…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
Let $A=\{{\bf a}_1,...,{\bf a}_m\} \subset \mathbb{Z}^n$ be a vector configuration and $I_A \subset K[x_1,...,x_m]$ its corresponding toric ideal. The paper consists of two parts. In the first part we completely determine the number of…
We present a simple and fast embedded resolution of varieties and principalization of ideals using torus actions on ambient smooth varieties with simple normal crossings (SNC) divisors. The canonical functorial resolution in characteristic…
A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser posed as their main open…
This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two…
In this article, we define a class of binomial ideals associated to a simplicial complex. This class of ideals appears in the presentation of fiber cones of codimension 2 lattice ideals \cite{hm}, and in the work of Barile and Morales…
It has been conjectured that the toric ideal of the base ring of a discrete polymatroid is generated by symmetric exchange binomials. In the present paper, we give several classes of discrete polymatroids which yield toric ideals generated…