English
Related papers

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

200 papers

We show a Riemann-Roch theorem for group ring bundles over an arithmetic surface; this is expressed using the higher adeles of Beilinson-Parshin and the tame symbol via a theory of adelic equivariant Chow groups and Chern classes. The…

Algebraic Geometry · Mathematics 2015-03-31 T. Chinburg , G. Pappas , M. J. Taylor

We prove that the number of directions contained in a set of the form $A \times B \subset AG(2,p)$, where $p$ is prime, is at least $|A||B| - \min\{|A|,|B|\} + 2$. Here $A$ and $B$ are subsets of $GF(p)$ each with at least two elements and…

Combinatorics · Mathematics 2020-06-25 Daniel Di Benedetto , Jozsef Solymosi , Ethan P. White

We investigate the \textit{group irregularity strength}, $s_g(G)$, of a graph, i.e. the least integer $k$ such that taking any Abelian group $\mathcal{G}$ of order $k$, there exists a function $f:E(G)\rightarrow \mathcal{G}$ so that the…

Combinatorics · Mathematics 2018-10-16 Marcin Anholcer , Sylwia Cichacz , Jakub Przybyło

According to the Erd\H{o}s-Szekeres theorem, for every $n$, a sufficiently large set of points in general position in the plane contains $n$ in convex position. In this note we investigate the line version of this result, that is, we want…

Metric Geometry · Mathematics 2015-04-20 Imre Bárány , Edgardo Roldán-Pensado , Géza Tóth

We upper bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from…

Information Theory · Computer Science 2017-07-06 Olav Geil , Umberto Martínez-Peñas

We give bounds for exponential sums over curves defined over Galois rings. We first define summation subsets as the images of lifts of points from affine opens of the reduced curve, and we give bounds for the degrees of their coordinate…

Number Theory · Mathematics 2007-05-23 Regis Blache

We develop and prove the analogs of some results shown in [Berenstein A., Fomin S., Zelevinsky A., Duke Math. J. 126 (2005), 1-52] concerning lower and upper bounds of cluster algebras to the generalized cluster algebras of geometric type.…

Rings and Algebras · Mathematics 2020-09-29 Liqian Bai , Xueqing Chen , Ming Ding , Fan Xu

We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…

Geometric Topology · Mathematics 2020-07-08 Mahan Mj

In this paper, we give strong lower bounds on the size of the sets of products of matrices in some certain groups. More precisely, we prove an analogue of a result due to Chapman and Iosevich for matrices in $SL_2(\mathbb{F}_p)$ with…

Number Theory · Mathematics 2018-03-29 Doowon Koh , Thang Pham , Chun-Yen Shen , Le Anh Vinh

We prove new incidence bounds between a plane point set, which is a Cartesian product, and a set of translates $H$ of the hyperbola $xy=\lambda\neq 0$, over a field of asymptotically large positive characteristic $p$. They improve recent…

Combinatorics · Mathematics 2021-04-22 Misha Rudnev , James Wheeler

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

Combinatorics · Mathematics 2019-07-19 Guy Moshkovitz , Asaf Shapira

We look at upper bounds for the count of certain primes related to the Fermat numbers $F_n=2^{2^n}+1$ called elite primes. We first note an oversight in a result of Krizek, Luca and Somer and give the corrected, slightly weaker upper bound.…

Number Theory · Mathematics 2021-02-02 Matthew Just

We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…

Algebraic Topology · Mathematics 2020-07-13 Richard Hepworth

We describe the Zariski-closure of sets of torsion points in connected algebraic groups. This is a generalization of the Manin-Mumford conjecture for commutative algebraic groups proved by Hindry. He proved that every subset with…

Number Theory · Mathematics 2023-05-18 Harry Schmidt , Immanuel van Santen

We prove an explicit surjectivity result for products of non-isotrivial, non-isogenous elliptic curves over a function field of arbitrary characteristic. This is by way of an isogeny degree bound in this setting, generated from bounds for…

Number Theory · Mathematics 2025-11-06 Alina Cojocaru , Frederick Saia

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Combinatorics · Mathematics 2008-06-23 Jozsef Solymosi

We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…

Commutative Algebra · Mathematics 2023-10-17 Shalom Eliahou , Eshita Mazumdar

We study several problems concerning convex polygons whose vertices lie in a Cartesian product of two sets of $n$ real numbers (for short, \emph{grid}). First, we prove that every such grid contains $\Omega(\log n)$ points in convex…

Computational Geometry · Computer Science 2021-10-05 Jean-Lou De Carufel , Adrian Dumitrescu , Wouter Meulemans , Tim Ophelders , Claire Pennarun , Csaba D Tóth , Sander Verdonschot

We prove that bounded conciseness is a closed property in the space of marked groups. As a consequence, we reformulate a conjecture of Fern\'andez-Alcober and Shumyatsky [7] about conciseness in the class of residually finite groups.

Group Theory · Mathematics 2025-02-10 Federico Berlai

We establish upper and lower bounds for the 2-limited broadcast domination number of various grid graphs, in particular the Cartesian product of two paths, a path and a cycle, and two cycles. The upper bounds are derived by explicit…

Combinatorics · Mathematics 2023-06-21 Aaron Slobodin , Gary MacGillivray , Wendy Myrvold
‹ Prev 1 3 4 5 6 7 10 Next ›