Related papers: Hypergeometric functions for Dirichlet characters …

Fixing an arithmetic lattice $\Gamma$ in an algebraic group $G$, the commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ with $[\Gamma : \Gamma \cap \Delta] [\Delta: \Gamma \cap \Delta] =…

Let $\Sigma$ be a finite type surface, and $G$ a complex algebraic simple Lie group with Lie algebra $\mathfrak{g}$. The quantum moduli algebra of $(\Sigma,G)$ is a quantization of the ring of functions of $X_G(\Sigma)$, the variety of…

Given a symmetric pair $(G,K)=(\mathrm{GL}_{p+q}(\mathbb{C}),\mathrm{GL}_{p}(\mathbb{C})\times \mathrm{GL}_{q}(\mathbb{C}))$ of type AIII, we consider the diagonal action of $K$ on the double flag variety…

Let $q$ be an odd power of a prime $p\in \mathbb{N}$, and $\mathrm{PPSP}(\sqrt{q})$ be the finite set of isomorphism classes of principally polarized superspecial abelian surfaces in the simple isogeny class over $\mathbb{F}_q$…

We study an analogue of the Herbrand-Ribet theorem, and its refinement by Mazur and Wiles, in graph theory. For an odd prime number $p$, we let $\mathbb{F}_{p}$ and $\mathbb{Z}_{p}$ denote the finite field with $p$ elements and the ring of…

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

Let $G$ be a simple graph and let $L(G)$ denote the \emph{line graph} of $G$. A \emph{$p$-independent} set in $G$ is a set of vertices $S \subseteq V(G)$ such that the subgraph induced by $S$ has maximum degree at most $p$. The…

The Golomb--Keller formula expresses the next prime $p_{n+1}$ as a recurrence relation in terms of the first $n$ primes $p_1, \ldots, p_n$ using the Riemann zeta function and an Euler product, but requires taking a limit as $s \to \infty$,…

The $k$-th $p$-power of a graph $G$ is the graph on the vertex set $V(G)^k$, where two $k$-tuples are adjacent iff the number of their coordinates which are adjacent in $G$ is not congruent to 0 modulo $p$. The clique number of powers of…

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

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…

We define special cycles on arithmetic models of twisted Hilbert-Blumenthal surfaces at primes of good reduction. These are arithmetic versions of these cycles. In particular, we characterize the non-degenerate intersections and partially…

Let $\Gamma_k(V)$ be the Grassmann graph whose vertex set ${\mathcal G}_{k}(V)$ is formed by all $k$-dimensional subspaces of an $n$-dimensional vector space $V$ over the finite field $F_q$ consisting of $q$ elements. We discuss its…

small In this paper, we define $q$-analogues of Dirichlet's beta function at positive integers, which can be written as $\beta_q(s)=\sum_{k\geq1}\sum_{d|k}\chi(k/d)d^{s-1}q^k$ for $s\in\N^*$, where $q$ is a complex number such that $|q|<1$…

For $q = p^n$ with $p$ an odd prime, the projective linear group $PGL(2,q)$ can be seen as the stabilizer of a conic $O$ in a projective plane $\pi = PG(2,q)$. In that setting, involutions of $PGL(2,q)$ correspond bijectively to points of…

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

Graph pebbling is a combinatorial game played on an undirected graph with an initial configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling…

The directed power graph $\vec{\mathcal P}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph of $\mathbf G$, denoted by $\mathcal P(\mathbf G)$,…

In this paper, we study the unit graph $ G(\mathbb{Z}_n) $, where $ n $ is of the form $n = p_1^{n_1} p_2^{n_2} \dots p_r^{n_r}$, with $ p_1, p_2, \dots, p_r $ being distinct prime numbers and $ n_1, n_2, \dots, n_r $ being positive…

Given a graph G, a subset M of V (G) is a module of G if for each v \in V (G) \diagdownM, v is adjacent to all the elements of M or to none of them. For instance, V(G), \varnothing and {v} (v \in V(G)) are modules of G called trivial. Given…