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

We derive an asymptotic formula for the number of solutions in a given subfield to certain system of equations over finite fields. As an application, we construct new families of maximal cliques in generalized Paley graphs. Given integers…

A detailed presentation of the results obtained during my Ph.D. research. The main investigations concern explicit descriptions of classes of finite dimensional pointed Hopf algebras and their quasi-isomorphism types.

The notion of $f$-ideal is recent and has so far been studied in several papers. In \cite{qfi}, the idea of $f$-ideal is generalized to quasi $f$-ideals, which is much larger class than the class of $f$-ideals. In this paper, we introduce…

We construct a random $n$-hypergraph for every $n$, in a given pseudofinite field.

The goal of this paper is to generalize the main results of [KM] and subsequent papers on metric Diophantine approximation with dependent quantities to the set-up of systems of linear forms. In particular, we establish `joint strong…

We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…

We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…

We observe that the nonstandard finite cardinality of a definable set in a strongly minimal pseudofinite structure D is a polynomial over the integers in the nonstandard finite cardinality of D. We conclude that D is unimodular, hence also…

We study sets of solutions to equations over a free group, projections of such sets, and the structure of elementary sets defined over a free group. The structre theory we obtain enable us to answer some questions of A. Tarski's, and…

For $\theta$ a non-algebraic point on a quasi projective variety over a number field, I prove that $\theta$ has an approximation by a series of algebraic points of bounded height and degree which is essentially best possible. Applications…

We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…

In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…

For a tuple $(\theta_1,..,\theta_M)$ of complex number, buliding on the approximation techniques in earlier papers of this series, this paper engages in deducing lower estimates on the transcendence degree of the field generated by…

We estimate the lattice sums arising in the context of the integer point counting in polyhedra.

Let $\ell$ and $p$ be (not necessarily distinct) prime numbers and $F$ be a global function field of characteristic $\ell$ with field of constants $\kappa$. Assume that there exists a prime $P_\infty$ of $F$ which has degree $1$, and let…

We develop a theory of diophantine approximation on generalized flag varieties, varieties that can be obtained as a quotient of a semisimple algebraic group by a parabolic subgroup. Using methods from the theory of arithmetic groups, due in…

We prove new parameterization theorems for sets definable in the structure $\mathbb{R}_{an}$ (i.e. for globally subanalytic sets) which are uniform for definable families of such sets. We treat both $C^r$-parameterization and (mild)…

Using cyclotomic classes of order twelve for certain finite fields, we construct an infinite family of almost difference sets and normally regular graphs applying the theory of cyclotomy. We show that in each of these fields neither the…