相关论文: Computational Geometry Column 32

In this paper, we prove $\text{ex}(n, C_{2k})\le (16\sqrt{5}\sqrt{k\log k} + o(1))\cdot n^{1+1/k}$. We improved on Bukh--Jiang's method used in their 2017 publication, thereby reducing the best known upper bound by a factor of $\sqrt{5\log…

The Kauffman bracket skein module $K(M)$ of a $3$-manifold $M$ is the quotient of the $\mathbb{Q}(A)$-vector space spanned by isotopy classes of links in $M$ by the Kauffman relations. A conjecture of Witten states that if $M$ is closed…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g,n) = (3,0)$ or $g + n \geq 5$, then there is an exhaustion of…

Let (X,L) be a polarized K\"ahler manifold that admits an extremal K\"ahler metric in c1(L). We show that on a nearby polarized deformation that preserves the symmetry induced by the extremal vector field of (X,L), the modified K-energy is…

A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…

Let $K$ be a number field not containing a CM subfield. For any smooth projective curve $Y/K$ of genus $\geq2$, we prove that the image of the "Selmer" part of Grothendieck's section set inside the $K_v$-rational points $Y(K_v)$ is finite…

We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

In this paper we show a a proof by explicit bijections of the famous Kirkman-Cayley formula for the number of dissections of a convex polygon. Our starting point is the bijective correspondence between the set of nested sets made by \(k\)…

Given a coloring of the k-element subsets of an uncountable separable metric space, we show that there exists an infinite monochromatic subset which contains its limit point.

We prove some results on the border of Ramsey theory (finite partition calculus) and model theory. Also a beginning of classification theory of finite models in undertaken.

This thesis establishes new quantitative records in several problems of incidence geometry and growth. After the necessary background in Chapters 1, 2 and 3, the following results are proven. Chapter 4 gives new results in the incidence…

We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…

We prove a restricted projection theorem for Borel subsets of $\mathbb{Q}_p^n$ in the regime $p>n$. This generalizes results of Gan-Guo-Wang in the real setting. Our result is effective in the sense that explicit constants are obtained for…

Dean conjectured three decades ago that every graph with minimum degree at least $k\ge 3$ contains a cycle whose length is divisible by $k$. While the conjecture has been verified for $k\in \{3,4\}$, it remains open for $k\ge 5$. A weaker…

We prove two bounds for discrete moments of Weyl sums. The first one can be obtained using a standard approach. The second one involves an observation how this method can be improved, which leads to a sharper bound in certain ranges. The…

B\'ar\'any, Katchalski and Pach proved the following quantitative form of Helly's theorem. If the intersection of a family of convex sets in $\mathbb{R}^d$ is of volume one, then the intersection of some subfamily of at most $2d$ members is…

Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…

We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…