Related papers: $f$-Diophantine sets over finite fields via quasi-…
Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…
We establish a near dichotomy between randomness and structure for the point counts of arbitrary projective cubic threefolds over finite fields. Certain "special" subvarieties, not unlike those in the Manin conjectures, dominate. We also…
The article is devoted to the investigation of groups of diffeomorphisms and loops of manifolds over ultra-metric fields of zero and positive characteristics. Different types of topologies are considered on groups of loops and…
We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons,…
We consider some asymptotic analysis for series related to the work of Hardy and Littlewood on Diophantine approximation, as well as Davenport. In particular, we expand on ideas from some previous work on arithmetic series and the RH.
Recent developments in the theory and application of the Hardy-Littlewood method are discussed, concentrating on aspects associated with diagonal diophantine problems. Recent efficient differencing methods for estimating mean values of…
This paper is devoted to the study of a problem of Cassels in multiplicative Diophantine approximation which involves minimising values of a product of affine linear forms computed at integral points. It was previously known that values of…
The present paper analyzes the discrepancy of distribution of rational points on general semisimple algebraic group varieties. The results include mean-square, almost sure, and uniform discrepancy estimates with explicit error bounds, which…
In the hyperalgebra of the $r$-th Frobenius kernel of a universal Chevalley group over a field of characteristic $p>0$, we study some subsets and the subalgebras generated by them and give some results. We are particularly interested in the…
We derive the asymptotic distribution of the domination number of a new family of random digraph called proximity catch digraph (PCD), which has application to statistical testing of spatial point patterns and to pattern recognition. The…
We provide a new family of $K_k$-free pseudorandom graphs with edge density $\Theta(n^{-1/(k-1)})$, matching a recent construction due to Bishnoi, Ihringer and Pepe. As in the former result, the idea is to use large subgraphs of polarity…
We introduce a family of 3-variable "Farey polynomials" that are closely connected with the geometry and topology of $3$-manifolds and orbifolds as they can be used to produce concrete realisations of the boundaries and local coordinates…
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of \emph{patchworks} to describe the possible…
In 1926 Khintchine introduced a topological argument proving the existence of uncountably many nontrivial singular linear forms of $n \geq 2$ variables. Throughout the years, this argument has been extensively modified and generalized. Most…
In this paper we provide an algorithm to classify groups of points on abelian threefolds over finite fields. The classification is given in terms of the Weil polynomial of abelian varieties in a given $\mathbb{F}_q$-isogeny class. This work…
We establish an explicit asymptotic formula for the number of rational solutions of intrinsic Diophantine inequalities on simply-connected simple algebraic groups, at arbitrarily small scales.
For a nonzero integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j + n is a perfect square for all 1 <= i < j <= m, is called a D(n)-m-tuple. In this paper, by using properties of so-called regular Diophantine…
In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with precisely three ideals.
Fix an integer $n\ge 2$. To each non-zero point $\mathbf{u}$ in $\mathbb{R}^n$, one attaches several numbers called exponents of Diophantine approximation. However, as Khintchine first observed, these numbers are not independent of each…
A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…