7,212 research outputs found
Hypergraph Lagrangians I: the Frankl-F\"uredi conjecture is false
An old and well-known conjecture of Frankl and F\"{u}redi states that the
Lagrangian of an -uniform hypergraph with edges is maximised by an
initial segment of colex. In this paper we disprove this conjecture by finding
an infinite family of counterexamples for all . We also show that, for
sufficiently large , the conjecture is true in the range
.Comment: We split our original paper (arXiv:1807.00793v2) into two parts. This
first part consists of 24 pages, including a one-page appendix. The second
part appears in a new submission (arXiv:1907.09797
Perturbation theory of transformed quantum fields
We consider a scalar quantum field with arbitrary polynomial
self-interaction in perturbation theory. If the field variable is
repaced by a local diffeomorphism ,
this field obtains infinitely many additional interaction vertices. We
show that the -matrix of coincides with the one of without
using path-integral arguments. This result holds even if the underlying field
has a propagator of higher than quadratic order in the momentum. If tadpole
diagrams vanish, the diffeomorphism can be tuned to cancel all contributions of
an underlying -type self interaction at one fixed external offshell
momentum, rendering a free theory at this momentum. Finally, we propose
one way to extend the diffeomorphism to a non-local transformation involving
derivatives without spoiling the combinatoric structure of the local
diffeomorphism.Comment: 28 pages, 9 figure
Strong Jumps and Lagrangians of Non-Uniform Hypergraphs
The hypergraph jump problem and the study of Lagrangians of uniform
hypergraphs are two classical areas of study in the extremal graph theory. In
this paper, we refine the concept of jumps to strong jumps and consider the
analogous problems over non-uniform hypergraphs. Strong jumps have rich
topological and algebraic structures. The non-strong-jump values are precisely
the densities of the hereditary properties, which include the Tur\'an densities
of families of hypergraphs as special cases. Our method uses a generalized
Lagrangian for non-uniform hypergraphs. We also classify all strong jump values
for -hypergraphs.Comment: 19 page
- …