English
Related papers

Related papers: How to use finite fields for problems concerning i…

200 papers

We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…

Logic in Computer Science · Computer Science 2018-08-16 Daniel Leivant

We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.

Number Theory · Mathematics 2014-03-12 Jean Bourgain , Sergei Konyagin , Igor Shparlinski

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

Information Theory · Computer Science 2015-09-01 Kangquan Li , Longjiang Qu , Xi Chen

The proof of the theorem concerning to the inverse cyclotomic Discrete Fourier Transform algorithm over finite field is provided.

Information Theory · Computer Science 2019-12-24 Sergei V. Fedorenko

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

Logic · Mathematics 2020-07-21 Samuel M. Corson

Fixed points represent equilibrium states, stability, and solutions to a range of problems. It has been an active field of research. In this paper, we provide an overview of the main branches of fixed point theory. We discuss the key…

History and Overview · Mathematics 2023-09-08 Firuz Kamalov , Ho Hon Leung

We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…

Number Theory · Mathematics 2015-10-06 Samrith Ram

We present in this paper a first-order axiomatization of an extended theory $T$ of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation $\fini(t)$ which enables to distinguish between…

Logic in Computer Science · Computer Science 2007-07-02 Khalil Djelloul , Thi-bich-hanh Dao , Thom Fruehwirth

We review various aspects of (infinite) quantum group symmetries in 2D massive quantum field theories. We discuss how these symmetries can be used to exactly solve the integrable models. A possible way for generalizing to three dimensions…

High Energy Physics - Theory · Physics 2007-05-23 Denis Bernard

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Number Theory · Mathematics 2012-10-03 Ayah Almousa , Melanie Matchett Wood

The first aim of this paper is to examine some important properties of soft metric spaces. Second is to introduce soft continuous mappings and investigate properties of soft continuous mappings. Third is to prove some fixed point theorems…

General Mathematics · Mathematics 2013-08-22 Murat I. Yazar , Cigdem Gunduz , Sadi Bayramov

We discuss the use of field theory for the exact determination of universal properties in two-dimensional statistical mechanics. After a compact derivation of critical exponents of main universality classes, we turn to the off-critical…

Statistical Mechanics · Physics 2015-06-12 Gesualdo Delfino

The multiplicative group of a finite field is well known to be cyclic; in this note, we determine the finite fields whose multiplicative groups are direct sum indecomposable. We obtain our classification using a direct argument and also as…

Number Theory · Mathematics 2014-07-15 Sunil Chebolu , Keir Lockridge

In the first part of this article, we consider ruled surfaces defined over a finite field; we introduce invariants for them, and describe some explicit contructions that illustrate possible behaviour of these invariants. In the second part,…

Information Theory · Computer Science 2025-09-24 Régis Blache , Emmanuel Hallouin

A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…

Symbolic Computation · Computer Science 2026-02-11 Jean-Guillaume Dumas , Stefano Lia , John Sheekey

We present here algorithms for efficient computation of linear algebra problems over finite fields.

Symbolic Computation · Computer Science 2013-05-21 Jean-Guillaume Dumas , Clément Pernet

We bound double sums of Kloosterman sums over a finite field ${\mathbb F}_{q}$, with one or both parameters ranging over an affine space over its prime subfield ${\mathbb F}_p \subseteq {\mathbb F}_{q} $. These are finite fields analogues…

Number Theory · Mathematics 2019-03-26 Simon Macourt , Igor E. Shparlinski

In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.

Combinatorics · Mathematics 2024-01-02 Eldar Fischer , Johann A. Makowsky

We complete the first stage of constructing a theory of fields not investigated before; these fields transform according to Lorentz group representations decomposable into an infinite direct sum of finite-dimensional irreducible…

High Energy Physics - Theory · Physics 2007-05-23 L. M. Slad

We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is…

History and Overview · Mathematics 2010-06-22 Chris Preston