Searcharxiv⌕ Search

arXiv subjects

Omran Ahmadi

Publications and source records attributed to Omran Ahmadi.

15 recordsLinked to original sources
arXiv2026

On the Slice Rank of Tensors in P-Echelon Form

For a totally ordered finite set $A$ with the total order $Q$, a poset $P=([d],\le_P)$, and a field $\mathbb{F}$, a tensor $T:A^d\longrightarrow \mathbb{F}$ is in $P$-echelon form if $r\le_{P}s$ in $P$ implies $a_r\le_Q a_s$ in every tuple $(a_1,\dots,a_d)$ in the support of $T$. We prove that if the Hasse diagram of $P$ has no isolated vertex, then tensors in $P$-echelon form with nonzero diagonal entries have full slice-rank. Our results extend and improve on recent results of Amanov and Yeliussizov.

math.CO↗
arXiv2026

A Polynomial Improvement of Naslund--Sawin Bound for Sunflower-Free Families Using Triangular Tensors

Naslund and Sawin used the slice-rank method for diagonal tensors to prove that $$|\mathcal{F}|=O\!\left(n^{1/2}\left(\frac{3}{2^{2/3}}\right)^n\right)$$ for any sunflower-free family $\mathcal{F}\subseteq 2^{[n]}$. We prove a lemma similar to the slice-rank lemma for the newly defined $i$-triangular tensors, and use it to achieve a polynomial-factor improvement of the bound of Naslund and Sawin by proving that $$|\mathcal{F}|=O\!\left(n^{1/6}\left(\frac{3}{2^{2/3}}\right)^n\right)$$ for any sunflower-free family $\mathcal{F}\subseteq 2^{[n]}$.

math.CO↗
arXiv2025

Triangular tensors and set-intersection problems

In the past few years, the slice-rank lemma of Tao has been applied successfully to many problems in extremal combinatorics. In this paper, first, we define a new notion of triangular tensors which generalizes that of triangular matrices (2-tensors), and prove a lemma similar to the slice-rank lemma for them. Then, applying the slice-rank framework with triangular matrices, we give new and shorter proofs for some well-known theorems on set-intersections like Frankl-Wilson and Snevily with modular constraints, and some of the more recent set-intersection results. We also improve Snevily with modular constraints in some special cases. Finally, using Snevily's theorem with some combinatorial lemmas, we give new bounds on some generalizations of the reverse odd-town problem.

math.CO↗
arXiv2021

Difference sets and tri-weight linear codes from trinomials over binary fields

We confirm a conjecture of Cun Sheng Ding~\cite{Ding-Discrete} claiming that the punctured value-sets of a list of eleven trinomials over odd-degree extensions of the binary field give rise to difference sets with Singer parameters. In the course of confirming the conjecture, we show that these trinomials share the remarkable property that every element of the value-set of each trinomial has either one or four preimages. We also give a partial resolution of another conjecture of Cun Sheng Ding~\cite{Ding-Discrete} claiming that linear codes constructed from those eleven trinomials are tri-weight.

math.CO↗
arXiv2018

A note on the stability of trinomials over finite fields

A polynomial $f(x)$ over a field $K$ is called stable if all of its iterates are irreducible over $K$. In this paper we study the stability of trinomials over finite fields. Specially, we show that if $f(x)$ is a trinomial of even degree over the binary field $\mathbb{F}_2$, then $f(x)$ is not stable. We prove a similar result for some families of monic trinomials over finite fields of odd characteristic. These results are obtained towards the resolution of a conjecture on the instability of polynomials over finite fields whose degrees are divisible by the characteristic of the underlying field.

math.NT↗
arXiv2016

Fibre Products of Supersingular Curves and the Enumeration of Irreducible Polynomials with Prescribed Coefficients

For any positive integers $n\geq 3, r\geq 1$ we present formulae for the number of irreducible polynomials of degree $n$ over the finite field $\mathbb{F}_{2^r}$ where the coefficients of $x^{n-1}$, $x^{n-2}$ and $x^{n-3}$ are zero. Our proofs involve counting the number of points on certain algebraic curves over finite fields, a technique which arose from Fourier-analysing the known formulae for the $\mathbb{F}_2$ base field cases, reverse-engineering an economical new proof and then extending it. This approach gives rise to fibre products of supersingular curves and makes explicit why the formulae have period $24$ in $n$.

math.NT↗
arXiv2014

