Related papers: On the Frobenius complexity of determinantal rings

Using the description of the Frobenius limit of modules over the ring of invariants under an action of a finite group on a polynomial ring over a field of characteristic $p>0$ developed by Symonds and the author, we give a characterization…

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

Let $R$ be a ring of prime characteristic $p$, and let $F^e_* R$ denote $R$ viewed as an $R$-module via the $e$th iterated Frobenius map. Given a surjective map $\phi : F^e_* R \to R$ (for example a Frobenius splitting), we exhibit an…

Let $(R, \frak m)$ be a local ring of prime characteristic $p$ and of dimension $d$ with the embedding dimension $v$, type $s$ and the Frobenius test exponent for parameter ideals $\mathrm{Fte}(R)$. We will give an upper bound for the…

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

Let $k$ be a locally compact complete field with respect to a discrete valuation $v$. Let $\oo$ be the valuation ring, $\m$ the maximal ideal and $F(x)\in\oo[x]$ a monic separable polynomial of degree $n$. Let $\delta=v(\dsc(F))$. The…

In this paper we determine the straight-line complexity of $n!$ for $n\leq 22$ and give bounds for the complexities up to $n=46$. In the same way we determine the straight-line complexity of the product of the first primes up to $p=31$ and…

Some Wiener--Hopf determinants on [0,s] are calculated explicitly for all s>0. Their symbols are zero on an interval and they are related to the determinant with the sine-kernel appearing in the random matrix theory. The determinants are…

We extend the famous diophantine Frobenius problem to the case of polynomials over a field $k$. Similar to the classical problem, we show that the $n=2$ case of the Frobenius problem for polynomials is easy to solve. In addition, we…

In this paper we give an explicit solution to the rank constrained matrix approximation in Frobenius norm, which is a generalization of the classical approximation of an m by n matrix A by a matrix of rank k at most.

In a previous paper we studied ``weakly primitive axial algebras'' with respect to more general fusion rules, for which at least one axis satisfies the fusion rules. In this continuation, a concise description is provided of the…

In the ring R=K[X,Y,Z]/(X^3+Y^3+Z^3), where K is a field of prime characteristic p other than 3, determining the tight closure of the ideal (X^2, Y^2, Z^2)R had existed as a classic example of the difficulty involved in tight closure…

The numerical radius of the general $2\times2$ complex matrix is calculated.

Let $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…

Let $(R,\frak m)$ be a generalized Cohen-Macaulay local ring of prime characteristic $p$. In this paper we give a sharp bound for the Frobenius test exponent of parameter ideals. Namely, we prove that $$\mathrm{Fte}(R) \le \lceil…

We design an algorithm for computing the $p$-curvature of a differential system in positive characteristic $p$. For a system of dimension $r$ with coefficients of degree at most $d$, its complexity is $\softO (p d r^\omega)$ operations in…

Monier and Rabin proved that an odd composite can pass the Strong Probable Prime Test for at most $\frac 14$ of the possible bases. In this paper, a probable prime test is developed using quadratic polynomials and the Frobenius…

In many simple integral domains, such as $\mathbb{Z}$ or $\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact…

We continue to investigate binary sequence $(f_u)$ over $\{0,1\}$ defined by $(-1)^{f_u}=\left(\frac{(u^w-u^{wp})/p}{p}\right)$ for integers $u\ge 0$, where $\left(\frac{\cdot}{p}\right)$ is the Legendre symbol and we restrict…

In order to study graded Frobenius algebras from a ring theoretical perspective, we introduce graded quasi-Frobenius rings, graded Frobenius rings and a shift-version of the latter ones, and we investigate the structure and representations…