English
Related papers

Related papers: A quantitative improvement on the hypergraph Balog…

200 papers

We prove quasipolynomial bounds on the inverse theorem for the Gowers $U^{s+1}[N]$-norm. The proof is modeled after work of Green, Tao, and Ziegler and uses as a crucial input recent work of the first author regarding the equidistribution…

Combinatorics · Mathematics 2024-08-13 James Leng , Ashwin Sah , Mehtaab Sawhney

Recently we asymptotically resolved the long-standing Szemer\'edi and Petruska conjecture. Several decades ago Gy\'arf\'as et al. observed, via a straightforward but unpublished argument, that this conjecture is equivalent to the problem of…

Combinatorics · Mathematics 2022-04-07 André E. Kézdy , Jenő Lehel

In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz, Sutherland,…

Combinatorics · Mathematics 2024-08-21 Zoltán Füredi , Tao Jiang , Alexandr Kostochka , Dhruv Mubayi , Jacques Verstraëte

We show a general result known as the Erdos_Sos Conjecture: if $E(G)>{1/2}(k-1)n$ where $G$ has order $n$ then $G$ contains every tree of order $k+1$ as a subgraph.

Discrete Mathematics · Computer Science 2010-08-02 Jesse Gilbert

This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…

Combinatorics · Mathematics 2025-11-14 Qiming Fang , Sihong Shao

We study 4d superconformal indices for a large class of N=1 superconformal quiver gauge theories realized combinatorially as a bipartite graph or a set of "zig-zag paths" on a two-dimensional torus T^2. An exchange of loops, which we call a…

High Energy Physics - Theory · Physics 2012-06-07 Masahito Yamazaki

Suppose you are given a graph $G=(V,E)$ with a weight assignment $w:V\rightarrow\mathbb{Z}$ and that your objective is to modify $w$ using legal steps such that all vertices will have the same weight, where in each legal step you are…

Discrete Mathematics · Computer Science 2015-07-03 Friedrich Eisenbrand , Shay Moran , Rom Pinchasi , Martin Skutella

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

Logic · Mathematics 2025-07-14 Jana Maříková

We prove an existence theorem for jet differentials on complete intersection varieties that generalizes a theorem of S. Diverio. We also show that one can readily deduce hyperbolicity for generic complete intersections of high multidegree…

Algebraic Geometry · Mathematics 2010-10-18 Damian Brotbek

In this paper, we consider a generalized strong vector quasi-equilibrium problem and we prove the existence of its solutions by using some suxiliary results. One of the established theorems is proved by using an approximation method.

Optimization and Control · Mathematics 2016-05-11 Monica Patriche

An orthogonal representation of a graph is an assignment of nonzero real vectors to its vertices such that distinct non-adjacent vertices are assigned to orthogonal vectors. We prove general lower bounds on the dimension of orthogonal…

Combinatorics · Mathematics 2018-11-29 Ishay Haviv

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Dynamical Systems · Mathematics 2023-08-29 Anush Tserunyan

We give an analytic version of the injectivity theorem by using multiplier ideal sheaves, and prove some extension theorems for the adjoint bundle of dlt pairs. Moreover, by combining techniques of the minimal model program, we obtain some…

Algebraic Geometry · Mathematics 2014-07-30 Yoshinori Gongyo , Shin-ichi Matsumura

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

General Topology · Mathematics 2009-10-20 Yevgen Polulyakh , Iryna Yurchuk

We prove a Szemer\'edi-Trotter type theorem and a sum-product estimate in the setting of finite quasifields. These estimates generalize results of the fourth author, of Garaev, and of Vu. We generalize results of Gyarmati and S\'ark\"ozy on…

Number Theory · Mathematics 2016-10-20 Thang Pham , Michael Tait , Craig Timmons , Le Anh Vinh

We prove a {\Gamma}-equivariant version of the algebraic index theorem, where {\Gamma} is a discrete group of automorphisms of a formal deformation of a symplectic manifold. The particular cases of this result are the algebraic version of…

K-Theory and Homology · Mathematics 2021-07-01 Alexander Gorokhovsky , Niek de Kleijn , Ryszard Nest

A famous result by R\"odl, Ruci\'nski, and Szemer\'edi guarantees a (tight) Hamilton cycle in $k$-uniform hypergraphs $H$ on $n$ vertices with minimum $(k-1)$-degree $\delta_{k-1}(H)\geq (1/2+o(1))n$, thereby extending Dirac's result from…

Combinatorics · Mathematics 2021-04-14 Felix Joos , Marcus Kühn , Bjarne Schülke

In this paper we extend some results obtained by Artamonov and Sabitov for quantum polynomials to skew quantum polynomials and quasi-commutative bijective skew PBW extensions. Moreover, we find a counterexample to the conjecture proposed in…

Rings and Algebras · Mathematics 2014-07-29 Cristian Arturo Chaparro Acosta

The purpose of this paper is to revisit the proof of the Gearhardt-Pr\"uss-Hwang-Greiner theorem for a semigroup $S(t)$, following the general idea of the proofs that we have seen in the literature and to get an explicit estimate on $\Vert…

Optimization and Control · Mathematics 2021-03-12 Bernard Helffer , Johannes Sjöstrand

We give a new proof of K\"onig's theorem and generalize the Gallai-Edmonds decomposition to balanced hypergraphs in two different ways. Based on our decompositions we give two new characterizations of balanced hypergraphs and show some…

Combinatorics · Mathematics 2009-10-23 Robert Scheidweiler , Eberhard Triesch