English
Related papers

Related papers: On skew corner-free sets

200 papers

For every $d\ge 3$, we construct a noncompact smooth $d$-dimensional Riemannian manifold with strictly positive sectional curvature without isoperimetric sets for any volume below $1$. We construct a similar example also for the relative…

Differential Geometry · Mathematics 2024-05-30 Gioacchino Antonelli , Federico Glaudo

We investigate the poset of skew diagrams ordered by adding or forming the union of skew diagrams. We will show that a skew diagram which has at least n convex corners to the upper left and also to the lower right is larger than the skew…

Combinatorics · Mathematics 2011-04-04 Christian Gutschwager

A corner is a triple of points in $\Bbb{Z}^2$ of the form $(x,y),(x+d,y),(x,y+d)$ where $d\neq 0$. One can think of them as being 2D-analogues to 3-term arithmetic progressions. In this short note, we extend ideas of Green-Wolf from this…

Combinatorics · Mathematics 2022-10-26 Zach Hunter

An $\mathbb{F}_q$-linear set of rank $k$ on a projective line $\mathrm{PG}(1,q^h)$, containing at least one point of weight one, has size at least $q^{k-1}+1$ (see [J. De Beule and G. Van De Voorde, The minimum size of a linear set, J.…

Combinatorics · Mathematics 2020-09-29 Dibyayoti Jena , Geertrui Van de Voorde

Let S be a smooth cubic surface defined over a field K. As observed by Segre and Manin, there is a secant and tangent process on S that generates new K-rational points from old. It is natural to ask for the size of a minimal generating set…

Number Theory · Mathematics 2013-12-23 Jenny Cooley

A quasi-kernel of a digraph $D$ is an independent set $Q$ such that every vertex can reach $Q$ in at most two steps. A 48-year conjecture made by P.L. Erd\H{o}s and Sz\'ekely, denoted the small QK conjecture, says that every sink-free…

Combinatorics · Mathematics 2024-06-14 Jiangdong Ai , Xiangzhou Liu , Fei Peng

We show that there is a constant $k$ such that Buss's intuitionistic theory $\mathsf{IS}^1_2$ does not prove that SAT requires co-nondeterministic circuits of size at least $n^k$. To our knowledge, this is the first unconditional…

Logic in Computer Science · Computer Science 2025-09-17 Lijie Chen , Jiatu Li , Igor C. Oliveira

Every $n$-vertex planar triangle-free graph with maximum degree at most $3$ has an independent set of size at least $\frac{3}{8}n$. This was first conjectured by Albertson, Bollob\'as and Tucker, and was later proved by Heckman and Thomas.…

Combinatorics · Mathematics 2020-07-15 Wouter Cames van Batenburg , Jan Goedgebeur , Gwenaël Joret

We show that there exists an absolute constant $c_0<1$ such that for all $n \ge 2$, any measurable set $A \subset S^{n-1}$ of density at least $c_0$ contains $n$ pairwise orthogonal vectors. The result is sharp up to the value of the…

Metric Geometry · Mathematics 2025-06-12 Dmitrii Zakharov

We establish several nonuniqueness results for the problem of finding complete conformal metrics with constant (fourth-order) $Q$-curvature on compact and noncompact manifolds of dimension $\geq5$. Infinitely many branches of metrics with…

Differential Geometry · Mathematics 2021-05-14 Renato G. Bettiol , Paolo Piccione , Yannick Sire

We extend the concepts of sum-free sets and Sidon-sets of combinatorial number theory with the aim to provide explicit constructions for spherical designs. We call a subset $S$ of the (additive) abelian group $G$ {\it $t$-free} if for all…

Combinatorics · Mathematics 2015-12-10 Béla Bajnok

Given two posets $P,Q$ we say that $Q$ is $P$-free if $Q$ does not contain a copy of $P$. The size of the largest $P$-free family in $2^{[n]}$, denoted by $La(n,P)$, has been extensively studied since the 1980s. We consider several related…

Combinatorics · Mathematics 2023-12-22 Balázs Patkós , Andrew Treglown

Let $\mathbb{F}_q$ be a finite field of order $q$. Iosevich and Rudnev (2005) proved that for any set $A\subset \mathbb{F}_q^d$, if $|A|\gg q^{\frac{d+1}{2}}$, then the distance set $\Delta(A)$ contains a positive proportion of all…

Number Theory · Mathematics 2022-05-03 Doowon Koh , Minh Quy Pham , Thang Pham

We show that there is a positive constant $c_0$ such that \[\sum_{n\le x}\mu^2(n^2+1)c_0x+O_{\varepsilon}(x^{7/12+\varepsilon})\] for any fixed $\varepsilon>0$. This improves a result of Estermann [3] from 1931, in which the error term had…

Number Theory · Mathematics 2012-05-10 D. R. Heath-Brown

The purpose of this work is to pursue classification of geproci sets. Specifically we classify $[m,n]$-geproci sets which consist of $m=4$ points on each of $n$ skew lines, assuming the skew lines have two transversals in common. We show…

Let $G$ be an abelian group. A tri-colored sum-free set in $G^n$ is a collection of triples $({\bf a}_i, {\bf b}_i, {\bf c}_i)$ in $G^n$ such that ${\bf a}_i+{\bf b}_j+{\bf c}_k=0$ if and only if $i=j=k$. Fix a prime $q$ and let $C_q$ be…

Combinatorics · Mathematics 2018-07-09 Robert Kleinberg , Will Sawin , David E. Speyer

In this paper, we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we show that $3{\lfloor\frac{n}{2}\rfloor}$ internal Steiner…

Computational Geometry · Computer Science 2007-05-23 David Bremner , Ferran Hurtado , Suneeta Ramaswami , Vera Sacristan

A certain inequality conjectured by Vershynin is studied. It is proved that for any $n$-dimensional symmetric convex body $K$ with inradius $w$ and $\gamma_{n}(K) \leq 1/2$ there is $\gamma_{n}(sK) \leq (2s)^{w^{2}/4}\gamma_{n}(K)$ for any…

Probability · Mathematics 2014-09-19 Rafał Latała , Krzysztof Oleszkiewicz

We show that atoms of the $n$-generated free left-handed skew Boolean intersection algebra are in a bijective correspondence with pointed partitions of non-empty subsets of $\{1,2,\dots, n\}$. Furthermore, under the canonical inclusion into…

Rings and Algebras · Mathematics 2024-11-12 Ganna Kudryavtseva

Let $\mathcal{Q}_n$ be the $n$-dimensional hypercube: the graph with vertex set $\{0,1\}^n$ and edges between vertices that differ in exactly one coordinate. For $1\leq d\leq n$ and $F\subseteq \{0,1\}^d$ we say that $S\subseteq \{0,1\}^n$…

Combinatorics · Mathematics 2009-07-16 J. Robert Johnson , John Talbot