Related papers: Arithmetic-geometric mean sequences over finite fi…

We describe the cutting sequences associated to geodesic flow on regular polygons, in terms of a combinatorial process called "derivation." This work is an extension of some of the ideas and results in Smillie and Ulcigrai's recent paper,…

We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs…

This paper, in considering aspects of the geometric mean sequence, offers new results connecting generalized Tribonacci and third-order Horadam numbers which are established and then proved independently.

With the help of hypergeometric functions over finite fields, we study some arithmetic properties of cyclotomic matrices involving characters and binary quadratic forms over finite fields. Also, we confirm some related conjectures posed by…

We introduce Graphical Algebraic Geometry (GAG), a family of diagrammatic languages extending the Graphical Linear Algebra programme. We construct several languages within this family and prove that they are universal and complete for the…

Let $q$ be a prime power and $\mathbb{F}_q$ be a finite field with $q$ elements. Let $e$ and $d$ be positive integers. In this paper, for $d\geq2$ and $q\equiv1(\mathrm{mod}~ed(d-1))$, we calculate the number of points on an algebraic curve…

Arithmetical properties of a finite group are properties of the group which are defined by its arithmetical parameters such as the order of the group, the element orders and so on. In this paper, we discuss a number of results on…

We introduce the framework of continuous--depth graph neural networks (GNNs). Graph neural ordinary differential equations (GDEs) are formalized as the counterpart to GNNs where the input-output relationship is determined by a continuum of…

We study the set of common $\mathbb{F}_q$-rational solutions of "smooth" systems of multivariate symmetric polynomials with coefficients in a finite field $\mathbb{F}_q$. We show that, under certain conditions, the set of common solutions…

Let G be a linear algebraic group defined over a finite field F_q. We present several connections between the isogenies of G and the finite groups of rational points G(F_q^n). We show that an isogeny from G' to G over F_q gives rise to a…

Szemer\'edi's regularity lemma is a powerful tool in graph theory. It states that for every large enough graph, there exists a partition of the edge set with bounded size such that most induced subgraphs are quasirandom. When the graph is a…

For $q\in\mathbb{R}$, the $Q$-matrix $Q=Q_q$ of a connected simple graph $G=(V,E)$ is $Q_q=(q^{\partial(x,y)})_{x,y\in V}$, where $\partial$ denotes the path-length distance. Describing the set $\pi(G)$ consisting of those $q\in \mathbb{R}$…

We establish a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. At the center of this framework lies the concept of a $\leqslant$-parametric graph:…

In 2022, S.D. Cohen and the two authors introduced and studied the concept of $(r, n)$-freeness on finite cyclic groups $G$ for suitable integers $r, n$, which is an arithmetic way of capturing elements of special forms that lie in the…

A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…

Let $A$ be a sufficiently dense subset of a finite field $\mathbb F_q$ or a finite, cyclic ring $\mathbb Z/ N\mathbb Z$. Assuming that $q$ and $N$ have no small prime divisors, we show that generalised Fermat equations have the expected…

In this paper, for $0<\alpha<1$, $p>0$ and positive semidefinite matrices $A,B\ge0$, we consider the quasi-extension $\mathcal{A}_{\alpha,p}(A,B):=((1-\alpha)A^p+\alpha B^p)^{1/p}$ of the $\alpha$-weighted arithmetic matrix mean, and the…

We present new constructions of quasi-cyclic (QC) and generalized quasi-cyclic (GQC) codes from algebraic curves. Unlike previous approaches based on elliptic curves, our method applies to curves that are Kummer extensions of the rational…

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…

We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…