Related papers: A counterexample to the PIA conjecture for minimal…
In 2004, de Mathan and Teuli\'e stated the $p$-adic Littlewood Conjecture ($p$-$LC$) in analogy with the classical Littlewood Conjecture. Given a field $\mathbb{K}$ and an irreducible polynomial $p(t)$ with coefficients in $\mathbb{K}$,…
In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…
Variational inference consists in finding the best approximation of a target distribution within a certain family, where `best' means (typically) smallest Kullback-Leiber divergence. We show that, when the approximation family is…
We show that the incorporation of any new piece of information allows for improved decision making in the sense that the expected costs of an optimal decision decrease (or, in boundary cases where no or not enough new information is…
An old conjecture of Durfee 1978 bounds the ratio of two basic invariants of complex isolated complete intersection surface singularities: the Milnor number and the singularity (or geometric) genus. We give a counterexample for the case of…
We consider counterfactual explanations, the problem of minimally adjusting features in a source input instance so that it is classified as a target class under a given classifier. This has become a topic of recent interest as a way to…
We prove the Invariant Subspace Conjecture for separable Hilbert spaces.
Several results about the union-closed sets conjecture are presented.
We narrow the gap between the family of graphs that do and the family of graphs that do not satisfy the fat minor conjecture by obtaining much simpler counterexamples than were previously known, including $K_t, t \geq 6$ and $K_{s,t}, s,t…
We give a simple proof of a recent result by J. Schleischitz dealing with a counterexample to the uniform Littlewood conjecture. Our construction is based on simple properties of Fibonacci numbers.
Many trace inequalities can be expressed either as concavity/convexity theorems or as monotonicity theorems. A classic example is the joint convexity of the quantum relative entropy which is equivalent to the Data Processing Inequality. The…
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…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
We prove Union-Closed sets conjecture.
We consider the following conjecture: on a klt germ (X,x), for every finite set I there is a positive integer N with the property that for every R-ideal J on X with exponents in I, there is a divisor E over X that computes the minimal log…
We prove new results, related to the Littlewood and Mixed Littlewood conjectures in Diophantine approximation.
We prove that the exponent of the entropy of one dimensional projections of a log-concave random vector defines a 1/5-seminorm. We make two conjectures concerning reverse entropy power inequalities in the log-concave setting and discuss…
Motivated, in part, by the desire to develop an information-theoretic foundation for compound Poisson approximation limit theorems (analogous to the corresponding developments for the central limit theorem and for simple Poisson…
We prove that the non-vanishing conjecture and the log minimal model conjecture for projective log canonical pairs can be reduced to the non-vanishing conjecture for smooth projective varieties such that the boundary divisor is zero.
Let $\mathcal{P}$ be a set of points in the plane, and $\mathcal{S}$ a strictly convex set of points. In this note, we show that if $\mathcal{P}$ contains many translates of $\mathcal{S}$, then these translates must come from a generalized…