English
Related papers

Related papers: On real log canonical thresholds

200 papers

It has been conjectured for some time that, for any integer n\ge 2, any real number \epsilon >0 and any transcendental real number \xi, there would exist infinitely many algebraic integers \alpha of degree at most n with the property that…

Number Theory · Mathematics 2007-05-23 Damien Roy

We construct a measure valued Markov process which we call infinite canonical super-Brownian motion, and which corresponds to the canonical measure of super-Brownian motion conditioned on non-extinction. Infinite canonical super-Brownian…

Probability · Mathematics 2007-05-23 Remco van der Hofstad

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…

Computational Complexity · Computer Science 2018-05-08 Masaki Nakanishi , Marcos Villagra

A formula for the jumping numbers of a curve unibranch at a singular point is established. The jumping numbers are expressed in terms of the Enriques diagram of the log resolution of the singularity, or equivalently in terms of the…

Algebraic Geometry · Mathematics 2008-06-05 Daniel Naie

The signature function of a knot is a locally constant integer valued function with domain the unit circle. The jumps (i.e., the discontinuities) of the signature function can occur only at the roots of the Alexander polynomial on the unit…

Geometric Topology · Mathematics 2007-05-23 Stavros Garoufalidis

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)},…

Algebraic Geometry · Mathematics 2007-05-23 Mircea Mustata

We introduce a new canonical height function for Jordan blocks of small eigenvalues for endomorphisms on smooth projective varieties over a number field. We prove that under an assumption on the eigenvalues of the endomorphism on the group…

Algebraic Geometry · Mathematics 2017-12-21 Kaoru Sano

Let $(X/Z,B+A)$ be a $\Q$-factorial dlt pair where $B,A\ge 0$ are $\Q$-divisors and $K_X+B+A\sim_\Q 0/Z$. We prove that any LMMP$/Z$ on $K_X+B$ with scaling of an ample$/Z$ divisor terminates with a good log minimal model or a Mori fibre…

Algebraic Geometry · Mathematics 2012-04-25 Caucher Birkar

Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…

Classical Analysis and ODEs · Mathematics 2020-09-28 Soham Basu

We express the Segre class of a monomial scheme in projective space in terms of log canonical thresholds of associated ideals. Explicit instances of the relation amount to identities involving the classical polygamma functions.

Algebraic Geometry · Mathematics 2018-01-25 Paolo Aluffi

Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…

Computational Complexity · Computer Science 2010-12-20 Hector Zenil

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…

Commutative Algebra · Mathematics 2014-04-16 Daniel J. Hernández , Luis Núñez-Betancourt , Emily E. Witt , Wenliang Zhang

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

Algebraic Geometry · Mathematics 2025-09-03 Boris Kazarnovskii

We prove an upper bound on the log canonical threshold of a hypersurface that satisfies a certain power condition and use it to prove several generalizations of Igusa's conjecture on exponential sums, with the log-canonical threshold in the…

Number Theory · Mathematics 2019-03-20 Raf Cluckers , Mircea Mustaţǎ , Kien Huu Nguyen

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…

Algebraic Geometry · Mathematics 2025-11-13 Yen-An Chen

We give a separation bound for the complex roots of a trinomial $f \in \mathbb{Z}[X]$. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of $f$; in particular, it is polynomial in $\log…

Symbolic Computation · Computer Science 2018-10-26 Pascal Koiran

Transcendental functions, such as exponentials and logarithms, appear in a broad array of computational domains: from simulations in curvilinear coordinates, to interpolation, to machine learning. Unfortunately they are typically expensive…

Computational Physics · Physics 2022-06-22 Jonah M. Miller , Joshua C. Dolence , Daniel Holladay

Let V be a smooth projective 3-fold of general type. Denote by $K^3$, a rational number, the self-intersection of the canonical sheaf of any minimal model of V. One defines $K^3$ as the canonical volume of $V$. Assume $p_g\ge 2$. We show…

Algebraic Geometry · Mathematics 2007-05-23 Meng Chen

The \emph{canonical structures of the plane} are those that result, up to isomorphism, from the rings that have the form $\mathds{R}[x]/(ax^2+bx+c)$ with $a\neq 0$.That ring is isomorphic to $\mathds{R}[\theta]$, where $\theta$ is the…

Rings and Algebras · Mathematics 2007-07-06 José C. Cifuente , João E. Strapasson , Ana C. Corrêa , Patrícia M. Kitani

The threshold degree of a Boolean function $f\colon\{0,1\}^n\to\{0,1\}$ is the minimum degree of a real polynomial $p$ that represents $f$ in sign: $\mathrm{sgn}\; p(x)=(-1)^{f(x)}.$ A related notion is sign-rank, defined for a Boolean…

Computational Complexity · Computer Science 2019-01-07 Alexander A. Sherstov , Pei Wu
‹ Prev 1 3 4 5 6 7 10 Next ›