English
Related papers

Related papers: Mystery of point charges

200 papers

We discuss several results in electrostatics: Onsager's inequality, an extension of Earnshaw's theorem, and a result stemming from the celebrated conjecture of Maxwell on the number of points of electrostatic equilibrium. Whenever possible,…

Mathematical Physics · Physics 2024-05-14 Artem Abanov , Nathan Hayford , Dmitry Khavinson , Razvan Teodorescu

Given positive integers m,n,s,t, let z(m,n,s,t) be the maximum number of ones in a (0,1) matrix of size m-by-n that does not contain an all ones submatrix of size s-by-t. We find a flexible upper bound on z(m,n,s,t) that implies the known…

Combinatorics · Mathematics 2009-04-01 Vladimir Nikiforov

A joint of a set of lines $\mathcal{L}$ in $\mathbb{F}^d$ is a point that is contained in $d$ lines with linearly independent directions. The joints problem asks for the maximum number of joints that are formed by $L$ lines. Guth and Katz…

Combinatorics · Mathematics 2023-12-25 Ting-Wei Chao , Hung-Hsun Hans Yu

One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\mathcal{P}_q(n)$ for a given minimum distance. The…

Information Theory · Computer Science 2020-11-16 Tao Feng , Sascha Kurz , Shuangqing Liu

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Combinatorics · Mathematics 2013-11-27 Pavel Kozhevnikov

We introduce a linear programming framework for obtaining upper bounds for the potential energy of spherical codes of fixed cardinality and minimum distance. Using Hermite interpolation we construct polynomials to derive corresponding…

Metric Geometry · Mathematics 2020-02-04 Peter Boyvalenkov , Peter Dragnev , Douglas Hardin , Edward Saff , Maya Stoyanova

How many points can be placed in an $n\times n$ grid so that every (affine) line contains at most $k$ points? We prove that for $n \ge k \ge 10^{37}$ the maximum number of points is exactly $kn$. Our proof builds on the recent work of…

Combinatorics · Mathematics 2025-10-21 Alexandr Grebennikov , Matthew Kwan

We prove that among all flag 3-manifolds on $n$ vertices, the join of two circles with $\left\lceil{\frac{n}{2}}\right \rceil$ and $\left\lfloor{\frac{n}{2}}\right \rfloor$ vertices respectively is the unique maximizer of the face numbers.…

Combinatorics · Mathematics 2015-12-23 Hailun Zheng

We consider a flat metric with conical singularities on the sphere. Under the assumption that no partial sum of angle defects is equal to $2\pi$, we draw on the geometry of immersed disks to obtain an explicit upper bound on the number of…

Geometric Topology · Mathematics 2026-05-07 Kai Fu , Guillaume Tahar

The 1-2-3 Conjecture, posed in 2004 by Karonski, Luczak, and Thomason, is as follows: "If G is a graph with no connected component having exactly 2 vertices, then the edges of G may be assigned weights from the set {1,2,3} so that, for any…

Combinatorics · Mathematics 2012-11-22 Ben Seamone

Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large…

Combinatorics · Mathematics 2018-08-22 Jeff Kahn , Jinyoung Park

In this article, we investigate the gyrokinetic limit for the two dimensional Vlasov-Poisson system with multi-point charges. We show that the solution converges to a measure-valued solution of the Euler equation with a defect measure,…

Analysis of PDEs · Mathematics 2024-12-20 Jingpeng Wu

We give the upper bound of differences of exponents for balanced 2-multiarrangements in terms of the cardinality of hyperplanes. Also, we give a shift isomorphism of 2-multiarrangements like Coxeter arrangements when the difference of…

Commutative Algebra · Mathematics 2010-05-31 Takuro Abe

We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.

Probability · Mathematics 2026-03-17 Pablo A. Gomes , Alan Pereira , Remy Sanchis

A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…

Computational Geometry · Computer Science 2014-10-24 Stylianos C. Despotakis , Ioannis Z. Emiris

Paul Erd\H{o}s suggested the following problem: Determine or estimate the number of maximal triangle-free graphs on $n$ vertices. Here we show that the number of maximal triangle-free graphs is at most $2^{n^2/8+o(n^2)}$, which matches the…

Combinatorics · Mathematics 2014-09-30 József Balogh , Šárka Petříčková

We prove an exponential upper bound for the number $f(m,n)$ of all maximal triangulations of the $m\times n$ grid: \[ f(m,n) < 2^{3mn}. \] In particular, this improves a result of S. Yu. Orevkov (1999).

Combinatorics · Mathematics 2007-05-23 Emile E. Anclin

In this paper we study the existence of at least two positive weak solutions for an inhomogeneous fourth order equation with Navier boundary data involving nonlinearities of critical growth with a bifurcation parameter $\lambda$ in…

Analysis of PDEs · Mathematics 2015-04-14 Abhishek Sarkar

We place bounds on the order of enhanced discrete gauge symmetries that act on massless fields and thus arise at subloci of the moduli space in supergravity theories. We focus on supersymmetric theories with 8 or more supercharges which in…

High Energy Physics - Theory · Physics 2026-04-30 Zihni Kaan Baykara , Markus Dierigl , Hee-Cheol Kim , Cumrun Vafa , Kai Xu

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

Combinatorics · Mathematics 2013-03-25 Michal Adamaszek
‹ Prev 1 8 9 10 Next ›