English
Related papers

Related papers: Permutations minimizing the number of collinear tr…

200 papers

We review the relationship between discrete groups of symmetries of Euclidean three-space, constructions in algebraic geometry around Kleinian singularities including versions of Hilbert and Quot schemes, and their relationship to…

Algebraic Geometry · Mathematics 2024-10-24 Lukas Bertsch , Ádám Gyenge , Balázs Szendrői

We prove the joints conjecture, showing that for any $N$ lines in ${\Bbb R}^3$, there are at most $O(N^{{3 \over 2}})$ points at which 3 lines intersect non-coplanarly. We also prove a conjecture of Bourgain showing that given $N^2$ lines…

Combinatorics · Mathematics 2008-12-08 Larry Guth , Nets Hawk Katz

An orthomorphism over a finite field $\mathbb{F}_q$ is a permutation $\theta:\mathbb{F}_q\mapsto\mathbb{F}_q$ such that the map $x\mapsto\theta(x)-x$ is also a permutation of $\mathbb{F}_q$. The degree of an orthomorphism of $\mathbb{F}_q$,…

Combinatorics · Mathematics 2021-07-09 Jack Allsop , Ian M. Wanless

Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…

Algebraic Geometry · Mathematics 2022-04-26 Stefan Barańczuk

Let $L$ be a set of lines of an affine space over a field and let $S$ be a set of points with the property that every line of $L$ is incident with at least $N$ points of $S$. Let $D$ be the set of directions of the lines of $L$ considered…

Combinatorics · Mathematics 2016-05-04 Simeon Ball , Aart Blokhuis , Diego Domenzain

We consider the number \bar N(q) of points in the projective complement of graph hypersurfaces over \F_q and show that the smallest graphs with non-polynomial \bar N(q) have 14 edges. We give six examples which fall into two classes. One…

Combinatorics · Mathematics 2015-03-13 Oliver Schnetz

We study the number of non-isomorphic functional graphs of affine-linear transformations from (\F_q)^n to itself, and we prove upper and lower bounds on this quantity for n large. As a corollary to our result, we prove bounds on the number…

Number Theory · Mathematics 2013-02-20 Eric Bach , Andrew Bridy

We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of $n$ points in the plane. Configurations of interest include \emph{convex polygons},…

Combinatorics · Mathematics 2015-09-22 Adrian Dumitrescu , Maarten Löffler , André Schulz , Csaba D. Tóth

We consider the problem of minimising the number of edges that are contained in triangles, among $n$-vertex graphs with a given number of edges. We prove a conjecture of F\"uredi and Maleki that gives an exact formula for this minimum, for…

Combinatorics · Mathematics 2016-05-03 Vytautas Gruslys , Shoham Letzter

A Besicovitch set in AG(n,q) is a set of points containing a line in every direction. The Kakeya problem is to determine the minimal size of such a set. We solve the Kakeya problem in the plane, and substantially improve the known bounds…

Combinatorics · Mathematics 2009-11-24 Aart Blokhuis , Francesco Mazzocca

We review 28 uniform partitions of 3-space in order to find out which of them have graphs (skeletons) embeddable isometrically (or with scale 2) into some cubic lattice ${\bf Z}_n$. We also consider some relatives of those 28 partitions,…

Metric Geometry · Mathematics 2007-05-23 M. Deza , M. I. Shtogrin

In this paper, we characterize all minimal value set binomials over $\mathbb{F}_q$, that is, binomials whose size of the set of images is the smallest possible. With this information, we also classify all quadrinomial curves with separated…

Number Theory · Mathematics 2025-08-25 Tiago Aprigio , João Paulo Guardieiro

We show that there exist linear $3$-uniform hypergraphs with $n$ vertices and $\Omega(n^2)$ edges which contain no copy of the $3 \times 3$ grid. This makes significant progress on a conjecture of F\"{u}redi and Ruszink\'{o}. We also…

Combinatorics · Mathematics 2021-04-02 Lior Gishboliner , Asaf Shapira

We introduce an evolving-plane ansatz for the explicit construction of entire minimal graphs of dimension $n$ ($n\geq 3$) and codimension $m$ ($m\geq 2$), for any odd integer $n$. Under this ansatz, the minimal surface system reduces to the…

Differential Geometry · Mathematics 2025-12-15 Chung-Jun Tsai , Mao-Pei Tsui , Jingbo Wan , Mu-Tao Wang

The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…

Number Theory · Mathematics 2025-08-05 Xuan Pang , Yangcheng Li , Pingzhi Yuan , Yuanpeng Zeng

We study finite-dimensional representations of quantum affine algebras using q-characters. We prove the conjectures from math.QA/9810055 and derive some of their corollaries. In particular, we prove that the tensor product of fundamental…

Quantum Algebra · Mathematics 2009-10-31 Edward Frenkel , Evgeny Mukhin

Let $m_{12}$, $m_{13}$, ..., $m_{n-1,n}$ be the slopes of the $\binom{n}{2}$ lines connecting $n$ points in general position in the plane. The ideal $I_n$ of all algebraic relations among the $m_{ij}$ defines a configuration space called…

Algebraic Geometry · Mathematics 2007-05-23 Jeremy L. Martin

Let $F$ be Cayley's ruled cubic surface in a projective three-space over any commutative field $K$. We determine all collineations fixing $F$, as a set, and all cubic forms defining $F$. For both problems the cases $|K|=2,3$ turn out to be…

Algebraic Geometry · Mathematics 2013-04-02 Johannes Gmainer , Hans Havlicek

We study subsets of the $n$-dimensional vector space over the finite field $\mathbb{F}_q$, for odd $q$, which contain either a sphere for each radius or a sphere for each first coordinate of the center. We call such sets radii spherical…

Combinatorics · Mathematics 2020-04-03 Mehdi Makhul , Audie Warren , Arne Winterhof

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov