Generalized point configurations in Fqd

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications Pub Date : 2024-08-08 DOI:10.1016/j.ffa.2024.102472

引用次数: 0

Abstract

In this paper, we generalize [6], [1], [5] and [3] by allowing the distance between two points in a finite field vector space to be defined by a general non-degenerate bilinear form or quadratic form. We prove the same bounds on the sizes of large subsets of $F_{q}^{d}$ for them to contain distance graphs with a given maximal vertex degree, under the more general notion of distance. We also prove the same results for embedding paths, trees and cycles in the general setting.

查看原文本刊更多论文

Fqd 中的广义点配置

在本文中，我们对 [6]、[1]、[5] 和 [3] 进行了概括，允许有限域向量空间中两点之间的距离由一般的非退化双线性方程或二次方程定义。在更一般的距离概念下，我们证明了 Fqd 大子集的大小的相同边界，即这些子集包含具有给定最大顶点度的距离图。我们还证明了一般情况下嵌入路径、树和循环的相同结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Finite Fields and Their Applications 数学-数学

CiteScore

2.00

自引率

20.00%

发文量

133

审稿时长

6-12 weeks

期刊介绍： Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering. For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods. The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.