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

In this paper we introduce the 2-typical de Rham-Witt complex for arbitrary commutative, unital rings and log-rings. We describe this complex for the rings \Z and \Z_{(2)}, for the log-ring (\Z_{(2)},M) with the canonical log-structure, and…

It is known that if $p$ is a sufficiently large prime then for every function $f:\mathbb{Z}_p\to [0,1]$ there exists a continuous function on the circle $f':\mathbb{T}\to [0,1]$ such that the averages of $f$ and $f'$ across any prescribed…

In this paper, we characterize the (generalized) Frobenius powers and critical exponents of two classes of monomial ideals of a polynomial ring in positive characteristic: powers of the homogeneous maximal ideal, and ideals generated by…

Let $p$ be a prime. In this paper, we compute complexities of some simple modules of symmetric groups labelled by two-part partitions. Most of the simple modules considered here are contained in the $p$-blocks with non-abelian defect…

We consider the distance to the nearest integer of f(p), where f is a quadratic polynomial with irrational leading coefficient. This distance is very small as a function of p, for infinitely many primes p. We give a 14% improvement in the…

We estimate weighted character sums with determinants $ad-bc $ of $2\times 2$ matrices modulo a prime $p$ with entries $a,b,c,d $ varying over the interval $ [1,N]$. Our goal is to obtain nontrivial bounds for values of $N$ as small as…

Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We…

We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…

We survey results produced from the interaction between methods in prime characteristic and combinatorial commutative algebra. We showcase results for edge ideals, toric varieties, Stanley-Reisner rings, and initial ideals that were proven…

In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial. Then, more generally, we also…

We show that, under mild conditions, the (normalized) Frobenius splitting numbers of a local ring of prime characteristic are lower semicontinuous.

Let $A$ be an abelian variety over a finite field $k$ with $|k|=q=p^m$. Let $\pi\in \text{End}_k(A)$ denote the Frobenius and let $v=\frac{q}{\pi}$ denote Verschiebung. Suppose the Weil $q$-polynomial of $A$ is irreducible. When…

A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented…

An affine monoid is an additive monoid which is cancellative, pointed and finitely generated. An affine monoid $\Lambda$ has the partial order defined by $\lambda \le \lambda + \mu$. The Frobenius complex is the order complex of an open…

We study the kernel and cokernel of the Frobenius map on the $p$-typical Witt vectors of a commutative ring, not necessarily of characteristic $p$. We give some equivalent conditions to surjectivity of the Frobenus map on both finite and…

We provide several new results on the sample complexity of vector-valued linear predictors (parameterized by a matrix), and more generally neural networks. Focusing on size-independent bounds, where only the Frobenius norm distance of the…

When decomposing a finite semigroup into a wreath product of groups and aperiodic semigroups, complexity measures the minimal number of groups that are needed. Determining an algorithm to compute complexity has been an open problem for…

Let R be a ring and let B be a commutative ring. Let p be a homogeneous multiplicative polynomial law of degree n from R to B. We show that p is essentially a determinant, in the sense that p is obtained from a determinant by left and right…

The notion of Frobenius Betti numbers generalizes the Hilbert-Kunz multiplicity theory and serves as an invariant that measures singularity. However, the explicit computation of the Frobenius Betti numbers of rings has been limited to very…

The Frobenius method can be used to compute solutions of ordinary linear differential equations by generalized power series. Each series converges in a circle which at least extends to the nearest singular point; hence exponentially fast…