Related papers: On the Frobenius complexity of determinantal rings

We introduce a new invariant for local rings of prime characteristic, called Frobenius complexity, that measures the abundance of Frobenius actions on the injective hull of the residue field of a local ring. We present an important case…

We study the Frobenius complexity of Hibi rings over fields of characteristic $p > 0$. In particular, for a certain class of Hibi rings (which we call $\omega^{(-1)}$-level), we compute the limit of the Frobenius complexity as $p…

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

By an elementary observation about the computation of the difference of squares for large in- tegers, deterministic quadratic Frobenius probable prime tests are given with running times of approximately 2 selfridges.

The classical Frobenius problem is to find the largest integer that cannot be written as a linear combination of a given set of positive, coprime integers using nonnegative integer coefficients. Prior work has generalized the classical…

We define the Frobenius limit of a module over a ring of prime characteristic to be the limit of the normalized Frobenius direct images in a certain Grothendieck group. When a finite group acts on a polynomial ring, we calculate this limit…

The Frobenius complexity of a local ring $R$ measures asymptotically the abundance of Frobenius operators of order $e$ on the injective hull of the residue field of $R$. It is known that, for Stanley-Reisner rings, the Frobenius complexity…

Expanding on recent results of another an algorithm is presented that provides solution to the Frobenius Coin Problem in worst case O(n^2) in the magnitude of the largest denomination.

We explicitly describe the Cartier dual of the $l$-th Frobenius kernel $N_l$ of the deformation group scheme, which deforms the additive group scheme to the multiplicative group scheme. Then the Cartier dual of $N_l$ is given by a certain…

Recently, the regular local rings of prime characteristic were characterized in terms of the finiteness of injective dimension of the Frobenius map. We obtain relative versions of this result.

We show that an irreducible ordinary differential equation on the projective line has a Frobenius structure for a power of some prime p if it is rigid in the sense of Katz and satisfies some other reasonable (and necessary) conditions…

Let $R$ be a standard graded finitely generated algebra over an $F$-finite field of prime characteristic, localized at its maximal homogeneous ideal. In this note, we prove that that Frobenius complexity of $R$ is finite. Moreover, we…

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

We classify Frobenius forms, a special class of homogeneous polynomials in characteristic $p>0$, in up to five variables over an algebraically closed field. We also point out some of the similarities with quadratic forms.

Two classical rings of invariants are shown to be Frobenius split: for the special linear group acting on the direct sum of several copies of the defining representation and several copies of the dual of the defining representation; and for…

A class of binary sequences with period $2p$ is constructed using generalized cyclotomic classes, and their linear complexity, minimal polynomial over ${\mathbb{F}_{{q}}}$ as well as 2-adic complexity are determined using Gauss period and…

We construct a reduction which proves that the fooling set number and the determinantal rank of a Boolean matrix are NP-hard to compute.

A difference equation based method of determining two factors of a composite is presented. The feasibility of P-complexity is shown. Presentation of material is non-theoretical; intended to be accessible to a broader audience of non…

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…

Let $G$ be a group and $\alpha: G \times G \to G$ denote the commutator map. In the case of finite groups, Frobenius gave the formula to compute the cardinalities of the fibres $\alpha^{-1}(g)$ in terms of the character values $\chi(g)$ for…