English
Related papers

Related papers: A recursive theta body for hypergraphs

200 papers

Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which extend the result of [S.M. Cioab\u{a},…

Combinatorics · Mathematics 2015-12-01 Jiang Zhou , Lizhu Sun , Changjiang Bu

Mimicking the idea of the generalized Hamming weight of linear codes, we introduce a new lattice invariant, the generalized theta series. Applications range from identifying stable lattices to the lattice isomorphism problem. Moreover, we…

Information Theory · Computer Science 2025-07-31 Maiara F. Bollauf , Hsuan-Yin Lin

We develop a new technique for computing higher limits of functors over filtered posets by constructing explicit fibrant replacements within a suitable model category structure. We apply this procedure to develop two systematic vanishing…

Algebraic Topology · Mathematics 2026-05-26 Guille Carrión Santiago

By Lovasz' proof of the Kneser conjecture, the chromatic number of a graph G is bounded from below by the index of the Z_2-space Hom(K_2,G) plus two. We show that the cohomological index of Hom(K_2,G) is also greater than the cohomological…

Combinatorics · Mathematics 2007-05-23 Carsten Schultz

Let $\mathcal{C}(S_{g,p})$ denote the curve complex of the closed orientable surface of genus $g$ with $p$ punctures. Masur-Minksy and subsequently Bowditch showed that $\mathcal{C}(S_{g,p})$ is $\delta$-hyperbolic for some…

Geometric Topology · Mathematics 2012-12-18 Tarik Aougab

For two graphs $F$ and $H$, the relative Tur\'{a}n number $\mathrm{ex}(H,F)$ is the maximum number of edges in an $F$-free subgraph of $H$. Foucaud, Krivelevich, and Perarnau \cite{FKP} and Perarnau and Reed \cite{PR} studied these…

Combinatorics · Mathematics 2021-06-18 Sam Spiro , Jacques Verstraëte

The reciprocal theorems of Maxwell and Betti are foundational in mechanics but have so far been restricted to infinitesimal deformations in elastic bodies. In this manuscript, we present a reciprocal theorem that relates solutions of a…

Soft Condensed Matter · Physics 2022-03-15 Thomas Henzel , Chockalingam Senthilnathan , Tal Cohen

Let $k\ge 1$ be an odd integer, $t=\lfloor {{k+2}\over 4}\rfloor$, and $q$ be a prime power. We construct a bipartite, $q$-regular, edge-transitive graph $C\!D(k,q)$ of order $v \le 2q^{k-t+1}$ and girth $g \ge k+5$. If $e$ is the the…

Combinatorics · Mathematics 2016-09-06 Felix Lazebnik , Vasiliy A. Ustimenko , Andrew J. Woldar

We show that Hoffman's sum of eigenvalues bound for the chromatic number is at least as good as the Lov\'asz theta number, but no better than the ceiling of the fractional chromatic number. In order to do so, we display an interesting…

Combinatorics · Mathematics 2021-12-08 Marcel K. de Carli Silva , Gabriel Coutinho , Rafael Grandsire

The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper…

Combinatorics · Mathematics 2014-07-08 Andrei Gagarin , Vadim Zverovich

The first author together with Jenssen, Perkins and Roberts (2017) recently showed how local properties of the hard-core model on triangle-free graphs guarantee the existence of large independent sets, of size matching the best-known…

Combinatorics · Mathematics 2020-04-01 Ewan Davies , Ross J. Kang , François Pirot , Jean-Sébastien Sereni

The purpose of this paper is to introduce and study some basic concepts of quantitative rectifiability in the first Heisenberg group $\mathbb{H}$. In particular, we aim to demonstrate that new phenomena arise compared to the Euclidean…

Classical Analysis and ODEs · Mathematics 2018-04-12 Vasileios Chousionis , Katrin Fässler , Tuomas Orponen

Mantel's theorem is a classical result in extremal graph theory which implies that the maximum number of edges of a triangle-free graph of order $n$. In 1970, E. Nosal obtained a spectral version of Mantel's theorem which gave the maximum…

Combinatorics · Mathematics 2023-01-18 Chunmeng Liu , Changjiang Bu

For each uniformity $k \geq 3$, we construct $k$-uniform linear hypergraphs $G$ with arbitrarily large maximum degree $\Delta$ whose independence polynomial $Z_G$ has a root $\lambda$ with $\lvert\lambda\rvert = O\left(\frac{\log…

Combinatorics · Mathematics 2025-07-02 Shengtong Zhang

In the past two decades, various properties of randomly perturbed/augmented (hyper)graphs have been intensively studied, since the model was introduced by Bohman, Frieze and Martin in 2003. The model usually considers a deterministic graph…

Combinatorics · Mathematics 2025-08-26 Jie Han , Seonghyuk Im , Bin Wang , Junxue Zhang

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…

Differential Geometry · Mathematics 2022-10-04 Bobo Hua , Florentin Münch

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

Combinatorics · Mathematics 2015-01-30 Christine Bachoc , Alberto Passuello , Alain Thiery

By adapting the work of Kudla and Millson we obtain a lifting of cuspidal cohomology classes for the symmetric space associated to GO(V) for an indefinite rational quadratic space V of even dimension to holomorphic Siegel modular forms on…

Number Theory · Mathematics 2009-02-27 Tobias Berger

In a recent breakthrough, Kelley and Meka (FOCS 2023) obtained a strong upper bound on the density of sets of integers without nontrivial three-term arithmetic progressions. In this work, we extend their result, establishing similar bounds…

Combinatorics · Mathematics 2025-02-13 Yuval Filmus , Hamed Hatami , Kaave Hosseini , Esty Kelman

In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on $[n]=\{1,2,\ldots,n\}$ with $m$ edges, whenever $n\to\infty$ and $n-1\le m=m(n)\le \binom{n}{2}$. We give an asymptotic formula for the…

Combinatorics · Mathematics 2018-11-05 Béla Bollobás , Oliver Riordan