English
Related papers

Related papers: Independent sets in the hypercube revisited

200 papers

Let $G(n,c/n)$ and $G_r(n)$ be an $n$-node sparse random graph and a sparse random $r$-regular graph, respectively, and let ${\cal I}(n,r)$ and ${\cal I}(n,c)$ be the sizes of the largest independent set in $G(n,c/n)$ and $G_r(n)$. The…

Probability · Mathematics 2007-05-23 David Gamarnik , Tomasz Nowicki , Grzegorz Swirscsz

The top Lyapunov exponent $\lambda_+(A, p)$ of a random product of matrices in $\mathrm{GL}(d, \mathbb{R})$, $d \geq 2$, with simple top spectrum, depends real-analytically on the probability weights $p$ and the matrix coefficients $A$. We…

Dynamical Systems · Mathematics 2026-04-29 Abdoulaye Thiam

We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…

Combinatorics · Mathematics 2014-12-01 David Saxton , Andrew Thomason

We provide a proof of the union-closed sets conjecture, by means of a suitable refinement of the breakthrough entropy-approach introduced by Gilmer. The novelty here is to consider a convex combination of $A$ and $A\cup B$, where $A,B$ are…

Combinatorics · Mathematics 2023-02-09 Raffaele Scandone

We give nearly optimal bounds on the sample complexity of $(\widetilde{\Omega}(\epsilon),\epsilon)$-tolerant testing the $\rho$-independent set property in the dense graph setting. In particular, we give an algorithm that inspects a random…

Data Structures and Algorithms · Computer Science 2025-03-28 Cameron Seth

The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…

Probability · Mathematics 2018-10-18 Valentin Féray

We introduce and study a class of discrete particle ensembles that naturally arise in connection with classical random matrix ensembles, log-gases and Jack polynomials. Under technical assumptions on a general analytic potential we prove…

Probability · Mathematics 2022-07-20 Evgeni Dimitrov , Alisa Knizel

We introduce the concepts of an amazing hypercube decomposition and a double shortcut for it, and use these new ideas to formulate a conjecture implying the Combinatorial Invariance Conjecture of the Kazhdan--Lusztig polynomials for the…

Combinatorics · Mathematics 2024-11-27 Francesco Esposito , Mario Marietti , Grant T. Barkley , Christian Gaetz

We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\{1,...,n\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our…

Number Theory · Mathematics 2015-05-13 Daniel Katz

Given a configuration $A$ of $n$ points in $\mathbb{R}^{d-1}$, we introduce the higher secondary polytopes $\Sigma_{A,1},\dots, \Sigma_{A,n-d}$, which have the property that $\Sigma_{A,1}$ agrees with the secondary polytope of…

Combinatorics · Mathematics 2019-09-13 Pavel Galashin , Alexander Postnikov , Lauren Williams

The enumeration of independent sets of regular graphs is of interest in statistical mechanics, as it corresponds to the solution of hard-particle models. In 2004, it was conjectured by Fendleyet al. that for some rectangular grids, with…

Combinatorics · Mathematics 2008-10-31 Mireille Bousquet-Mélou , Svante Linusson , Eran Nevo

We provide a unified analysis of a posteriori and a priori error bounds for a broad class of discontinuous Galerkin and $C^0$-IP finite element approximations of fully nonlinear second-order elliptic Hamilton--Jacobi--Bellman and Isaacs…

Numerical Analysis · Mathematics 2021-03-24 Ellya L. Kawecki , Iain Smears

We study asymptotics of the recurrence coefficients of orthogonal polynomials associated to the generalized Jacobi weight, which is a weight function with a finite number of algebraic singularities on $[-1,1]$. The recurrence coefficients…

Classical Analysis and ODEs · Mathematics 2007-05-23 M. Vanlessen

We conclude our work [arXiv:2403.07628, arXiv:2503.12644] on asymptotic expansions at the soft edge for the classical $n$-dimensional Gaussian and Laguerre ensembles, now studying the gap-probability generating functions. We show that the…

Probability · Mathematics 2026-05-18 Folkmar Bornemann

We study compact embeddings of Sobolev, Besov, and Triebel-Lizorkin spaces with variable exponents on both bounded and unbounded metric measure spaces. We establish sufficient conditions for compactness, and under additional assumptions, we…

Functional Analysis · Mathematics 2026-03-26 Michał Dymek

We consider the limiting process that arises at the hard edge of Muttalib--Borodin ensembles. This point process depends on $\theta > 0$ and has a kernel built out of Wright's generalized Bessel functions. In a recent paper, Claeys, Girotti…

Mathematical Physics · Physics 2019-07-01 Christophe Charlier , Jonatan Lenells , Julian Mauersberger

We study averages of multiplicative eigenvalue statistics in ensembles of orthogonal Haar distributed matrices, which can alternatively be written as Toeplitz+Hankel determinants. We obtain new asymptotics for symbols with Fisher-Hartwig…

Mathematical Physics · Physics 2020-08-19 Tom Claeys , Gabriel Glesner , Alexander Minakov , Meng Yang

We carry out the asymptotic analysis of repulsive ensembles of N particles which are discrete analogues of continuous 1d log-gases or beta-ensembles of random matrix theory. The ensembles that we study have several groups of particles which…

Probability · Mathematics 2026-03-03 Gaëtan Borot , Vadim Gorin , Alice Guionnet

This paper is part of series on self-contained papers in which a large part, if not the full extent, of the asymptotic limit theory of summands of independent random variables is exposed. Each paper of the series may be taken as review…

Probability · Mathematics 2021-08-24 Aladji Babacar Niang , Gane Samb Lo , Moumouni Diallo

This paper analyzes independence concepts for sets of probability measures associated with directed acyclic graphs. The paper shows that epistemic independence and the standard Markov condition violate desirable separation properties. The…

Artificial Intelligence · Computer Science 2013-01-18 Fabio Gagliardi Cozman