An elementary proof of Bridy's theorem

Authors

Manon Stipulanti (ORCID: https://orcid.org/0000-0002-2805-2465)
Eric Rowland (ORCID: https://orcid.org/0000-0002-0359-8381)
Reem Yassawi (ORCID: https://orcid.org/0000-0001-9976-2475)

Publication Details

Journal: Finite Fields and Their Applications
Published: 2025-03-26
DOI: https://doi.org/10.1016/j.ffa.2025.102621
Primary Topic: Computability, Logic, AI Algorithms
Type: article
Field-Weighted Citation Impact: 0.00

Funders

Fonds De La Recherche Scientifique - FNRS
Engineering and Physical Sciences Research Council

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

An elementary proof of Bridy's theorem

Manon Stipulanti, Eric Rowland, Reem Yassawi

Mar 26, 2025

1 links

Finite Fields and Their Applications

Computability, Logic, AI Algorithms

article

An elementary proof of Bridy's theorem

Manon Stipulanti, Eric Rowland, Reem Yassawi

March 26, 2025article en

Abstract

No abstract available for this paper.

Finite Fields and Their ApplicationsVol. 105

Fonds De La Recherche Scientifique - FNRS, Engineering and Physical Sciences Research Council

Openalex Percentile: Top 93%

Computability, Logic, AI Algorithms

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An elementary proof of Bridy's theorem — Manon Stipulanti, Eric Rowland, et al. · Finite Fields and Their Applications (2025) | TGRS Research Map | TGRS