相关论文: Independent sets in the hypercube revisited
We study the numerical approximation of a coupled hyperbolic-parabolic system by a family of discontinuous Galerkin space-time finite element methods. The model is rewritten as a first-order evolutionary problem that is treated by the…
We study the algorithmic task of finding large independent sets in Erdos-Renyi $r$-uniform hypergraphs on $n$ vertices having average degree $d$. Krivelevich and Sudakov showed that the maximum independent set has density $\left(\frac{r\log…
The container methods are powerful tools to bound the number of independent sets of graphs and hypergraphs, and they have been extremely influential in the area of extremal and probabilistic combinatorics. We will focus on more specialized…
We prove limit theorems for the greatest common divisor and the least common multiple of random integers. While the case of integers uniformly distributed on a hypercube with growing size is classical, we look at the uniform distribution on…
We obtain uniform asymptotics for polynomials orthogonal on a fixed and varying arc of the unit circle with a positive analytic weight function. We also complete the proof of the large $s$ asymptotic expansion for the Fredholm determinant…
We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…
We establish a central limit theorem for the sum of $\epsilon$-independent random variables, extending both the classical and free probability setting. Central to our approach is the use of graphon limits to characterize the limiting…
Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…
In this survey we describe a recently-developed technique for bounding the number (and controlling the typical structure) of finite objects with forbidden substructures. This technique exploits a subtle clustering phenomenon exhibited by…
Chudnovsky, Scott, Seymour and Spirkl recently proved a conjecture by Kalai and Meshulam stating that the reduced Euler characteristic of the independence complex of a graph without induced cycles of length divisible by three is in…
Many important theorems in combinatorics, such as Szemer\'edi's theorem on arithmetic progressions and the Erd\H{o}s-Stone Theorem in extremal graph theory, can be phrased as statements about independent sets in uniform hypergraphs. In…
We study the relationship between the sizes of sets $B,S$ in $\mathbb{R}^n$ where $B$ contains the $k$-skeleton of an axes-parallel cube around each point in $S$, generalizing the results of Keleti, Nagy, and Shmerkin about such sets in the…
Recent work of Bornemann has uncovered hitherto hidden integrable structures relating to the asymptotic expansion of quantities at the soft edge of Gaussian and Laguerre random matrix ensembles. These quantities are spacing distributions…
We study hyperbolic Gaussian analytic functions in the unit polydisk of $\mathbb C^n$. Following the scheme previously used in the unit ball we first study the asymptotics of fluctuations of linear statistics as the directional intensities…
We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of the results of Kahn, Galvin and Tetali, and Zhao showing…
We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence densities include a broad family of densities over graphs and relational…
In this paper we attempt a self-contained approach to infinite dimensional Hamiltonian systems appearing from holomorphic curve counting in Gromov-Witten theory. It consists of two parts. The first one is basically a survey of Dubrovin's…
We employ general parabolic recursion methods to demonstrate the recently devised hypercube formula for Kazhdan-Lusztig polynomials of $S_n$, and establish its generalization to the full setting of a finite Coxeter system through algebraic…
As part of the proof of the Bethe ansatz conjecture for the Gaudin model for $\mathfrak{gl}_n$, Mukhin, Tarasov, and Varchenko described a correspondence between inverse Wronskians of polynomials and eigenspaces of the Gaudin Hamiltonians.…
We consider the joint distribution of eigenvalue clusters of the Wigner ensemble separated by macroscopic distances (i.e., on the same scale as the difference between the edges of the semicircle law). We prove that under an averaging…