Related papers: Divisibility problems for function fields

This paper elaborates on a sieving technique that has first been applied in 2018 for improving bounds on deterministic integer factorization. We will generalize the sieve in order to obtain a polynomial-time reduction from integer…

We use Sidon sets to present an elementary method to study some combinatorial problems in finite fields, such as sum product estimates, solubility of some equations and distribution of sequences in small intervals. We obtain classic and…

In part I of this paper we studied additive decomposability of the set $\F_y$ of th $y$-smooth numbers and the multiplicative decomposability of the shifted set $\g_y=\F_y+\{1\}$. In this paper, focusing on the case of 'large' functions…

In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding)…

A finite group G is called admissible over a given field if there exists a central division algebra that contains a G-Galois field extension as a maximal subfield. We give a definition of embedding problems of division algebras that extends…

In difference algebra, summability arises as a basic problem upon which rests the effective solution of other more elaborate problems, such as creative telescoping problems and the computation of Galois groups of difference equations. In…

We pursue the question how integers can be ordered or partitioned according to their divisibility properties. Based on pseudometrics on $\mathbb{Z}$, we investigate induced preorders, associated equivalence relations, and quotient sets. The…

The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…

We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…

Extending a method of D. Wolke, we establish a general result on the large sieve with sparse sets S of moduli which are in a sense well-distributed in arithmetic progressions. We then use this result together with Fourier techniques to…

In this paper, we establish a version of the large sieve with square moduli for imaginary quadratic extensions of rational function fields of odd characteristics.

In this paper, we establish a general version of the large sieve with additive characters for restricted sets of moduli in arbitrary dimension for function fields. From this, we derive function field versions for the large sieve in high…

We establish large sieve inequalities for power moduli in imaginary quadratic number fields, extending earlier work of Baier and Bansal for the Gaussian field.

Problems in additive number theory related to sum and difference sets, more general binary linear forms, and representation functions of additive bases for the integers and nonnegative integers.

Extending a method of D. Wolke, we establish a general result on the large sieve with sparse sets S of moduli which are in a sense well-distributed in arithmetic progressions. We then apply our result to the case when S consists of sqares.…

We establish a general large sieve inequality with sparse sets $\mathcal{S}$ of moduli in the Gaussian integers which are in a sense well-distributed in arithmetic progressions. This extends earlier work of S. Baier on the large sieve with…

This paper investigates the Erd\H{o}s distinct subset sums problem in $\mathbb{Z}^k$. Beyond the classical variance method, using alternative statistical quantities like $\mathbb{E}[\|X\|_1]$ and $\mathbb{E}[\|X\|_3^3]$ can yield better…

After different variables and functions changes, the generalized dispersal problem, recalled in (1) below and considered in part I, see Labbas, Maingot and Thorel [14], leads us to consider, to study and to invert the sum of linear…

In this note, we present a substantial improvement on the computational complexity of the Erd\"{o}s-Szekeres partitioning problem and review recent works on dynamic \textsf{LIS}.

Let $V\subset \mathbb{F}_q^d$ be a \textit{regular} variety, $k\ge 3$ is an integer and $A\subseteq V$. Covert, Koh, and Pi (2017) proved the following generalization of the Erd\H{o}s-Falconer distance problem: If $|A|\gg…