Related papers: A counterexample to the PIA conjecture for minimal…

We present a theoretical analysis of the approximation properties of convolutional architectures when applied to the modeling of temporal sequences. Specifically, we prove an approximation rate estimate (Jackson-type result) and an inverse…

In this paper, I prove a very general extension theorem for log pluricanonical systems. The main application of this extension theorem is (together with Kawamata's subadjunction theorem) to give an optimal subadjunction theorem which…

In this paper we consider families of compact convex sets in $\mathbb R^d$ such that any subfamily of size at most $d$ has a nonempty intersection. We prove some analogues of the central point theorem and Tverberg's theorem for such…

We prove relative versions of many earlier results about almost invariant sets and splittings of groups. In particular, we prove a relative version of the algebraic torus theorem, and we prove the existence and uniqueness of relative…

This chapter surveys some of the main results on interpolation in several of the most prominent families of non-classical logics. Special attention is given to the distinction between the two most commonly studied variants of…

We present a counter-example to the statement that there is a linear reduction in both directionsbetween the largest common subtree and the smallest common supertrees. Moreover, we show that in general, even having of one of them, it is…

We provide a proof of a variant of the Landau-Siegel Zeros conjecture.

We present a short proof, relaying on the divergence theorem, verifying that minimal sets in the plane are trivial.

We establish the exact overlaps conjecture for iterated functions systems on the real line with algebraic contractions and arbitrary translations.

The law of the iterated logarithm for discrepancies of geometric progressions with small ratios is proved.

We prove a new variant of comparison principle for logarithmic $L_2$-small ball probabilities of Gaussian processes. As an application, we obtain logarithmic small ball asymptotics for some well-known processes with smooth covariances.

An explanation to the boundness of minimal log discrepancies conjectured by V.V. Shokurov would be that the minimal log discrepancies of a variety in its closed points define a lower semi-continuous function. We check this lower…

We introduce a class of singular log schemes in three dimensions and conjecture that log schemes in this class admit log crepant log resolutions. We provide examples as evidence and relate this conjecture to the conjecture made in [4] and…

This is essentially an erratum, with some example to indicate inconsistencies. Suppose $A=k[X_1, X_2, \ldots, X_n]$ is a polynomial ring over a field $k$. The Complete Intersection conjecture states that, for any ideal $I$ in $A$,…

We answer the following question of R. L. Graham: What is the discrepancy of the lexicographically-least binary de Bruijn sequence? Here, "discrepancy" refers to the maximum (absolute) difference between the number of ones and the number of…

We prove a stronger version of a termination theorem appeared in the paper "On existence of log minimal models II". We essentially just get rid of the redundant assumptions so the proof is almost the same as in there. However, we give a…

An approximation result for the bilinear Hilbert transform is proved and used for the inversion of the bilinear Hilbert transform. Also, p-Lebesgue points $(p\geq 1)$ are analyzed.

We apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics.

The aims of this paper are twofold. First, it discusses the Littlewood conjecture and its variants with respect to uniformly distributed sequences. The second aim is to determine the exact order of the discrepancy of the van der…

We introduce the notion of a combinatorial inverse system in non-commutative variables. We present two important examples, some conjectures and results. These conjectures and results were suggested and supported by computer investigations.