Related papers: On threefold canonical thresholds

A code $C \subseteq \{0, 1, 2\}^n$ of length $n$ is called trifferent if for any three distinct elements of $C$ there exists a coordinate in which they all differ. By $T(n)$ we denote the maximum cardinality of trifferent codes with length.…

We show that the threshold for the binomial random $3$-partite, $3$-uniform hypergraph $G^{3}((n,n,n),p)$ to contain a Latin square is $\Theta(\log{n}/n)$. We also prove analogous results for Steiner triple systems and proper list…

A \emph{covering array} is an $N \times k$ array of elements from a $v$-ary alphabet such that every $N \times t$ subarray contains all $v^t$ tuples from the alphabet of size $t$ at least $\lambda$ times; this is denoted as $\CA_\lambda(N;…

We show that if a divisor centered over a point on a smooth surface computes a minimal log discrepancy, then the divisor also computes a log canonical threshold. To prove the result, we study the asymptotic log canonical threshold of the…

We show that the triple-crossing number of any knot is greater or equal to twice its (canonical) genus and we show an even stronger bound in the case of links. As an application we show that this bound is strong enough to obtain the…

We introduce real log canonical threshold and real jumping numbers for real algebraic functions. A real jumping number is a root of the $b$-function up to a sign if its difference with the minimal one is less than 1. The real log canonical…

We compare the transition barrier that accompanies a first-order phase transition in the canonical and microcanonical ensemble. This is directly encoded in the probability distributions of standard Metropolis Monte Carlo simulations and a…

We show the abundance theorem for arithmetic klt threefold pairs whose closed point have residue characteristic greater than five. As a consequence, we give a sufficient condition for the asymptotic invariance of plurigenera for certain…

Let $G$ be a finite Abelian group. For a subset $S \subseteq G$, let $T_3(S)$ denote the number of length three arithemtic progressions in $S$ and Prob[$S$] $= \frac{1}{|S|^2}\sum_{x,y \in S} 1_S(x+y)$. For any $q \ge 1$ and $\alpha \in…

We show that for a $\mathbb Q$-factorial canonical Fano $3$-fold $X$ of Picard number $1$, $(-K_X)^3\leq 72$. The main tool is a Kawamata--Miyaoka type inequality which relates $(-K_X)^3$ with $\hat{c}_2(X)\cdot c_1(X)$, where…

In this paper, we show that the canonical divisor of a smooth toroidal compactification of a complex hyperbolic manifold must be nef if the dimension is greater or equal to three. Moreover, if $n\geq 3$ we show that the numerical dimension…

We prove that one can run the log minimal model program for log canonical $3$-fold pairs in characteristic $p>5$. In particular we prove the Cone Theorem, Contraction Theorem, the existence of flips and the existence of log minimal models…

We study Gorenstein almost Fano threefolds X with canonical singularities and pseudoindex > 1. We show that the maximal Picard number of X is 10 in general, 3 if X is Fano, and 8 if X is toric. Moreover, we characterize the boundary cases.…

It is proved that the degree of a morphism from a smooth projective n-fold with Picard number one to a smooth n-quadric is bounded (provided, of course, that n is at least three). Actually it has been proved some years ago, but I have never…

We study log canonical thresholds (also called global log canonical threshold or $\alpha$-invariant) of $\mathbb{R}$-linear systems. We prove existence of positive lower bounds in different settings, in particular, proving a conjecture of…

The current paper represents the first part: it contains the results concerning the lifting of twisted canonical sections defined on an infinitesimal neighborhood of the central fiber of a smooth, proper K\"ahler family which verify a…

We revisit results obtained in [F. Harary, U. Peled, Hamiltonian threshold graphs, Discrete Appl.~Math., 16 (1987), 11--15], where several necessary and necessary and sufficient conditions for a connected threshold graph to be Hamiltonian…

Linear upper bounds may be derived by imposing specific structural conditions on a generating set, such as additional constraints on ranks, eigenvalues, or the degree of the minimal polynomial of the generating matrices. This paper…

Given positive integers $a\leq b \leq c$, let $K_{a,b,c}$ be the complete 3-partite 3-uniform hypergraph with three parts of sizes $a,b,c$. Let $H$ be a 3-uniform hypergraph on $n$ vertices where $n$ is divisible by $a+b+c$. We…

We prove an upper bound of $n+9$ for the strong separation number of the complete graph $K_n$, and an upper bound of $n+1$ for its weak separation number. This improves on the previous best known bound of $(1+o(1))n$ for both cases.