Related papers: A K3 in phi4

Let $D_2$ denote the $3$-uniform hypergraph with $4$ vertices and $2$ edges. Answering a question of Alon and Shapira, we prove an induced removal lemma for $D_2$ having polynomial bounds. We also prove an Erd\H{o}s-Hajnal-type result:…

We investigate combinatorial properties of a graph polynomial indexed by half-edges of a graph which was introduced recently to understand the connection between Feynman rules for scalar field theory and Feynman rules for gauge theory. We…

Let $\alpha:\mathbb{F}_q\to\mathbb{F}_q$ be a permutation and $\Psi(\alpha)$ be the number of collinear triples in the graph of $\alpha$, where $\mathbb{F}_q$ denotes a finite field of $q$ elements. When $q$ is odd Cooper and Solymosi once…

We give a coalgebra structure on 1-vertex irreducible graphs which is that of a cocommutative coassociative graded connected coalgebra. We generalize the coproduct to the algebraic representation of graphs so as to express a bare 1-particle…

One of the major problems in combinatorics is to determine the number of $r$-uniform hypergraphs ($r$-graphs) on $n$ vertices which are free of certain forbidden structures. This problem dates back to the work of Erd\H{o}s, Kleitman and…

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

Gromov and Piatetski-Shapiro proved existence of finite volume non-arithmetic hyperbolic manifolds of any given dimension. In dimension four and higher, we show that there are about v^v such manifolds of volume at most v, considered up to…

Kontsevich introduced certain ribbon graphs as cell decompositions for combinatorial models of moduli spaces of complex curves with boundaries in his proof of Witten's conjecture. In this work, we define four types of generalised Kontsevich…

We give tight upper and lower bounds on the internal energy per particle in the antiferromagnetic $q$-state Potts model on $4$-regular graphs, for $q\ge 5$. This proves the first case of a conjecture of the author, Perkins, Jenssen, and…

George Birkhoff proved in 1912 that the number of proper colorings of a finite graph G with n colors is a polynomial in n, called the chromatic polynomial of G. Read conjectured in 1968 that for any graph G, the sequence of absolute values…

We consider a realization of the real Grassmann manifold Gr(k,n) based on a particular flow defined by the corresponding (singular) solution of the KP equation. Then we show that the KP flow can provide an explicit and simple construction…

For a hypergraphic polytope there is a weighted quasisymmetric function which enumerates positive integer points in its normal fan and determines its f-polynomial. This quasisymmetric function invariant of hypergraphs extends the Stanley…

We prove an effective version of the Shafarevich conjecture (as proven by Faltings) for smooth quartic curves. To do so, we establish an effective version of Scholl's finiteness result for smooth del Pezzo surfaces of degree at most four.

It is proved that the associative differential graded algebra of (polynomial) polyvector fields on a vector space (may be infinite- dimensional) is quasi-isomorphic to the corresponding cohomological Hochschild complex of (polynomial)…

To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…

The aim of this paper is to prove a uniform Fourier restriction estimate for certain $2-$dimensional surfaces in $\mathbb R^{2n}$. These surfaces are the image of complex polynomial curves $\gamma(z) = (p_1(z), \dots, p_n(z))$, equipped…

Information about the number of Feynman graphs for a given physical process in a given field theory is especially useful for confirming the result of a Feynman graph generator used in an automatic system of perturbative calculations. A…

Let $G = (V,E)$ be a finite, simple, connected graph with chromatic polynomial $P_G(q)$. Sokal \cite{sokal} proved that the roots of the chromatic polynomial of $G$ are bounded in absolute value by $KD$ where, $D$ is the maximum degree of…

Folkman's theorem asserts the existence of graphs $G$ which are $K_4$-free, but which have the property that every two-coloring of $E(G)$ contains a monochromatic triangle. The quantitative aspects of $f(2,3,4)$, the least $n$ such that…

In the 1950's, English painter Anthony Hill described drawings of complete graphs $K_n$ in the plane having precisely $$H(n) = \tfrac{1}{4}\lfloor \tfrac{n}{2}\rfloor \, \lfloor \tfrac{n-1}{2}\rfloor \, \lfloor \tfrac{n-2}{2}\rfloor…