English
Related papers

Related papers: Collinear triples in permutations

200 papers

Baba and Granath generalize Elkies' theorem on infinitude of supersingular primes for elliptic curves to abelian surfaces with quaternionic multiplication of discriminant $6$, whose field of moduli is $\mathbb{Q}$ and which is a Jacobian in…

Number Theory · Mathematics 2025-11-12 Fangu Chen

We give a new bound on the number of collinear triples for two arbitrary subsets of a finite field. This improves on existing results which rely on the Cauchy inequality. We then us this to provide a new bound on trilinear and quadrilinear…

Number Theory · Mathematics 2017-09-01 Simon Macourt

Let $q$ be a power of a prime $p$, let $k$ be a nontrivial divisor of $q-1$ and write $e=(q-1)/k$. We study upper bounds for cyclotomic numbers $(a,b)$ of order $e$ over the finite field $\mathbb{F}_q$. A general result of our study is that…

Number Theory · Mathematics 2019-03-19 Tai Do Duc , Ka Hin Leung , Bernhard Schmidt

For various triple systems $F$, we give tight lower bounds on the number of copies of $F$ in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of…

Combinatorics · Mathematics 2009-05-14 Dhruv Mubayi

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Combinatorics · Mathematics 2023-06-28 Anitha G , P Vanchinathan

A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…

Combinatorics · Mathematics 2015-03-19 Andrew Suk

We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…

Combinatorics · Mathematics 2025-10-29 Michael Waite

This paper completes the classification of triply-transitive strongly regular graphs, a program recently initiated by Herman, Maleki, and Razafimahatratra. By proving that the collinearity graph of the polar space $\mathcal{Q}^{-}(5,q)$ and…

Combinatorics · Mathematics 2025-10-28 Weicong Li , Hanlin Zou

From some works of P. Furtw\"angler and H.S. Vandiver, we put the basis of a new cyclotomic approach to Fermat's last theorem for p>3 and to a stronger version called SFLT, by introducing governing fields of the form Q(exp(2 i pi/q-1)) for…

Number Theory · Mathematics 2011-04-14 Georges Gras , Roland Quême

Let $f=a{\tt x} +b{\tt x}^q+{\tt x}^{2q-1}\in\Bbb F_q[{\tt x}]$. We find explicit conditions on $a$ and $b$ that are necessary and sufficient for $f$ to be a permutation polynomial of $\Bbb F_{q^2}$. This result allows us to solve a related…

Number Theory · Mathematics 2013-09-16 Xiang-dong Hou

In the most interesting case of safe prime powers $q$, G\'omez and Winterhof showed that a subfamily of the family of Golomb Costas permutations of $\{1,2,\ldots,q-2\}$ of size $\varphi(q-1)$ has maximal cross-correlation of order of…

Combinatorics · Mathematics 2024-08-27 Huaning Liu , Arne Winterhof

Let $\phi$ be a polynomial over $K$ (a field of characteristic 0) such that the Hessian of $\phi$ is a nonzero constant. Let $\bar\phi$ be the formal Legendre Transform of $\phi$. Then $\bar\phi$ is well-defined as a formal power series…

Mathematical Physics · Physics 2007-05-23 Guowu Meng

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $f \in \mathbb{F}_{q}[x]$ be a polynomial of degree $d > 0$. Denote the image set of this polynomial as $V_{f}=\{f(\alpha)\mid\alpha\in\mathbb{F}_{q}\}$ and denote the…

Number Theory · Mathematics 2026-02-04 Jiyou Li , Zhiyao Zhang

Let $q$ be an odd power of a prime $p$, and $S \subset \mathbb{F}_q^*$ such that $S=-S$ and $S/S \neq \mathbb{F}_q^*$. We show that the clique number of the Cayley graph $\operatorname{Cay}(\mathbb{F}_q^+,S)$ is at most…

Combinatorics · Mathematics 2025-11-26 Chi Hoi Yip

Let $q$ be a prime power and $n, r$ integers such that $r\mid q^n-1$. An element of $\mathbb{F}_{q^n}$ of multiplicative order $(q^n-1)/r$ is called \emph{$r$-primitive}. For any odd prime power $q$, we show that there exists a…

Number Theory · Mathematics 2021-01-20 Stephen D. Cohen , Giorgos Kapetanakis

A well-known result of von zur Gathen asserts that a non-exceptional permutation polynomial of degree $n$ over $\mathbb{F}_{q}$ exists only if $q<n^{4}$. With the help of the Weil bound for the number of $\mathbb{F}_{q}$-points on an…

Number Theory · Mathematics 2018-12-07 Xiang Fan

Let $F$ be a finite field with characteristic greater than two. Define a \emph{Besicovitch set} in $F^4$ to be a set $P \subseteq F^4$ containing a line in every direction. The \emph{Kakeya conjecture} asserts that $|P| \approx |F|^4$. A…

Classical Analysis and ODEs · Mathematics 2007-05-23 Terence Tao

For prime powers q, let s(q) denote the probability that a randomly-chosen principally-polarized abelian surface over the finite field F_q is not simple. We show that there are positive constants B and C such that for all q, B (log…

Number Theory · Mathematics 2020-02-27 Jeff Achter , Everett W. Howe

Permutation polynomials with few terms attracts researchers' interest in recent years due to their simple algebraic form and some additional extraordinary properties. In this paper, by analyzing the quadratic factors of a fifth-degree…

Information Theory · Computer Science 2016-10-17 Nian Li

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be any linearly independent polynomials with zero constant term. We show that there exists a $\gamma>0$ such that any subset of $\mathbb{F}_q$ of size at least $q^{1-\gamma}$ contains a nontrivial…

Number Theory · Mathematics 2019-05-29 Sarah Peluse
‹ Prev 1 3 4 5 6 7 10 Next ›