English
Related papers

Related papers: On higher dimensional point sets in general positi…

200 papers

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Combinatorics · Mathematics 2025-05-30 Rajko Nenadov , Lander Verlinde

We sharpen and generalize the dimension growth bounds for the number of points of bounded height lying on an irreducible algebraic variety of degree $d$, over any global field. In particular, we focus on the affine hypersurface situation by…

Number Theory · Mathematics 2025-12-05 Raf Cluckers , Pierre Dèbes , Yotam I. Hendel , Kien Huu Nguyen , Floris Vermeulen

Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma,d)$. Let $\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\square_n,d)$…

Combinatorics · Mathematics 2018-01-23 Lihang Hou , Bo Hou , Suogang Gao , Wei-Hsuan Yu

The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case…

Combinatorics · Mathematics 2025-08-12 Benedek Kovács , Zoltán Lóránt Nagy , Dávid R. Szabó

We give a generalization to higher dimensions of Silverman's result on finiteness of integer points in orbits. Assuming Vojta's conjecture, we prove a sufficient condition for morphisms on P^N so that (S,D)-integral points in each orbit are…

Number Theory · Mathematics 2015-01-16 Yu Yasufuku

In this paper, motivated by the work of Edelman and Strang, we show that for fixed integers $d\geq 2$ and $n\geq d+1$ the configuration space of all facet volume vectors of all $d$-polytopes in $\mathbb R^{d}$ with $n$ facets is a full…

Combinatorics · Mathematics 2021-12-17 Pavle V. M. Blagojević , Paul Breiding , Alexander Heaton

Let $k\ge 3$ be an odd integer and let $n$ be a sufficiently large integer. We prove that the maximum number of edges in an $n$-vertex $k$-uniform hypergraph containing no $2$-regular subgraphs is $\binom{n-1}{k-1} + \lfloor\frac{n-1}{k}…

Combinatorics · Mathematics 2018-01-24 Jie Han , Jaehoon Kim

A vector $(v_{1}, v_{2}, \cdots, v_{d})$ in $\mathbb{Z}_n^{d}$ is said to be a zero-sum-free $d$-tuple if there is no non-empty subset of its components whose sum is zero in $\mathbb{Z}_n$. We denote the cardinality of this collection by…

Number Theory · Mathematics 2022-01-06 Sunil K. Chebolu , Papa A. Sissokho

Let $d\geq 2$ be a positive integer, $K$ an algebraically closed field of characteristic not dividing $d$, $n\geq d+1$ a positive integer that is prime to $d$, $f(x)\in K[x]$ a degree $n$ monic polynomial without multiple roots, $C_{f,d}:…

Algebraic Geometry · Mathematics 2025-05-14 Boris M. Bekker , Yuri G. Zarhin

Let $\mathbb K$ be a field of characteristic 0. Let $\Gamma\subset\mathbb P^n_{\mathbb K}$ be a reduced finite set of points, not all contained in a hyperplane. Let $hyp(\Gamma)$ be the maximum number of points of $\Gamma$ contained in any…

Commutative Algebra · Mathematics 2012-03-12 Stefan O. Tohaneanu

Let $C\subset{\mathbb P}_K^2$ be an algebraic curve over a number field $K$, and denote by $d_K$ the degree of $K$ over ${\mathbb Q}$. We prove that the number of $K$-rational points of height at most $H$ in $C$ is bounded by $c…

Number Theory · Mathematics 2024-11-19 Gal Binyamini , Raf Cluckers , Fumiharu Kato

Let $A$ be a subset of positive relative upper density of $\PP^d$, the $d$-tuples of primes. We prove that $A$ contains an affine copy of any finite set $F\subs\Z^d$, which provides a natural multi-dimensional extension of the theorem of…

Number Theory · Mathematics 2023-09-12 Brian Cook , Ákos Magyar , Tatchai Titichetrakun

A set $A$ of nonnegative integers is called a Sidon set if there is no Sidon 4-tuple, i.e., $(a,b,c,d)$ in $A$ with $a+b=c+d$ and $\{a, b\}\cap \{c, d\}=\emptyset$. Cameron and Erd\H os proposed the problem of determining the number of…

Combinatorics · Mathematics 2018-03-05 József Balogh , Lina Li

We prove that the the discrepancy of arithmetic progressions in the $d$-dimensional grid $\{1, \dots, N\}^d$ is within a constant factor depending only on $d$ of $N^{\frac{d}{2d+2}}$. This extends the case $d=1$, which is a celebrated…

Combinatorics · Mathematics 2021-11-01 Jacob Fox , Max Wenqiang Xu , Yunkun Zhou

In this paper, we prove the following two results. Let $d$ be a natural number and $q,s$ be co-prime integers such that $1 < qs$. Then there exists a constant $\delta > 0$ depending only on $q,s$ and $d$ such that for any finite subset $A$…

Combinatorics · Mathematics 2019-05-28 Akshat Mudgal

A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…

Combinatorics · Mathematics 2026-02-24 Peter Frankl , Hongliang Lu , Jie Ma , Yuze Wu

We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…

Combinatorics · Mathematics 2024-04-30 Alfredo Hubard , Pablo Soberón

Let $A$ be a subvariety of affine space $\mathbb{A}^n$ whose irreducible components are $d$-dimensional linear or affine subspaces of $\mathbb{A}^n$. Denote by $D(A)\subset\mathbb{N}^n$ the set of exponents of standard monomials of $A$. We…

Commutative Algebra · Mathematics 2008-10-13 Mathias Lederer

A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…

Computational Geometry · Computer Science 2017-03-03 Erik D. Demaine , Andre Schulz

We study the maximum size of a subset of the $n \times n$ integer grid that does not contain specific geometric configurations, a variation of the classical problems initiated by Erd\H{o}s and Purdy. While extremal problems for 3-point…

Combinatorics · Mathematics 2026-02-23 Máté Jánosik , Artúr Nádor , Zoltán Lóránt Nagy , László Bence Simon