English
Related papers

Related papers: On the Polya permanent problem over finite fields

200 papers

This paper deepens the connections between critically finite rational maps and finite subdivision rules. The main theorem is that if f is a critically finite rational map with no periodic critical points, then for any sufficiently large…

Dynamical Systems · Mathematics 2007-05-23 J. W. Cannon , W. J. Floyd , W. R. Parry

We prove that every mapping torus of any free group endomorphism is residually finite. We show how to use a not yet published result of E. Hrushovski to extend our result to arbitrary linear groups. The proof uses algebraic self-maps of…

Group Theory · Mathematics 2009-11-10 Alexander Borisov , Mark Sapir

In this paper, we study the complexity of computing the determinant of a matrix over a non-commutative algebra. In particular, we ask the question, "over which algebras, is the determinant easier to compute than the permanent?" Towards…

Computational Complexity · Computer Science 2018-10-09 Steve Chien , Prahladh Harsha , Alistair Sinclair , Srikanth Srinivasan

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

Combinatorics · Mathematics 2015-06-25 Joshua Hallam , Bruce E. Sagan

Let $A$ be a set in a prime field $\mathbb{F}_p$. In this paper, we prove that $d\times d$ matrices with entries in $A$ determine almost $|A|^{3+\frac{1}{45}}$ distinct determinants and almost $|A|^{2-\frac{1}{6}}$ distinct permanents when…

Combinatorics · Mathematics 2019-08-14 Doowon Koh , Thang Pham , Chun-Yen Shen , Le Anh Vinh

It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.

Representation Theory · Mathematics 2019-10-01 Victor G. Kac

We describe a deterministic process to associate a practical, permanent label to isomorphism classes of abelian varieties defined over finite fields with commutative endomorphism algebra as long as they are ordinary or defined over a prime…

Number Theory · Mathematics 2025-08-04 Edgar Costa , Taylor Dupuy , Stefano Marseglia , David Roe , Christelle Vincent

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

Logic · Mathematics 2021-09-30 Jakub Gismatullin , Katarzyna Tarasek

A field $K$ in a ring language $\mathcal{L}$ is finitely undecidable if $\mbox{Cons}(\Sigma)$ is undecidable for every nonempty finite $\Sigma \subseteq \mbox{Th}(K; \mathcal{L})$. We extend a construction of Ziegler and (among other…

Logic · Mathematics 2023-07-21 Brian Tyrrell

We use group theory to construct infinite families of maps on surfaces which are invariant under Wilson's map operations of order 3 but not under the operations of order 2, such as duality and Petrie duality.

Combinatorics · Mathematics 2009-11-16 Gareth A. Jones , Andrew Poulton

Adopting the approach of [7] we study rational function carrying invariant line fields on the Julia set. In particular, we show that under certain weak conditions all possible measurable invariant line fields of a rational function on its…

Dynamical Systems · Mathematics 2024-08-28 Genadi Levin

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $f \in \mathbb{F}_{q}[x]$ be a polynomial of degree $d > 0$. Denote the image set of this polynomial as $V_{f}=\{f(\alpha)\mid\alpha\in\mathbb{F}_{q}\}$ and denote the…

Number Theory · Mathematics 2026-02-04 Jiyou Li , Zhiyao Zhang

Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for…

Commutative Algebra · Mathematics 2014-02-13 Tovohery Hajatiana Randrianarisoa

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

We study the question of algebraic rank or transcendence degree preserving homomorphisms over finite fields. This concept was first introduced by Beecken, Mittmann and Saxena (2013), and exploited by them, and Agrawal, Saha, Saptharishi and…

Computational Complexity · Computer Science 2022-12-14 Prerona Chatterjee , Ramprasad Saptharishi

We prove that the first-order theory of any function field K of characteristic p>2 is undecidable in the language of rings without parameters. When K is a function field in one variable whose constant field is algebraic over a finite field,…

Number Theory · Mathematics 2008-02-27 Kirsten Eisentraeger , Alexandra Shlapentokh

We have considered a Fraisse class of finitely generated ordered real fields with a colour predicate. A predimension map is defined on finite sets and the Fraisse limit of the class is axiomatized by a theory $T$, which is proved to be…

Logic · Mathematics 2022-04-29 Mohsen Khani , Massoud Pourmahdian

When $k$ is a finite field, Becker-Denef-Lipschitz (1979) observed that the total residue map $\text{res}:k(\!(t)\!)\to k$, which picks out the constant term of the Laurent series, is definable in the language of rings with a parameter for…

Logic · Mathematics 2023-07-12 Konstantinos Kartas

We exhibit an explicit formula for the cardinality of solutions to a class of quadratic matrix equations over finite fields. We prove that the orbits of these solutions under the natural conjugation action of the general linear groups can…

Rings and Algebras · Mathematics 2024-03-01 Yin Chen , Xinxin Zhang

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

Computational Complexity · Computer Science 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena
‹ Prev 1 3 4 5 6 7 10 Next ›