English
Related papers

Related papers: Counting distinct functional graphs from linear fi…

200 papers

Let $ (G_n)_{n=0}^{\infty} $ be a non-degenerate linear recurrence sequence with power sum representation $ G_n = a_1(n) \alpha_1^n + \cdots + a_t(n) \alpha_t^n $. In this paper we will prove a function field analogue of the well known…

Number Theory · Mathematics 2023-06-22 Clemens Fuchs , Sebastian Heintze

In this paper, the logarithmically complete monotonicity property for a functions involving $q$-gamma function is investigated for $q\in(0,1).$ As applications of this results, some new inequalities for the $q$-gamma function are…

Classical Analysis and ODEs · Mathematics 2016-07-12 Khaled Mehrez

Let F_q be the finite field of q elements. Let H be a multiplicative subgroup of F_q^*. For a positive integer k and element b\in F_q, we give a sharp estimate for the number of k-element subsets of H which sum to b.

Number Theory · Mathematics 2011-01-04 Guizhen Zhu , Daqing Wan

Let $ n, q $ be positive integers. We show that if $ G $ is a finitely generated residually finite group satisfying the identity $ [x,_ny^q]\equiv 1, $ then there exists a function $ f(n) $ such that $ G $ has a nilpotent subgroup of finite…

Group Theory · Mathematics 2020-02-17 Danilo Silveira

Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…

Information Theory · Computer Science 2008-07-01 Salim Y. El Rouayheb , C. N. Georghiades , E. Soljanin , A. Sprintson

Given a group $G$, let us connect two non-identity elements by an edge if and only if one is a power of another. This gives a graph structure on $G$ minus identity, called the reduced power graph. It is conjectured by Akbari and Ashrafi…

Group Theory · Mathematics 2022-07-12 Yilong Yang

For prime powers q, let s(q) denote the probability that a randomly-chosen principally-polarized abelian surface over the finite field F_q is not simple. We show that there are positive constants B and C such that for all q, B (log…

Number Theory · Mathematics 2020-02-27 Jeff Achter , Everett W. Howe

We investigate additive cyclic codes over the alphabet $\mathbb{F}_{q}\mathbb{F}_{q^2}$, where $q$ is a prime power. First, its generator polynomials and minimal spanning set are determined. Then, examples of $\mathbb{F}_{q^2}$-additive…

Information Theory · Computer Science 2025-11-05 Ankit Yadav , Ritumoni Sarma

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt

We consider uniformly random strictly upper-triangular matrices in $\operatorname{Mat}_n(\mathbb{F}_q)$. For such a matrix $A_n$, we show that $n-\operatorname{rank}(A_n) \approx \log_q n$ as $n \to \infty$, and find that the fluctuations…

Probability · Mathematics 2026-01-14 Roger Van Peski

The main result of the paper is the following theorem. Let $q$ be a prime, $n$ a positive integer and $A$ an elementary abelian group of order $q^2$. Suppose that $A$ acts coprimely on a finite group $G$ and assume that for each $a\in…

Group Theory · Mathematics 2016-02-05 Pavel Shumyatsky , Danilo Sanção da Silveira

We resolve a 1983 question of Serre by constructing curves with many points of every genus over every finite field. More precisely, we show that for every prime power q there is a positive constant c_q with the following property: for every…

Algebraic Geometry · Mathematics 2007-05-23 Noam D. Elkies , Everett W. Howe , Andrew Kresch , Bjorn Poonen , Joseph L. Wetherell , Michael E. Zieve

The recently developed notion of action convergence by Backhausz and Szegedy unifies and generalises the dense (graphon) and local-global (graphing) convergences of graph sequences. This is done through viewing graphs as operators and…

Combinatorics · Mathematics 2022-10-20 Aranka Hrušková

We show that the digraph of a nondeterministic finite automaton witnessing the automatic complexity of a word can always be taken to be planar. In the case of total transition functions studied by Shallit and Wang, planarity can fail. Let…

Formal Languages and Automata Theory · Computer Science 2019-02-05 Achilles A. Beros , Bjørn Kjos-Hanssen , Daylan Kaui Yogi

Let $n\ge 2$ be an integer and let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a prime power. Given $\mathbb F_q$-affine hyperplanes $\mathcal A_1, \ldots, \mathcal A_n$ of $\mathbb F_{q^n}$ in general position, we…

Number Theory · Mathematics 2021-04-22 Arthur Fernandes , Lucas Reis

It is known that there is no finitely presented group for which the Dehn function lies asymptotically strictly between linear and quadratic functions. This work presents an example of a semigroup that has Dehn function equivalent to $n \log…

Group Theory · Mathematics 2024-04-29 Roman Repeev

We investigate the structure of the monoid of endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers. We show that for any countable linearly ordered set $\Omega$, there are uncountably many maximal subgroups of…

Group Theory · Mathematics 2018-07-04 Jillian D. McPhee , James D. Mitchell , Martyn Quick

Let $q$ be an odd prime power and let $\F_q$ be the finite field with $q$ elements. Let $\mathcal{P}(n)$ be the set of monic irreducible polynomials of degree $n$ over $\mathbb{F}_q$. For $f=t^n+f_{n-1}t^{n-1}+\cdots+f_0\in\mathcal{P}(n)$,…

Number Theory · Mathematics 2026-05-26 Kaimin Cheng

We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality $q^n$, our algorithm takes $$n^{1+o(1)} \log^{1+o(1)}q + \max_{\ell}…

Data Structures and Algorithms · Computer Science 2018-08-15 Anand Kumar Narayanan

We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…

Functional Analysis · Mathematics 2023-01-06 Daniel Lenz , Simon Puchert , Marcel Schmidt
‹ Prev 1 3 4 5 6 7 10 Next ›