Related papers: Upper and lower bounds for rich lines in grids

Throttling in graphs optimizes a sum or product of resources used, such as the number of vertices in an initial set, and time required, such as the propagation time, to complete a given task. We introduce a new technique to establish sharp…

We explicitly bound the Faltings height of a curve over Q polynomially in its Belyi degree. Similar bounds are proven for three other Arakelov invariants: the discriminant, Faltings' delta invariant and the self-intersection of the…

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…

A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.

We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann.…

This is an expository account of the proof of the theorem of Bourgain, Glibichuk and Konyagin which provides non-trivial bounds for exponential sums over very small multiplicative subgroups of prime finite fields.

We prove an effective upper bound on the number of effective sections of a hermitian line bundle over an arithmetic surface. It is an effective version of the arithmetic Hilbert--Samuel formula in the nef case. As a consequence, we obtain…

It is known that the number of directions formed by a Cartesian product $A \times B \subset AG(2,p)$ is at least $|A||B| - \min\{|A|,|B|\} + 2$, provided $p$ is prime and $|A||B|<p$. This implies the best known upper bound on the clique…

We establish new upper bounds for the height of the S-integral points of an elliptic curve. This bound is explicitly given in terms of the set S of places of the number field K involved, but also in terms of the degree of K, as well as the…

Finding upper bounds for character ratios is a fundamental problem in asymptotic group theory. Previous bounds in the symmetric group have led to remarkable applications in unexpected domains. The existing approaches predominantly relied on…

In this note, we give explicit expressions of Gauss sums for general (resp. special) linear groups over finite fields, which involves Gauss sums (resp. Kloosterman sums). The key ingredient is averaging such sums over Borel subgroups. As…

In this short note, we establish an edge-isoperimetric inequality for arbitrary product graphs. Our inequality is sharp for subsets of many different sizes in every product graph. In particular, it implies that the $2^d$-element sets with…

Let $X \hookrightarrow \mathbb{P}^r$ be a smooth projective variety defined by homogeneous polynomials of degree $\leq d$. We give explicit upper bounds on the order of the torsion subgroup $(\mathrm{NS} \, X)_{\mathrm{tor}}$ of the…

We prove two theorems concerning extreme values of general Gaussian fields. Our first theorem concerns with the concept of multiple peaks. A theorem of Chatterjee states that when a centered Gaussian field admits the so-called…

In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…

By using the $\mathbb R$-filtration approach of Arakelov geometry, one establishes explicit upper bounds for geometric and arithmetic Hilbert-Samuel function for line bundles on projective varieties and hermitian line bundles on arithmetic…

We generalize to sets with cardinality more than $p$ a theorem of R\'edei and Sz\H{o}nyi on the number of directions determined by a subset $U$ of the finite plane $\mathbb F_p^2$. A $U$-rich line is a line that meets $U$ in at least…

The Witten index for certain supersymmetric lattice models treated by de Boer, van Eerten, Fendley, and Schoutens, can be formulated as a topological invariant of simplicial complexes arising as independence complexes of graphs. We prove a…

In this paper,based on the available mathematical works on geometry and topology of hyperbolic manifolds and discrete groups, some results of Freedman et al (hep-th/9804058) are reproduced and broadly generalized. Among many new results the…

Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…