Related papers: $f$-Diophantine sets over finite fields via quasi-…

The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or…

Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…

In this paper we study a family of curves obtained by fibre products of hyperelliptic curves. We then exploit this family to construct examples of curves of given genus g over a finite field Fq with many rational points. The results…

We present a sharpening of nondivergence estimates for unipotent (or more generally polynomial-like) flows on homogeneous spaces. Applied to metric Diophantine approximation, it yields precise formulas for Diophantine exponents of affine…

In this paper, we consider the problem of counting Diophantine inequalities with multiple natural constraints. We prove a very general result in this setting using dynamical techniques. More precisely, we consider the joint asymptotic…

In this paper, we present a general method for constructing finite-dimensional quasi-Hopf algebras from finite abelian groups and braided vector spaces of Cartan type. The study of such quasi-Hopf algebras leads to the classification of…

We consider point sets in the $m$-dimensional affine space $\mathbb{F}_q^m$ where each squared Euclidean distance of two points is a square in $\mathbb{F}_q$. It turns out that the situation in $\mathbb{F}_q^m$ is rather similar to the one…

In twisted Diophantine approximation, for a fixed $m\times n$ matrix $\boldsymbol\alpha$ one is interested in sets of vectors $\boldsymbol\beta\in\mathbb R^m$ such that the system of affine forms $\mathbb R^n \ni \mathbf q \mapsto…

The main results of this paper are generalizations some classical theorems about transversals for families of finite sets to some cases of families of infinite sets.

We present a general technique for obtaining permutation polynomials over a finite field from permutations of a subfield. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

We prove a number of results on the metric and non-metric theory of Diophantine approximation for Yu's multidimensional variant of Mahler's classification of transcendental numbers. Our results arise as applications of well known results in…

We show the maximality of subfields as cliques in a special family of Cayley graphs defined on the additive group of a finite field. In particular, this confirms a conjecture of Yip on generalized Paley graphs.

In this paper we develop the convergence theory of simultaneous, inhomogeneous Diophantine approximation on manifolds. A consequence of our main result is that if the manifold $M \subset \mathbb{R}^n$ is of dimension strictly greater than…

The number of independent sets in regular bipartite expander graphs can be efficiently approximated by expressing it as the partition function of a suitable polymer model and truncating its cluster expansion. While this approach has been…

We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…

We consider Diophantine equations of the shape $ f(x) = g(y) $, where the polynomials $ f $ and $ g $ are elements of power sums. Using a finiteness criterion of Bilu and Tichy, we will prove that under suitable assumptions infinitely many…

We consider the problem of deterministically factoring a univariate polynomial over a finite field under the assumption of the Extended Riemann Hypothesis (ERH). This work builds upon the line of approach first explored by Gao in $2001$.…

We study Diophantine equations of type f(x)=g(y), where both f and g have at least two distinct critical points and equal critical values at at most two distinct critical points. Some classical families of polynomials (f_n)_n are such that…

Let $\F$ be a family of $r$ integral forms of degree $k\geq 2$ and $\LL=(l_1,\ldots,l_m)$ be a family of pairwise linearly independent linear forms in $n$ variables $\x=(x_1,...,x_n)$. We study the number of solutions $\x\in[1,N]^n$ to the…