Related papers: Mystery of point charges

Settling Kahn's conjecture (2001), we prove the following upper bound on the number $i(G)$ of independent sets in a graph $G$ without isolated vertices: \[ i(G) \le \prod_{uv \in E(G)} i(K_{d_u,d_v})^{1/(d_u d_v)}, \] where $d_u$ is the…

For fixed $k\ge 2$, determining the order of magnitude of the number of edges in an $n$-vertex bipartite graph not containing $C_{2k}$, the cycle of length $2k$, is a long-standing open problem. We consider an extension of this problem to…

One of the earliest results in extremal graph theory, Mantel's theorem, states that the maximum number of edges in a triangle-free graph $G$ on $n$ vertices is $\lfloor n^2/4 \rfloor$. We investigate how this extremal bound is affected when…

We prove that among all flag homology $5$-manifolds with $n$ vertices, the join of $3$ circles of as equal length as possible is the unique maximizer of all the face numbers. The same upper bounds on the face numbers hold for…

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…

Lower bounds on the proof-theoretic strength of the graph minor theorem were found over 30 years ago by Friedman, Robertson and Seymour 1987, but upper bounds have always been elusive. We present recently found upper bounds on the graph…

In this paper, we study the well-posedness of Poisson-Nernst-Planck system with no-flux boundary condition and singular permanent charges in two dimension. The main difficulty comes from the lack of integrability of singular permanent…

In an earlier paper \cite{yu2021Finiteness}, we showed that there are finitely many stationary configurations (consisting of equilibria, rigidly translating configurations, relative equilibria and collapse configurations) in the planar…

The inertia bound gives an upper bound on the independence number of a graph by considering the inertia of matrices corresponding to the graph. The bound is known to be tight for graphs on 10 or fewer vertices as well as for all perfect…

We prove an upper bound of the form $2^{O(d^2 \mathrm{polylog}\,d)}$ on the number of affine (resp. linear) equivalence classes of, by increasing order of generality, 2-level d-polytopes, d-cones and d-configurations. This in particular…

The existence and multiplicity and nonexistence of nontrivial radial convex solutions of systems of Monge-Amp\`ere equations are established with superlinearity or sublinearity assumptions for an appropriately chosen parameter. The proof of…

In this paper, we study the maximum number of edges in an $N$-vertex $r$-uniform hypergraph with girth $g$ where $g \in \{5,6 \}$. Writing $\textrm{ex}_r ( N, \mathcal{C}_{<g} )$ for this maximum, it is shown that $\textrm{ex}_r ( N ,…

We show that the number of integer solutions for a pair of bilinear equations in at least 2*6 variables has (up to logarithms) the expected upper bound unless there is a structural reason why it is not the case.

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

This first extracted report contains all lower and upper bounds for e-numbers $e(3,k;n)$, for $n \leq 43$, that I know. All but 24 of them are known (exactly).Very little of the proofs is given. A few consequences for upper classical Ramsey…

In this note we investigate the asymptotic behavior of the number of maximum modulus points, of an entire function, sitting in a disc of radius $r$. In 1964, Erd\Humlaut{o}s asked whether there exists a non-monomial function so that this…

Band structure for a crystal generally consists of connected components in energy-momentum space, known as band complexes. Here, we explore a fundamental aspect regarding the maximal number of bands that can be accommodated in a single band…

We determine all Chern numbers of smooth complex projective varieties of dimension at least four which are determined up to finite ambiguity by the underlying smooth manifold. We also give an upper bound on the dimension of the space of…

We obtain estimates for the nonlinear variational capacity of annuli in weighted R^n and in metric spaces. We introduce four different (pointwise) exponent sets, show that they all play fundamental roles for capacity estimates, and also…

We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…