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

We study Diophantine equations of type $f(x)=g(y)$, where $f$ and $g$ are lacunary polynomials. According to a well known finiteness criterion, for a number field $K$ and nonconstant $f, g\in K[x]$, the equation $f(x)=g(y)$ has infinitely…

Let $GP(q,d)$ be the $d$-Paley graph defined on the finite field $\mathbb{F}_q$. It is notoriously difficult to improve the trivial upper bound $\sqrt{q}$ on the clique number of $GP(q,d)$. In this paper, we investigate the connection…

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…

We develop a theory of quasisymmetries for finitely ramified fractals, with applications to finitely ramified Julia sets. We prove that certain finitely ramified fractals admit a naturally defined class of "undistorted metrics" that are all…

Let $D_\lambda^{d,k}$ denote the family of diagonal hypersurface over a finite field $\mathbb{F}_q$ given by \begin{align*} D_\lambda^{d,k}:X_1^d+X_2^d=\lambda dX_1^kx_2^{d-k}, \end{align*} where $d\geq2$, $1\leq k\leq d-1$, and…

We study the Diophantine transference principle over function fields. By adapting the approach of Beresnevich and Velani to the function field set-up, we extend many results from homogeneous Diophantine approximation to the realm of…

Let A be an arbitrary integral domain of characteristic 0 which is finitely generated over Z. We consider Thue equations $F(x,y)=b$ with unknowns x,y from A and hyper- and superelliptic equations $f(x)=by^m$ with unknowns from A, where the…

We give upper bounds for the number of integral solutions of bounded height to a system of equations $f_i(x_1,\ldots,x_n) = 0$, $1 \leq i \leq r$, where the $f_i$ are polynomials with integer coefficients. The estimates are obtained by…

This paper is the ninth in a sequence on the structure of sets of solutions to systems of equations in free and hyperbolic groups, projections of such sets (Diophantine sets), and the structure of definable sets over free and hyperbolic…

We investigate a family of Diophantine polynomial equations which involve continuant functions. In particular, given a polynomial $P(x)\in \mathbb{Z}[x]$ and $n\in \mathbb{N}$, we consider the equation $P(K_n(x_1,\ldots, x_n)) =…

We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…

A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson.

We construct a new family of distance-biregular graphs related to hyperovals and a new sporadic example of a distance-biregular graph related to Mathon's perp system. The infinite family can be explained using 2-$\bipartB$-homogeneity,…

In this paper we asymptotically count $d$-regular $k$-uniform hypergraphs on $n$ vertices, provided $k$ is fixed and $d=d(n)=o(n^{1/2})$. In doing so, we extend to hypergraphs a switching technique of McKay and Wormald.

The pantograph differential equation and its solution, the deformed exponential function, are remarkable objects that appear in areas as diverse as combinatorics, number theory, statistical mechanics, and electrical engineering. In this…

Andrews and Petsche proposed in 2020 a conjectural characterization of all pairs $(f,\alpha)$, where $f$ is a polynomial over a number field $K$ and $\alpha\in K$, such that the dynamical Galois group of the pair $(f,\alpha)$ is abelian. In…

We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…

Some new infinite families of simple, indecomposable $m$-factorizations of the complete multigraph $\lambda K_v$ are presented. Most of the constructions come from finite geometries.

For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…

We study general Delaunay-graphs, which are natural generalizations of Delaunay triangulations to arbitrary families, in particular to pseudo-disks. We prove that for any finite pseudo-disk family and point set, there is a plane drawing of…