Related papers: On the Polya permanent problem over finite fields

A polynomial $f(x)$ over a field $K$ is said to be stable if all its iterates are irreducible over $K$. L. Danielson and B. Fein have shown that over a large class of fields $K$, if $f(x)$ is an irreducible monic binomial, then it is stable…

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

Let $\mathbb F$ be a field and $P \in \mathbb F [x_1,\ldots, x_n]$ be a homogeneous polynomial such that $|\mathbb F| > \deg(P)$ and $\phi, \psi\colon \mathbb F^n \to \mathbb F^n$ be two maps such that $P(\mathbf{x} + \lambda\mathbf{y}) =…

We show that for two afii varieties over an arbitrary field of characteristic zero, there is no general form of an algorithm for checking the presence of an embedding of one algebraic variety in another. Moreover, we establish this for…

Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

We prove that for writing the 3 by 3 permanent polynomial as a determinant of a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7 matrix is required. Our proof is computer based and uses the enumeration of bipartite…

We prove a dynamical Shafarevich theorem on the finiteness of the set of isomorphism classes of rational maps with fixed degeneracies. More precisely, fix an integer d at least 2 and let K be either a number field or the function field of a…

We consider polynomial maps of affine space over an algebraically closed field of characteristic zero. We prove that every irreducible component of the zero locus of the Jacobian determinant corresponds to either a contracted divisor or a…

In this paper we investigate the permanent of $(-1,1)$-matrices over fields of zero characteristics and our main goal is to provide a sharp upper bound for the value of the permanent of such matrices depending on matrix rank, solving Wang's…

Let S be a polynomial ring over a field of characteristic zero in finitely may variables. Let T be an unramified, finitely generated extension of S with $T^\times = k^\times$. Then T = S.

A form in a polynomial ring over a field is said to be homaloidal if its polar map is a Cremona map, i.e., if the rational map defined by the partial derivatives of the form has an inverse rational map. The object of this work is the search…

We show that any separated essentially finite-type map $f$ of noetherian schemes globally factors as $f = hi$ where $i$ is an injective localization map and $h$ a separated finite-type map. In particular, via Nagata's compactification…

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Let $F$ be a finite set of monomials of the same degree $d\geq 2$ in a polynomial ring $R=k[x_1,...,x_n]$ over an arbitrary field $k$. We give some necessary and/or sufficient conditions for the birationality of the ring extension…

The dominant rational maps of finite degree from a fixed variety to varieties of general type, up to birational isomorphisms, form a finite set. This has been known as the Iitaka-Severi conjecture, and is nowdays an established result, in…

Based on a theorem of Bergman we show that multivariate noncommutative polynomial factorization is deterministic polynomial-time reducible to the factorization of bivariate noncommutative polynomials. More precisely, we show the following:…

Fix a finite field $\mathbb F_q$ and let $A\in \mathbb F_q^{n\times n}$ be a uniformly random $n\times n$ matrix over $\mathbb F_q$. The asymptotic distribution of the determinant $\det(A)$ is well-understood, but the asymptotic…

Form an $n \times n$ matrix by drawing entries independently from $\{\pm1\}$ (or another fixed nontrivial finitely supported distribution in $\mathbf{Z}$) and let $\phi$ be the characteristic polynomial. Conditionally on the extended…