Related papers: Discrete Poincar\'e inequalities and universal app…

This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…

We derive here the Friedland-Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in $r$-regular bipartite graphs. It is shown that some of these bounds are…

We prove a fractional version of Poincar\'e inequalities in the context of $\R^n$ endowed with a fairly general measure. Namely we prove a control of an $L^2$ norm by a non local quantity, which plays the role of the gradient in the…

In 2000, Cohn, Kenyon and Propp studied uniformly random perfect matchings of large induced subgraphs of $\mathbb Z^2$ (a.k.a. dimer configurations or domino tilings) and developed a large deviation theory for the associated height…

We demonstrate the necessity of a Poincar\'e type inequality for those metric measure spaces that satisfy Cheeger's generalization of Rademacher's theorem for all Lipschitz functions taking values in a Banach space with the Radon-Nikodym…

Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*} {\mathbb P}(\text{$A$ is singular in…

We discuss situations where perturbing a probability measure on $\mathbb{R}^n$ does not deteriorate its Poincar\'e constant by much. A particular example is the symmetric exponential measure in $\mathbb{R}^n$, even log-concave perturbations…

We solve several new sharp inequalities relating three quantities amongst the area, perimeter, inradius, circumradius, diameter, and minimal width of planar convex bodies. As a consequence, we narrow the missing gaps in each of the missing…

The object of the paper is to find complete systems of inequalities relating the perimeter $P$, the area $|\cdot|$ and the Cheeger constant $h$ of planar sets. To do so, we study the so called Blaschke--Santal\'o diagram of the triplet…

The decision problem of perfect matchings in uniform hypergraphs is famously an NP-complete problem. It has been shown by Keevash--Knox--Mycroft [STOC, 2013] that for every $\varepsilon>0$, such decision problem restricted to $k$-uniform…

Universal methods for optimization are designed to achieve theoretically optimal convergence rates without any prior knowledge of the problem's regularity parameters or the accurarcy of the gradient oracle employed by the optimizer. In this…

In this paper we present an efficiently scaling quantum algorithm which finds the size of the maximum common edge subgraph for a pair of arbitrary graphs and thus provides a meaningful measure of graph similarity. The algorithm makes use of…

We construct nonlinear entire anisotropic minimal graphs over $\mathbb{R}^4$, completing the solution to the anisotropic Bernstein problem. The examples we construct have a variety of growth rates, and our approach both generalizes to…

In this article, under mild constraints on the sectional curvature, we exploit a divergence formula for symmetric endomorphisms to deduce a general Poincar\'e type inequality. We apply such inequality to higher-order mean curvature of…

We prove non asymptotic total variation estimates for the kinetic Langevin algorithm in high dimension when the target measure satisfies a Poincar\'e inequality and has gradient Lipschitz potential. The main point is that the estimate…

We give new examples and describe the complete lists of all measures on the set of countable homogeneous universal graphs and $K_s$-free homogeneous universal graphs (for $s\geq 3$) that are invariant with respect to the group of all…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…

Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…

We introduce the notion of domain of finite type $\mathscr{D}\subset\mathbb{R}^n$ generalizing an earlier work of Bodin, Popescu-Pampu and Sorea. Then, we prove that every finite graph admitting a good orientation whose vertices have degree…

Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…