Related papers: Some problems in analytic number theory for polyno…
We consider the problem of the computation of $\inf_p \theta p$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $\theta$. An effective algorithm is presented. The output of the…
In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein. These notions, definitions, unsolved problems, questions, theorems corollaries, formulae, conjectures, examples, mathematical criteria, etc.…
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT,…
Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…
This is a list of problems that were collected from participants at the Comparative Prime Number Theory Symposium held at UBC from June 17 to June 21, 2024. Its goal is to stimulate research and future collaborations in this growing field.…
We investigate three combinatorial problems considered by Erd\"os, Rivat, Sark\"ozy and Sch\"on regarding divisibility properties of sum sets and sets of shifted products of integers in the context of function fields. Our results in this…
In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…
Quantization of the parameters of machine learning models, such as deep neural networks, requires solving constrained optimization problems, where the constraint set is formed by the Cartesian product of many simple discrete sets. For such…
This is a survey of old and new problems and results in additive number theory.
This lectures notes consists of four lectures. The first lecture discusses questions around Hilbert-Arnold Problem which is naturally arises from Quantitative Hilbert 16-th problem. In the second lecture we outline author's solution of a…
In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…
Permutation polynomials with explicit constructions over finite fields have long been a topic of great interest in number theory. In recent years, by applying linear translators of functions from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$, many…
Those lectures revolve around the following problem: given a system of n real polynomials in n variables, count the number of real roots. The first lecture is a course on Newton iteration and alpha-theory. The second describes an…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…
Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…