Related papers: On the Frobenius complexity of determinantal rings

We consider the notions of (i) critical points, (ii) second-order points, (iii) local minima, and (iv) strict local minima for multivariate polynomials. For each type of point, and as a function of the degree of the polynomial, we study the…

We study the geometry and partial differential equations arising from the consideration of Frobenius determinants, also called-group-determinants. This leads us to address some aspects of twistor theory as well as some extensions of Bessel…

We obtain two equivalent conditions for m polynomials in n variables to form a p-basis of a ring of constants of some polynomial K-derivation, where K is a UFD of characteristic p>0. One of these conditions involves jacobians, and the…

A Frobenius difference field is an algebraically closed field of characteristic $p>0$, enriched with a symbol for $x \mapsto x^{p^m}$. We study a sentence or formula in the language of fields with a distinguished automorphism, interpreted…

We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…

The Waring Problem over polynomial rings asks how to decompose a homogeneous polynomial $p$ of degree $d$ as a finite sum of $d$-{th} powers of linear forms. In this work we give an algorithm to obtain a real Waring decomposition of any…

We introduce a weighted sum of irreducible character ratios as an estimator for commutator probabilities. The estimator yields Frobenius formula when applied to a regular representation

The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(M_int(N^(1/4) log N)), where M_int(k) denotes the cost of multiplying k-bit integers. This result is due to…

We define a new invariant for a $p$-block, the strong Frobenius number, which we use to address the problem of reducing Donovan's conjecture to normal subgroups of index p. As an application we use the strong Frobenius number to complete…

We investigate Frobenius pairs between categories of comodules over rather general corings. We particularize to the case of the adjoint pair of functors associated to a morphism of corings over different base rings, which leads to a…

This note deals with the computation of the factorization number $F_2(G)$ of a finite group $G$. By using the M\"{o}bius inversion formula, explicit expressions of $F_2(G)$ are obtained for two classes of finite abelian groups, improving…

In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…

In this paper we will give a global description of the Frobenius for the division fields of an elliptic curve E which is strictly analogous to the cyclotomic case. This is then applied to determine the splitting of a prime p in subfields of…

The purpose of this note is to relate certain ring-theoretic properties of rings in mixed and positive characteristics that are related to each other by a tilting operation used in perfectoid geometry. To this aim, we exploit the…

We study the $K$-Fibonacci sequence $\mathcal{F}_p$ modulo prime $p$. Cardinalities of sets $|\mathcal{F}_p+\mathcal{F}_p|$ and $|\mathcal{F}_p\cdot\mathcal{F}_p|$ are estimated. We present the method of estimating doubling constant of some…

Let $R$ be a commutative Noetherian ring of prime characteristic $p$. The main goal of this paper is to study in some detail when \[ \overline{W^R}:=\{\mathfrak{p}\in\operatorname{Spec} (R):\ \mathcal{F}^{E_{\mathfrak{p}}}\text{ is finitely…

We show that the complexity of the Lie module $\mathrm{Lie}(n)$ in characteristic $p$ is bounded above by $m$ where $p^m$ is the largest $p$-power dividing $n$ and, if $n$ is not a $p$-power, is equal to the maximum of the complexities of…

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

We count numbers of tame frieze patterns with entries in a finite commutative local ring. For the ring $\mathbb{Z}/p^r\mathbb{Z}$, $p$ a prime and $r\in\mathbb{N}$ we obtain closed formulae for all heights. These may be interpreted as…