中文
相关论文

相关论文: Counting distinct functional graphs from linear fi…

200 篇论文

We use Maynard's methods to show that there are bounded gaps between primes in the sequence $\{\lfloor n\alpha\rfloor\}$, where $\alpha$ is an irrational number of finite type. In addition, given a superlinear function $f$ satisfying some…

数论 · 数学 2014-07-08 Lynn Chua , Soohyun Park , Geoffrey D. Smith

Given a prime power $q$ and an integer $n\geq2$, we establish a sufficient condition for the existence of a primitive pair $(\alpha,f(\alpha))$ where $\alpha \in \mathbb{F}_q$ and $f(x) \in \mathbb{F}_q(x)$ is a rational function of degree…

数论 · 数学 2019-10-01 Stephen D. Cohen , Hariom Sharma , Rajendra Sharma

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

数论 · 数学 2023-05-04 Dor Elboim , Ofir Gorodetsky

A topological graph is $k$-quasi-planar if it does not contain $k$ pairwise crossing edges. A 20-year-old conjecture asserts that for every fixed $k$, the maximum number of edges in a $k$-quasi-planar graph on $n$ vertices is $O(n)$. Fox…

组合数学 · 数学 2016-01-28 Andrew Suk , Bartosz Walczak

The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that the series of independence numbers in strong powers of a fixed…

信息论 · 计算机科学 2016-11-17 Noga Alon , Eyal Lubetzky

Let $\mathbb {F}_q$ be finite field with $q$ elements. Let $\alpha\leqslant n$ be positive integers. Consider the general linear group $\mathrm{GL}(\alpha+n, \mathbb {F}_q) $ and its subgroup $H(n)$, which fixes the first $\alpha$ basis…

表示论 · 数学 2025-08-25 Yury A. Neretin

We discuss $Q(n)$, the number of ways a given integer $n$ may be written as a sum of distinct primes, and study its asymptotic form $Q_{as}(n)$ valid in the limit $n\to\infty$. We obtain $Q_{as}(n)$ by Laplace inverting the fermionic…

数论 · 数学 2021-05-11 M. V. N. Murthy , M. Brack , R. K. Bhaduri

We consider homogeneous factor models on uniformly sparse graph sequences converging locally to a (unimodular) random tree $T$, and study the existence of the free energy density $\phi$, the limit of the log-partition function divided by…

概率论 · 数学 2013-12-17 Amir Dembo , Andrea Montanari , Nike Sun

We study the class of functions on Lipschitz-graph domains satisfying a differential-oscillation condition and show that such functions are $\epsilon$-approximable. As a consequence we obtain the quantitative Fatou theorem in the spirit of…

偏微分方程分析 · 数学 2024-12-18 Tomasz Adamowicz , María J. González , Marcin Gryszówka

Given a prime power $q$ and a positive integer $n$, let $\mathbb{F}_{q^{n}}$ represents a finite extension of degree $n$ of the finite field ${\mathbb{F}_{q}}$. In this article, we investigate the existence of $m$ elements in arithmetic…

Let $p$ be a prime, $e$ a positive integer, $q = p^e$, and let $\mathbb{F}_q$ denote the finite field of $q$ elements. Let $f_i : \mathbb{F}_q^2\to\mathbb{F}_q$ be arbitrary functions, where $1\le i\le l$, $i$ and $l$ are integers. The…

组合数学 · 数学 2018-07-31 Alex Kodess , Felix Lazebnik

We study number theoretic properties of the map $x \mapsto x^{x} \mod{p}$, where $x \in \{1,2,\ldots,p-1\}$, and improve on some recent upper bounds, due to Kurlberg, Luca, and Shparlinski, on the number of primes $p < N$ for which the map…

数论 · 数学 2017-07-05 Adam Tyler Felix , Pär Kurlberg

The supersaturation problem for a given graph $F$ asks for the minimum number $h_F(n,q)$ of copies of $F$ in an $n$-vertex graph with $ex(n,F)+q$ edges. Subsequent works by Rademacher, Erd\H{o}s, and Lov\'{a}sz and Simonovits determine the…

组合数学 · 数学 2023-10-13 Jie Ma , Long-Tu Yuan

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…

群论 · 数学 2022-07-19 Davide Sclosa

Let $\chi$ be a non-principal Dirichlet character of modulus $q$ with associated \textit{L}-function $L(s,\chi)$. We prove that $$|L(1,\chi)|\le\left(\frac{1}{2}+O\Big(\frac{\log\log q}{\log q}\Big)\right)\frac{\varphi(q)}{q}\log q\,,$$…

数论 · 数学 2025-03-11 Jeffery Ezearn

We show that the Waring's number over a finite field $\mathbb{F}_q$, denoted $g(k,q)$, when exists, coincides with the diameter of the generalized Paley graph $\Gamma(k,q)=Cay(\mathbb{F}_{q},R_k)$ with $R_k=\{x^k : x\in \mathbb{F}_q^*\}$.…

数论 · 数学 2021-01-06 Ricardo A. Podestá , Denis E. Videla

In this paper we deal with two aspects of the minimum rank of a simple undirected graph $G$ on $n$ vertices over a finite field $\FF_q$ with $q$ elements, which is denoted by $\mr(\FF_q,G)$. In the first part of this paper we show that the…

组合数学 · 数学 2010-07-21 Shmuel Friedland , Raphael Loewy

In this paper, it is proved that there is an arithmetic progression of positive integers such that each of which is expressible neither as $p+F_m$ nor as $q+L_n$, where $ p,q $ are primes, $ F_m $ denotes the $ m $-th Fibonacci number and $…

综合数学 · 数学 2025-06-17 Rui-Jing Wang

For given graphs $G$ and $H$, let $|Hom(G,H)|$ denote the set of graph homomorphisms from $G$ to $H$. We show that for any finite, $n$-regular, bipartite graph $G$ and any finite graph $H$ (perhaps with loops), $|Hom(G,H)|$ is maximum when…

组合数学 · 数学 2012-06-15 David Galvin , Prasad Tetali

We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…