Related papers: On generalized minimal log discrepancy

We obtain new average results on the conjectures of Lang-Trotter and Sato-Tate about elliptic curves.

This paper is a gentle introduction to the theory of quasi-log varieties by Ambro. We explain the fundamental theorems for the log minimal model program for log canonical pairs. More precisely, we give a proof of the base point free theorem…

We establish adjunction and inversion of adjunction for log canonical centers of arbitrary codimension in full generality.

The second author studied arithmetic properties of a class of sequences that generalize the sequence of derangements. The aim of the following paper is to disprove two conjectures stated in \cite{miska}. The first conjecture regards the set…

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…

Human communication is based on a variety of inferences that we draw from sentences, often going beyond what is literally said. While there is wide agreement on the basic distinction between entailment, implicature, and presupposition, the…

We generalize the formula for the log canonical threshold(LCT) of plane curves over the complex numbers to arbitrary characteristics. Our proof relies purely on valuation theory, instead of on the theory of $D$-modules.

We prove that the abundance conjecture for non-uniruled klt pairs in dimension $n$ implies the abundance conjecture for uniruled klt pairs in dimension $n$, assuming the Minimal Model Program in lower dimensions.

An extension of the Gaussian correlation conjecture (GCC) is proved for multivariate gamma distributions (in the sense of Krishnamoorthy and Parthasarathy). The classical GCC for Gaussian probability measures is obtained by the special case…

We show that it is consistent, relative to the consistency of a strongly inaccessible cardinal, that an instance of the generalized Borel Conjecture introduced in [8] holds while the classical Borel Conjecture fails.

The smallest deformation of the minimal model M(2,3) that can accommodate Cardy's derivation of the percolation crossing probability is presented. It is shown that this leads to a consistent logarithmic conformal field theory at c=0. A…

Caputo, Ligget, and Richthammer proved Aldous' spectral gap conjecture, which asserts that the spectral gaps of a random walk and an interchange process on the common weighted graph are equal. In this paper, we will prove an analogue of…

The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…

A theory of matchings for finite subsets of an abelian group, introduced in connection with a conjecture of Wakeford on canonical forms for homogeneous polynomials, has since been extended to the setting of field extensions and to that of…

In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture informally states that, whenever we can express the measure of a…

The log-rank conjecture is one of the fundamental open problems in communication complexity. It speculates that the deterministic communication complexity of any two-party function is equal to the log of the rank of its associated matrix,…

We formulate a number of related generalisations of the weight part of Serre's conjecture to the case of GL(n) over an arbitrary number field, motivated by the formalism of the Breuil-M\'ezard conjecture. We give evidence for these…

The existence of $q$-ary linear complementary pairs (LCPs) of codes with $q> 2$ has been completely characterized so far. This paper gives a characterization for the existence of binary LCPs of codes. As a result, we solve an open problem…

We remark that an easy combination of two known results yields a positive answer, up to log(n) terms, to a duality conjecture that goes back to Pietsch. In particular, we show that for any two symmetric convex bodies K,T in R^n, denoting by…