相关论文: On the Frobenius complexity of determinantal rings

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

We characterize the finite groups of minimal order that admit an irreducible complex character of degree $p$ or $p^2$, where $p$ is a prime.

We study the action of the infinite Frobenius on the de Rham fundamental groups of affine curves defined over $\bfR$. As an application, we compute extension classes of real mixed Hodge structures associated with the motivic fundamental…

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…

This article describes the \emph{Macaulay2} package \emph{FrobeniusThresholds}, designed to estimate and calculate $F$-pure thresholds, more general $F$-thresholds, and related numerical invariants arising in the study of singularities in…

In this paper we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integral combination of given relatively prime (strictly) positive integers (known as…

We show that the isomorphism class of a two-step solvable Lie poset subalgebra of a semisimple Lie algebra is determined by its dimension. We further establish that all such algebras are absolutely rigid.

Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…

We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…

A formula expressing the fermionic determinant as an infinite product of smaller determinants is derived and discussed. These smaller determinants are of a fixed size, independent of the size of the lattice and are indexed by loops of…

We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

For a prime $p$, let $E_{p,p^m}=\{\begin{pmatrix}a&b\\p^{m-1}c&d\end{pmatrix}|a,b,c\in\mathbb{Z}_{p},~\mathrm{and}~d\in \mathbb{Z}_{p^{m}}\}$. We first establish a ring isomorphism from $\mathrm{End}(\mathbb{Z}_p\times\mathbb{Z}_p^m)$ onto…

Let R be a ring of polynomials in a finite number of variables over a perfect field k of characteristic p>0 and let F:R\to R be the Frobenius map of R, i.e. F(r)=r^p. We explicitly describe an R-module isomorphism Hom_R(F_*(M),N)\cong…

Let K/Q be Galois, and let eta in K* whose conjugates are multiplicatively independent. For a prime p, unramified, prime to eta, let np be the residue degree of p and gp the number of P I p, then let o\_P(eta) and o\_p(eta) be the orders of…

We compute the degree complexity of a family of birational mappings of the plane with high order singularities.

Suppose that m is a positive integer, not a perfect square. We present a formula solution to the 2-variable Frobenius problem in Z[\sqrt m] of the "first kind" ([3]).

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

We investigate commutative Noetherian rings of prime characteristic such that the Frobenius functor applied to any injective module is again injective. We characterize the class of one-dimensional local rings with this property and show…

We consider rotations on the torus $\mathbb{T}^2$, and we classify them with respect to the complexity functions. In dimension one, a minimal rotation can be coded by a sturmian word. A sturmian word has complexity $n+1$ by the…