English
Related papers

Related papers: Maximal line-free sets in $\mathbb{F}_p^n$

200 papers

We show that the maximum number of triples on $n$~points, if no three triples span at most five points, is $(1\pm o(1))n^2/5$. More generally, let $f^{(r)}(n;k,s)$ be the maximum number of edges of an $r$-uniform hypergraph on $n$~vertices…

Combinatorics · Mathematics 2018-12-05 Stefan Glock

A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…

Optimization and Control · Mathematics 2011-03-28 Gennadiy Averkov , Christian Wagner , Robert Weismantel

In this paper we construct infinitely many examples of toric Fano varieties with Picard number three, which do not admit full exceptional collections of line bundles. In particular, this disproves King's conjecture for toric Fano varieties.…

Algebraic Geometry · Mathematics 2025-02-07 Alexander I. Efimov

We prove that the maximum size of a family of $k$-element subsets of the set $[n] = \{1, 2, \ldots, n\}$ which contains no singleton intersection is $\binom{n-2}{k-2}$ when $3k-3 \le n \le k^2-k+1$. This improves upon a recent result of…

Combinatorics · Mathematics 2026-04-02 William Linz

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

We provide a general framework to exclude parameterized running times of the form $O(\ell^\beta+ n^\gamma)$ for problems that have polynomial running time lower bounds under hypotheses from fine-grained complexity. Our framework is based on…

Data Structures and Algorithms · Computer Science 2023-01-09 Klaus Heeger , André Nichterlein , Rolf Niedermeier

Given a finite family F of linear forms with integer coefficients, and a compact abelian group G, an F-free set in G is a measurable set which does not contain solutions to any equation L(x)=0 for L in F. We denote by d_F(G) the supremum of…

Combinatorics · Mathematics 2011-09-15 Pablo Candela , Olof Sisask

We describe a new construction of a subset of P^4 with no four points on a plane over any finite field of order q in which 3 is not a square. This set has size 2q + 1, is maximal with respect to inclusion, and is the largest known such set.

Combinatorics · Mathematics 2025-11-10 Geertrui Van de Voorde , José Felipe Voloch

For a family ${\mathcal F}$ of $r$-graphs, let $\mathrm{ex}(n,{\mathcal F})$ denote the maximum number of edges in an ${\mathcal F}$-free $r$-graph on $n$ vertices. Let ${\mathcal F}_r(v,e)$ denote the family of all $r$-graphs with $e$…

Combinatorics · Mathematics 2019-12-17 Alexander Sidorenko

In this paper we study almost $p$-ary sequences and their autocorrelation coefficients. We first study the number $\ell$ of distinct out-of-phase autocorrelation coefficients for an almost $p$-ary sequence of period $n+s$ with $s$…

Combinatorics · Mathematics 2018-12-24 Büşra Özden , Oğuz Yayla

In this paper, we are interested in a generalization of the notion of sum-free sets. We address a conjecture first made in the 90s by Chung and Goldwasser. Recently, after some computer checks, this conjecture was formulated again by…

Combinatorics · Mathematics 2013-02-19 Alain Plagne , Anne de Roton

Let $r_5(N)$ be the largest cardinality of a set in $\{1,\ldots,N\}$ which does not contain $5$ elements in arithmetic progression. Then there exists a constant $c\in (0,1)$ such that \[r_5(N)\ll \frac{N}{\exp((\log\log N)^{c})}.\] Our work…

Number Theory · Mathematics 2024-04-11 James Leng , Ashwin Sah , Mehtaab Sawhney

Consider a family $\mathcal{F}$ of $k$-subsets of an ambient $(k^2-k+1)$-set such that no pair of $k$-subsets in $\mathcal{F}$ intersects in exactly one element. In this short note we show that the maximal size of such $\mathcal{F}$ is…

Combinatorics · Mathematics 2024-08-02 Danila Cherkashin

This article derives lower bounds on the supremal (strict) p-negative type of finite metric spaces using purely elementary techniques. The bounds depend only on the cardinality and the (scaled) diameter of the underlying finite metric…

Functional Analysis · Mathematics 2008-07-18 Anthony Weston

We obtain sharp upper and lower bounds on a certain four-dimensional Frobenius number determined by a prime pair $(p,q)$, $2<p<q$, including exact formulae for two infinite subclasses of such pairs. Our work is motivated by the study of…

Number Theory · Mathematics 2012-02-14 Cormac O'Sullivan , Anthony Weaver

Let $n\geqslant 3$ be a natural number. We study the problem to find the smallest $r$ such that there is a family $\mathcal{A}$ of 2-subsets and 3-subsets of $[n]=\{1,2,...,n\}$ with the following properties: (1) $\mathcal{A}$ is an…

Combinatorics · Mathematics 2015-12-15 Thomas Kalinowski , Uwe Leck , Christian Reiher , Ian T. Roberts

Let $k$ be a number field and $B$ be a central simple algebra over $k$ of dimension $p^2$ where $p$ is prime. In the case that $p=2$ we assume that $B$ is not totally definite. In this paper we study sets of pairwise nonisomorphic maximal…

Number Theory · Mathematics 2014-09-04 Benjamin Linowitz

A subset $S$ of an abelian group $G$ is called $3$-$\mathrm{AP}$ free if it does not contain a three term arithmetic progression. Moreover, $S$ is called complete $3$-$\mathrm{AP}$ free, if it is maximal w.r.t. set inclusion. One of the…

Combinatorics · Mathematics 2025-09-30 Bence Csajbók , Zoltán Lóránt Nagy

For every $k>3$, we give a construction of planar point sets with many collinear $k$-tuples and no collinear $(k+1)$-tuples. We show that there are $n_0=n_0(k)$ and $c=c(k)$ such that if $n\geq n_0$, then there exists a set of $n$ points in…

Combinatorics · Mathematics 2013-09-25 József Solymosi , Miloš Stojaković

An arc is a subset of $\mathbb F_q^2$ which does not contain any collinear triples. Let $A(q,k)$ denote the number of arcs in $\mathbb F_q^2$ with cardinality $k$. This paper is primarily concerned with estimating the size of $A(q,k)$ when…

Combinatorics · Mathematics 2020-10-13 Oliver Roche-Newton , Audie Warren
‹ Prev 1 3 4 5 6 7 10 Next ›