English
Related papers

Related papers: Log Canonical Thresholds for Plane Curves in Arbit…

200 papers

A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…

Information Theory · Computer Science 2016-11-17 Junekey Jeon

In this paper, we initiate our investigation of log canonical models for the moduli space of curves with the boundary divisor $\a \d$ as we decrease $\a$ from 1 to 0. We prove that for the first critical value $\a = 9/11$, the log canonical…

Algebraic Geometry · Mathematics 2007-05-23 Brendan Hassett , Donghoon Hyeon

We compute the $F$-pure threshold of the natural cone over flag varieties in characteristic $p>0$. Our calculations are mainly focused on flag varieties that are arithmetically Gorenstein, but we offer some results in the non-Gorenstein…

Algebraic Geometry · Mathematics 2025-09-26 Justin Fong

We discuss CLT for the global and local linear statistics of random matrices from classical compact groups. The main part of our proofs are certain combinatorial identities much in the spirit of works by Kac and Spohn.

Probability · Mathematics 2007-05-23 Alexander Soshnikov

Given a three-dimensional projective log canonical pair over a perfect field of characteristic larger than five, there exists a minimal model program that terminates after finitely many steps.

Algebraic Geometry · Mathematics 2019-03-06 Kenta Hashizume , Yusuke Nakamura , Hiromu Tanaka

Let $(X, \Delta)/U$ be klt pairs and $Q$ be a convex set of divisors. Assuming that the relative Kodaira dimensions are non-negative, then there are only finitely many log canonical models when the boundary divisors varying in a relatively…

Algebraic Geometry · Mathematics 2020-06-03 Zhan Li

We investigate the extent to which Linear Temporal Logic (LTL) formulas can be uniquely characterized by a finite set of labeled examples. We consider different types of examples, ranging from finite words to transfinite words, as well as…

Logic in Computer Science · Computer Science 2026-04-27 Balder ten Cate , Dana Fisman , Roi Ohayon , Patrik Sestic

In this paper we initiate the study of the computational complexity of learning linear temporal logic (LTL) formulas from examples. We construct approximation algorithms for fragments of LTL and prove hardness results; in particular we…

Formal Languages and Automata Theory · Computer Science 2021-02-02 Nathanaël Fijalkow , Guillaume Lagarde

We give a topological bound on the number of minimal models of a class of three dimensional log smooth pairs of general type.

Algebraic Geometry · Mathematics 2015-01-20 Paolo Cascini , Vladimir Lazić

1) Assuming log Minimal Model Conjecture, we give a construction of a complete moduli space of stable log pairs of arbitrary dimension generalizing directly the space M_{g,n} of pointed stable curves. Each stable pair has semi log canonical…

alg-geom · Mathematics 2008-02-03 Valery Alexeev

The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…

Cryptography and Security · Computer Science 2015-06-25 Andreas Enge , Pierrick Gaudry

The aim of this work is to provide a construction of generalized local symbols on algebraic curves as morphisms of group schemes. From a closed point of a complete, irreducible and non-singular curve $C$ over a perfect field $k$ as the only…

Algebraic Geometry · Mathematics 2020-07-07 Fernando Pablos Romo

Watanabe's singular learning theory provides a framework for asymptotic analysis of Bayesian model selection for statistical models with singularities, where traditional statistical regularity assumptions fail. Learning coefficients, also…

Statistics Theory · Mathematics 2025-11-20 Mathias Drton , Elizabeth Gross , Dimitra Kosta , Anton Leykin , Seth Sullivant , Daniel Windisch

This paper presents a methodology for temporal logic verification of discrete-time stochastic systems. Our goal is to find a lower bound on the probability that a complex temporal property is satisfied by finite traces of the system.…

Systems and Control · Computer Science 2019-11-22 Pushpak Jagtap , Sadegh Soudjani , Majid Zamani

We derive a general large deviation principle for a canonical sequence of probability measures, having its origins in random matrix theory, on unbounded sets $K$ of ${\bf C}$ with weakly admissible external fields $Q$ and very general…

Probability · Mathematics 2019-04-29 T. Bloom , N. Levenberg , F. Wielonsky

This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…

Algebraic Geometry · Mathematics 2018-09-25 Daniele Alessandrini

In this article, we study the pointwise asymptotic behavior of iterated convolutions on the one dimensional lattice Z. We generalize the so-called local limit theorem in probability theory to complex valued sequences. A sharp rate of…

Probability · Mathematics 2025-02-25 Lucas Coeuret

Let f :S\to B be a non locally trivial fibred surface. We prove a lower bound for the slope of f depending increasingly from the relative irregularity of f and the Clifford index of the general fibres.

Algebraic Geometry · Mathematics 2022-08-09 M. A. Barja , L. Stoppino

In the article, we exhibit a series of new examples of rigid plane curves, that is, curves, whose collection of singularities determines them almost uniquely up to a projective transformation of the plane.

Algebraic Geometry · Mathematics 2015-06-29 Viktor S. Kulikov , Eugenii Shustin

We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative and rational logics. Our…

Logic in Computer Science · Computer Science 2007-05-23 Laura Giordano , Valentina Gliozzi , Nicola Olivetti , Gian Luca Pozzato
‹ Prev 1 8 9 10 Next ›