Decomposing Jacobians of Curves over Finite Fields in the Absence of Algebraic Structure

We consider the issue of when the L-polynomial of one curve over $\F_q$ divides the L-polynomial of another curve. We prove a theorem which shows that divisibility follows from a hypothesis that two curves have the same number of points over infinitely many extensions of a certain type, and one other assumption. We also present an application to a family of curves arising from a conjecture about exponential sums. We make our own conjecture about L-polynomials, and prove that this is equivalent to the exponential sums conjecture.

math.NT↗
arXiv2013

Exponential Sums over Points of Elliptic Curves

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on elliptic curves.

math.NT↗
arXiv2012

An efficient deterministic test for Kloosterman sum zeros

We propose a simple deterministic test for deciding whether or not an element $a \in \F_{2^n}^{\times}$ or $\F_{3^n}^{\times}$ is a zero of the corresponding Kloosterman sum over these fields, and rigorously analyse its runtime. The test seems to have been overlooked in the literature. The expected cost of the test for binary fields is a single point-halving on an associated elliptic curve, while for ternary fields the expected cost is one half of a point-thirding on an associated elliptic curve. For binary fields of practical interest, this represents an O(n) speedup over the previous fastest test. By repeatedly invoking the test on random elements of $\F_{2^n}^{\times}$ we obtain the most efficient probabilistic method to date to find non-trivial Kloosterman sum zeros. The analysis depends on the distribution of Sylow $p$-subgroups in the two families of associated elliptic curves, which we ascertain using a theorem due to Howe.

math.NT↗
arXiv2011

On isogeny classes of Edwards curves over finite fields

We count the number of isogeny classes of Edwards curves over finite fields, answering a question recently posed by Rezaeian and Shparlinski. We also show that each isogeny class contains a {\em complete} Edwards curve, and that an Edwards curve is isogenous to an {\em original} Edwards curve over $\F_q$ if and only if its group order is divisible by 8 if $q \equiv -1 \pmod{4}$, and 16 if $q \equiv 1 \pmod{4}$. Furthermore, we give formulae for the proportion of $d \in \F_q \setminus \{0,1\}$ for which the Edwards curve $E_d$ is complete or original, relative to the total number of $d$ in each isogeny class.

math.NT↗
arXiv2010

Generalization of a Theorem of Carlitz

We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic transformation. Our main tools are a combinatorial argument and Hurwitz genus formula.

math.NT↗
arXiv2010

On the Distribution of the Number of Points on Algebraic Curves in Extensions of Finite Fields

Let $\cC$ be a smooth absolutely irreducible curve of genus $g \ge 1$ defined over $\F_q$, the finite field of $q$ elements. Let $# \cC(\F_{q^n})$ be the number of $\F_{q^n}$-rational points on $\cC$. Under a certain multiplicative independence condition on the roots of the zeta-function of $\cC$, we derive an asymptotic formula for the number of $n =1, ..., N$ such that $(# \cC(\F_{q^n}) - q^n -1)/2gq^{n/2}$ belongs to a given interval $\cI \subseteq [-1,1]$. This can be considered as an analogue of the Sato-Tate distribution which covers the case when the curve $\E$ is defined over $\Q$ and considered modulo consecutive primes $p$, although in our scenario the distribution function is different. The above multiplicative independence condition has, recently, been considered by E. Kowalski in statistical settings. It is trivially satisfied for ordinary elliptic curves and we also establish it for a natural family of curves of genus $g=2$.

math.NT↗
arXiv2008

On the Sum-Product Problem on Elliptic Curves

Let $\E$ be an ordinary elliptic curve over a finite field $\F_{q}$ of $q$ elements and $x(Q)$ denote the $x$-coordinate of a point $Q = (x(Q),y(Q))$ on $\E$. Given an $\F_q$-rational point $P$ of order $T$, we show that for any subsets $\cA, \cB$ of the unit group of the residue ring modulo $T$, at least one of the sets $$ \{x(aP) + x(bP) : a \in \cA, b \in \cB\} \quad\text{and}\quad \{x(abP) : a \in \cA, b \in \cB\} $$ is large. This question is motivated by a series of recent results on the sum-product problem over finite fields and other algebraic structures.

math.NT↗
arXiv2007

Multiplicative Order of Gauss Periods

We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases over finite fields. This bound improves the previous bound of J. von zur Gathen and I. E. Shparlinski.

math.NT↗