Related papers: Maximal Circular Point Sets over Arbitrary Fields …
The notion of symmetry in polynomial rings with several indeterminates is generalized to polynomial rings over finite fields. Families of extensions of the projective line over a finite field of constants possessing this property are…
When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…
We determine upper bounds on the number of rational points of an affine or projective algebraic set defined over an extension of a finite field by a system of polynomial equations, including the case where the algebraic set is not defined…
The fixed-point theory and its applications to various areas of science are well known. In this paper we present some existence and uniqueness theorems for fixed circles of self-mappings on metric spaces with geometric interpretation. We…
A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…
A rotation in a Euclidean space V is an orthogonal map on V which acts locally as a plane rotation with some fixed angle. We give a classification of all pairs of rotations in finite-dimensional Euclidean space, up to simultaneous…
For a continuous map on a topological graph containing a loop $S$ it is possible to define the degree (with respect to the loop $S$) and, for a map of degree $1$, rotation numbers. We study the rotation set of these maps and the periods of…
The circle method has been successfully used over the last century to study rational points on hypersurfaces. More recently, a version of the method over function fields, combined with spreading out techniques, has led to a range of results…
Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high dimensional theory has emerged. In this paper these developments…
We investigate complete arcs of degree greater than two, in projective planes over finite fields, arising from the set of rational points of a generalization of the Hermitian curve. The degree of the arcs is closely related to the number of…
We consider the Cartesian product X of n finite intervals of integers and a map F from X to itself. As main result, we establish an upper bound on the number of fixed points for F which only depends on X and on the topology of the positive…
We improve a bound due to the second author on number of rational points on smooth surfaces in $\mathbb{P}^3$ over finite fields and look at families of surfaces that achieve or nearly achieve this bound, for which we compute their exact…
We recall the definition of an r-maximal set in a metric space as a maximal subset of diameter r. In the special case when the metric space is Euclidean such a set is exactly a solid of constant diameter r. In the process of reviewing the…
The present paper is devoted to the study of the combinatorics of 216 maximal $C^3$ circular codes --- a particular type of structure arising in the analysis of genomic sequences. Their circularity property is believed to be intimately…
In spectral clustering, one defines a similarity matrix for a collection of data points, transforms the matrix to get the Laplacian matrix, finds the eigenvectors of the Laplacian matrix, and obtains a partition of the data using the…
We investigate the universality of multi-spin systems in architectures of various symmetries of coupling type and topology. Explicit reachability sets under symmetry constraints are provided. Thus for a given (possibly symmetric)…
Consider a finite l-group acting on the affine space of dimension n over a field k, whose characteristic differs from l. We prove the existence of a fixed point, rational over k, in the following cases: --- The field k is p-special for some…
Motivated by a recent question of Peyre, we apply the Hardy-Littlewood circle method to count "sufficiently free" rational points of bounded height on arbitrary smooth projective hypersurfaces of low degree that are defined over the…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…
We propose a simple criterion to know if an abelian variety $A$ defined over a finite field $\mathbb{F}_q$ is cyclic, i.e., it has a cyclic group of rational points; this criterion is based on the endomorphism ring End$_{\mathbb{F}_q}(A)$.…