Related papers: ACC for generalized log canonical thresholds for c…
We show that the existence of a birational weak Zariski decomposition for a pseudo-effective generalized polarized lc pair is equivalent to the existence of a generalized polarized log terminal model.
We prove the existence of $n$-complements for pairs with DCC coefficients and the ACC for minimal log discrepancies of exceptional singularities. In order to prove these results, we develop the theory of complements for real coefficients.…
We study computational aspects of the General Position Subset Selection problem defined as follows: Given a set of points in the plane, find a maximum-cardinality subset of points in general position. We prove that General Position Subset…
We present a procedure for computing the log-canonical threshold of an arbitrary ideal generated by binomials and monomials. The computation of the log canonical threshold is reduced to the problem of computing the minimum of a function,…
We prove the finiteness of $B$-representations of generalised log canonical pairs. As a consequence, we prove that, the (relative) abundance for a generalised semi-log canonical pair is implied by the abundance for its normalisation.…
In this paper, we show the abundance theorem for log canonical surfaces over fields of positive characteristic.
In this article, we investigate F-pure thresholds of polynomials that are homogeneous under some N-grading, and have an isolated singularity at the origin. We characterize these invariants in terms of the base p expansion of the…
We describe the set of minimal log discrepancies of toric log varities, and study its accumulation points.
We prove the first generalization bound for large-margin halfspaces that is asymptotically tight in the tradeoff between the margin, the fraction of training points with the given margin, the failure probability and the number of training…
Generalized Canonical Correlation Analysis (GCCA) is an important tool that finds numerous applications in data mining, machine learning, and artificial intelligence. It aims at finding `common' random variables that are strongly correlated…
For analytic operator functions, we prove accumulation of branches of complex eigenvalues to the essential spectrum. Moreover, we show minimality and completeness of the corresponding system of eigenvectors and associated vectors. These…
We derive global analytic representations of fundamental solutions for a class of linear parabolic systems with full coupling of first order derivative terms where coefficient may depend on space and time. Pointwise convergence of the…
We provide some necessary details to several arguments appearing in our previous paper ``Canonical bases for quantum generalized Kac-Moody algebras''. We also make the link with some other work on the same subject.
We study the \L ojasiewicz exponent and the log canonical threshold of ideals of $\mathcal O_n$ when restricted to generic subspaces of $\mathbb C^n$ of different dimensions. We obtain effective formulas of the resulting numbers for ideals…
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and…
Let X be a smooth variety and Y a closed subscheme of X. By comparing motivic integrals on X and on a log resolution of (X,Y), we prove the following formula for the log canonical threshold of (X,Y): c(X,Y)=dim X-sup_m{(dim Y_m}/(m+1)},…
Given a graded sequence of ideals (a_m) on a smooth variety $X$ having finite log canonical threshold, suppose that for every m we have a divisor E_m over X that computes the log canonical threshold of a_m, and such that the log…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…
We generalize results from topological robotics on the topological complexity (TC) of aspherical spaces to sectional categories of fibrations inducing subgroup inclusions on the level of fundamental groups. In doing so, we establish new…