English
Related papers

Related papers: Counting distinct functional graphs from linear fi…

200 papers

We show by a dynamical argument that there is a positive integer valued function $q$ defined on positive integer set $\mathbb N$ such that $q([\log n]+1)$ is a super-polynomial with respect to positive $n$ and \[\liminf_{n\rightarrow\infty}…

Dynamical Systems · Mathematics 2021-04-09 Enhui Shi , Hui Xu

Let $p$ be an odd prime, $q=p^e$, $e\ge 1$, and $\mathbb{F} = \mathbb{F_q}$ denote the finite field of $q$ elements. Let $f: \mathbb{F}^2\to \mathbb{F}$ and $g: \mathbb{F}^3\to \mathbb{F}$ be functions, and let $P$ and $L$ be two copies of…

Combinatorics · Mathematics 2021-09-08 Felix Lazebnik , Vladislav Taranchuk

For the quantum integer $[n]_q = 1+q+...+q^{n-1}$ there is a natural polynomial multiplication $*_q$ such that $[m]_q *_q [n]_q = [mn]_q$. This multiplication leads to the functional equation $f_{mn}(q) = f_m(q)f_n(q^m),$ defined on a given…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

For the quantum integer [n]_q = 1+q+q^2+... + q^{n-1} there is a natural polynomial multiplication such that [mn]_q = [m]_q \otimes_q [n]_q. This multiplication is given by the functional equation f_{mn}(q) = f_m(q) f_n(q^m), defined on a…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

Let $\mathbb{F}_q$ be a finite field with $q$ elements and let $n$ be a positive integer. In this paper, we study the digraph associated to the map $x\mapsto x^n h(x^{\frac{q-1}{m}})$, where $h(x)\in\mathbb{F}_q[x].$ We completely determine…

Discrete Mathematics · Computer Science 2022-01-05 José Alves Oliveira , Fabio Enrique Brochero Martínez

In this paper we study the description of the functional graphs associated with the power maps over finite groups. We present a structural result which describes the isomorphism class of these graphs for abelian groups and also for flower…

Discrete Mathematics · Computer Science 2022-09-08 Claudio Qureshi , Lucas Reis

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…

Combinatorics · Mathematics 2013-01-10 Philippe Cara , Sara Rottey , Geertrui Van de Voorde

We study the map from conductances to edge energies for harmonic functions on finite graphs with Dirichlet boundary conditions. We prove that for any compatible acyclic orientation and choice of energies there is a unique choice of…

Probability · Mathematics 2017-12-06 Aaron Abrams , Richard Kenyon

We prove a central limit theorem for the joint distribution of $s_q(A_jn)$, $1\le j \le d$, where $s_q$ denotes the sum-of-digits function in base~$q$ and the $A_j$'s are positive integers relatively prime to $q$. We do this in fact within…

Number Theory · Mathematics 2019-08-16 Michael Drmota , Christian Krattenthaler

In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…

Information Theory · Computer Science 2022-07-18 Tim L. Alderson , Alessandro Neri

Let $A$ be a centrally closed prime algebra over a characteristic 0 field $k$, and let $q:A\to A$ be the trace of a $d$-linear map (i.e., $q(x)=M(x,...,x)$ where $M:A^d\to A$ is a $d$-linear map). If $[q(x),x]=0$ for every $x\in A$, then…

Rings and Algebras · Mathematics 2013-07-10 Matej Brešar , Špela Špenko

A sequence of functions {f_n(q)}_{n=1}^{\infty} satisfies the functional equation for multiplication of quantum integers if f_{mn}(q) = f_m(q)f_n(q^m) for all positive integers m and n. This paper describes the structure of all sequences of…

Number Theory · Mathematics 2016-12-30 Alexander Borisov , Yang Wang , Melvyn B. Nathanson

We improve the bounds on the number of interval graphs on $n$ vertices. In particular, denoting by $I_n$ the quantity in question, we show that $\log I_n \sim n\log n$ as $n\to \infty$.

Combinatorics · Mathematics 2018-10-05 Hüseyin Acan

We examine two counting problems that seem very group-theoretic on the surface but, on closer examination, turn out to concern integers with restrictions on their prime factors. First, given an odd prime $q$ and a finite abelian $q$-group…

Number Theory · Mathematics 2020-07-21 Jenna Downey , Greg Martin

The classification of maximal function fields over a finite field is a difficult open problem, and even determining isomorphism classes among known function fields is challenging in general. We study a particular family of maximal function…

Number Theory · Mathematics 2024-12-09 Jonathan Niemann

Let X be a projective curve defined over Q and t a non-constant Q-rational function on X of degree at least 2. For every integer n pick a point P_n on X such that t(P_n)=n. A result of Dvornicich and Zannier implies that, for large N, among…

Number Theory · Mathematics 2016-09-06 Yuri Bilu , Florian Luca

Let $f(n)$ be a multiplicative function with $|f(n)|\leq 1, q$ be a prime number and $a$ be an integer with $(a, q)=1, \chi$ be a non-principal Dirichlet character modulo $q$. Let $\varepsilon$ be a sufficiently small positive constant, $A$…

Number Theory · Mathematics 2016-11-22 K. Gong , C. Jia , M. A. Korolev

We classify those finite fields $\mathbb{F}_q$, for $q$ a power of some fixed prime number, whose members are the sum of an $n$-potent element with $n>1$ and a 4-potent element. It is shown that there are precisely ten non-trivial pairs…

Rings and Algebras · Mathematics 2025-03-11 Stephen D. Cohen , Peter V. Danchev , Tomás Oliveira e Silva

The power graph and the enhanced power graph of a group $\mathbf G$ are simple graphs with vertex set $G$; two elements of $G$ are adjacent in the power graph if one of them is a power of the other, and they are adjacent in the enhanced…

Combinatorics · Mathematics 2024-04-30 Ivica Bošnjak , Rozália Madarász , Samir Zahirović

We have for positive integers $n$, $k$ and finite field $\mathbb{F}_q$, $c(n,k,q)$, as the number of simultaneous similarity classes of $k$-tuples of commuting $n\times n$ matrices over the $\mathbb{F}_q$. In this paper, it has been shown…

Combinatorics · Mathematics 2021-09-29 Uday Bhaskar Sharma