Related papers: Forbidden vector-valued intersections
We identify a new and important global (or non-binary) constraint. This constraint ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This constraint is useful for a number of different…
In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean space can be divided into n+1 parts of smaller diameter. The diameter of a set is defined as the supremum (least upper bound) of the distances of contained…
We introduce a bottleneck method for learning data representations based on information deficiency, rather than the more traditional information sufficiency. A variational upper bound allows us to implement this method efficiently. The…
An old and well-known conjecture of Frankl and F\"{u}redi states that the Lagrangian of an $r$-uniform hypergraph with $m$ edges is maximised by an initial segment of colex. In this paper we disprove this conjecture by finding an infinite…
We study the following metric distortion problem: there are two finite sets of points, $V$ and $C$, that lie in the same metric space, and our goal is to choose a point in $C$ whose total distance from the points in $V$ is as small as…
New upper bounds on the relative entropy are derived as a function of the total variation distance. One bound refines an inequality by Verd\'{u} for general probability measures. A second bound improves the tightness of an inequality by…
Variational inference has become an increasingly attractive fast alternative to Markov chain Monte Carlo methods for approximate Bayesian inference. However, a major obstacle to the widespread use of variational methods is the lack of…
We investigate an interpolation/extrapolation method that, given scattered observations of the Fourier transform, approximates its inverse. The interpolation algorithm takes advantage of modelling the available data via a shape-driven…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
In this paper we establish effective lower bounds on the degrees of the Debarre and Kobayashi conjectures. Then we study a more general conjecture proposed by Diverio-Trapani on the ampleness of jet bundles of general complete intersections…
Peculiar measurements can be obtained on systems that undergo both pre- and post-selection. We prove a conjecture from [1] on logical Pre- and Post-Selection (PPS) paradoxes for a restricted case. We prove that all of these paradoxes admit…
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$,…
This paper studies approximate solutions of a linear fractional vector optimization problem without requiring boundedness of the constraint set. We establish necessary and sufficient conditions for approximating weakly efficient points of…
A deep conjecture on torsion anomalous varieties states that if $V$ is a weak-transverse variety in an abelian variety, then the complement $V^{ta}$ of all $V$-torsion anomalous varieties is open and dense in $V$. We prove some cases of…
We prove a new Elekes-Szab\'o type estimate on the size of the intersection of a Cartesian product $A\times B\times C$ with an algebraic surface $\{f=0\}$ over the reals. In particular, if $A,B,C$ are sets of $N$ real numbers and $f$ is a…
Borsuk asked in 1933 if every set of diameter 1 in $R^d$ can be covered by $d+1$ sets of smaller diameter. In 1993, a negative solution, based on a theorem by Frankl and Wilson, was given by Kahn and Kalai. In this paper I will present…
We study a class of hypothesis testing problems in which, upon observing the realization of an $n$-dimensional Gaussian vector, one has to decide whether the vector was drawn from a standard normal distribution or, alternatively, whether…
We consider quantitative versions of Helly-type questions, that is, instead of finding a point in the intersection, we bound the volume of the intersection. Our first main geometric result is a quantitative version of the Fractional Helly…
We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…
Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…