Related papers: A procedure for computing the log canonical thresh…
In the context of modeling biological systems, it is of interest to generate ideals of points with a unique reduced Groebner basis, and the first main goal of this paper is to identify classes of ideals in polynomial rings which share this…
We show that the minimal log discrepancy of any $\mathbb Q$-Gorenstein non-canonical threefold is $\leq\frac{12}{13}$, which is an optimal bound.
In this paper we show that the set of accumulation points of generalized log canonical thresholds for certain DCC sets comes from the set of generalized log canonical thresholds of dimension $1$ less of the same DCC sets.
It is known that the set of log canonical thresholds (lcts) on any varieties with fixed dimension satisfies the ascending chain condition. Inspired by the foliated minimal model program, it is intriguing to study the foliated version of…
Quantum compiling addresses the problem of approximating an arbitrary quantum gate with a string of gates drawn from a particular finite set. It has been shown that this is possible for almost all choices of base sets and furthermore that…
We show that log canonical thresholds for complex analytic spaces satisfy the ACC.
Given any equigenerated monomial ideal $I$ with the property that the defining ideal $J$ of the fiber cone $ F(I)$ of $I$ is generated by quadratic binomials, we introduce a matrix such that the set of its binomial $2$-minors is a…
We give necessary and sufficient conditions for the (bounded) law of the iterated logarithm for canonical $U$-statistics of arbitrary order $d$, extending the previously known results for $d=2$. The nasc's are expressed as growth conditions…
Using $\mathcal{P}$-canonical forms of matrices, we derive the minimal polynomial of the Kronecker product of a given family of matrices in terms of the minimal polynomials of these matrices. This, allows us to prove that the product…
We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals.
The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
This paper considers the approximation of a monomial $x^n$ over the interval $[-1,1]$ by a lower-degree polynomial. This polynomial approximation can be easily computed analytically and is obtained by truncating the analytical Chebyshev…
We consider the Hodge filtration on the sheaf of meromorphic functions along free divisors for which the logarithmic comparison theorem holds. We describe the Hodge filtration steps as submodules of the order filtration on a cyclic…
Recently classes of conic and discrete conic functions were introduced. In this paper we use the term convic instead conic. The class of convic functions properly includes the classes of convex functions, strictly quasiconvex functions and…
We establish the minimal model program for log canonical and Q-factorial surfaces over excellent base schemes.
This paper studies the numbers of minimal generators of powers of monomial ideals in polynomial rings. For a monomial ideal $I$ in two variables, Eliahou, Herzog, and Saem gave a sharp lower bound $\mu (I^2)\ge 9$ for the number of minimal…
We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…
The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…
We detail a procedure for the computation of the polynomial form of an electronic combinational circuit from the design equations in a truth table. The method uses the Buchberger algorithm rather than current traditional methods based on…