Related papers: A procedure for computing the log canonical thresh…

We show that a miniaturised version of Maclagan's theorem on monomial ideals is equivalent to $\mathrm{1}{-}\mathrm{Con}(\mathrm{I}\Sigma_2)$ and classify a phase transition threshold for this theorem. This work highlights the combinatorial…

In this paper we show that the global (log) canonical threshold of $d$-sheeted covers of the $M$-dimensional projective space of index 1, where $d\geqslant 4$, is equal to one for almost all families (except for a finite set). The varieties…

Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. We bridge this gap for a natural and important special case, planar graph isomorphism,…

We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…

This paper is the continuation of the research of the author and his colleagues of the {\it canonical} decomposition of graphs. The idea of the canonical decomposition is to define the binary operation on the set of graphs and to represent…

Let X,X_1,X_2,... be independent identically distributed random variables and let h(x,y)=h(y,x) be a measurable function of two variables. It is shown that the bounded law of the iterated logarithm, $\limsup_n (n\log\log n)^{-1}|\sum_{1<=…

We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…

A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any algebra of polynomials generated by quadratic monomials. The toric ideal of relations…

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…

We show that the log canonical threshold of a generic determinantal variety and its generic link are the same.

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

We provide a direct computation of the $F$-pure threshold of degree four homogeneous polynomial in two variables and, more generally, of certain homogeneous polynomials with four distinct roots. The computation depends on whether the cross…

We present a randomized polynomial-time algorithm to generate a random integer according to the distribution of norms of ideals at most N in any given number field, along with the factorization of the integer. Using this algorithm, we can…

In this article, we extend the notion of the $F$-thresholds of ideals to the $F$-thresholds for filtrations of ideals. The existence of $F$-thresholds of filtrations are established for various types of filtrations. Moreover, various…

This paper concerns the exponentiation of monomial ideals. While it is customary for the exponentiation operation on ideals to consider natural powers, we extend this notion to powers where the exponent is a positive real number. Real…

We compute the $F$-pure threshold of some non-principal ideals which satisfy a geometric generic condition about their Newton polyhedron. We also contribute some evidence in favor of the conjectured equality between the $F$-pure threshold…

We present an algorithm to compute the annihilator of (i.e., the linear differential equations for) the logarithm of a polynomial in the ring of differential operators with polynomial coefficients. The algorithm consists of differentiation…

We prove the abundance theorem for log canonical $n$-folds such that the boundary divisor is big assuming the abundance conjecture for log canonical $(n-1)$-folds. We also discuss the log minimal model program for log canonical $4$-folds.

We define a notion of grading of a monoid T in a monoidal category C, relative to a class of morphisms M (which provide a notion of M-subobject). We show that, under reasonable conditions (including that M forms a factorization system),…

Horn functions form a subclass of Boolean functions and appear in many different areas of computer science and mathematics as a general tool to describe implications and dependencies. Finding minimum sized representations for such functions…