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

Let $p$ be a prime. Given a polynomial in $\F_{p^m}[x]$ of degree $d$ over the finite field $\F_{p^m}$, one can view it as a map from $\F_{p^m}$ to $\F_{p^m}$, and examine the image of this map, also known as the value set. In this paper,…

Two known computation methods and one new computation method for matrix determinant over an integral domain are discussed. For each of the methods we evaluate the computation times for different rings and show that the new method is the…

Lyubeznik conjectured that local cohomology modules of regular rings have finitely many associated primes. We examine this conjecture for polynomial rings over the integers, and record some equational identities that arise from studying…

We introduce the notion of the Frobenius-Perron dimension of an integral $\Bbb Z_+$-ring and give some applications of this notion to classification of finite dimensional quasi-Hopf algebras with a unique nontrivial simple module, and of…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

We develop a simple $O((\log n)^2)$ test as an extension of Proth's test for the primality for $p2^n+1$, $p>2^n$. This allows for the determination of large, non-Sierpinski primes $p$ and the smallest $n$ such that $p2^n+1$ is prime. If $p$…

We solve the problem of effectively computing the $a$-invariant of ladder determinantal rings. In the case of a one-sided ladder, we provide a compact formula, while, for a large family of two-sided ladders, we provide an algorithmic…

In ISSAC 2017, van der Hoeven and Larrieu showed that evaluating a polynomial P in GF(q)[x] of degree <n at all n-th roots of unity in GF($q^d$) can essentially be computed d-time faster than evaluating Q in GF($q^d$)[x] at all these roots,…

Let $\mu$ be a $p$-dimensional vector, and let $\Sigma_1$ and $\Sigma_2$ be $p \times p$ positive definite covariance matrices. On being given random samples of sizes $N_1$ and $N_2$ from independent multivariate normal populations…

We study the probability that the product of two randomly chosen elements in a finite ring $R$ is equal to some fixed element $x \in R$. We calculate this probability for semisimple rings and some special classes of local rings, and find…

Given a prime $p\geq 5$, we reduce modulo p a convolution of order p-1 of powers of two weighted Bernoulli numbers with Bernoulli numbers in terms of harmonic numbers and generalized harmonic numbers. Our proof is based on studying the…

The Frobenius of a matrix $M$ with coefficients in $\bar{\mathbb F}_p$ is the matrix $\sigma(M)$ obtained by raising each coefficient to the $p$-th power. We consider the question of counting matrices with coefficients in $\mathbb F_q$…

In this paper, we present novel deterministic algorithms for multiplying two $n \times n$ matrices approximately. Given two matrices $A,B$ we return a matrix $C'$ which is an \emph{approximation} to $C = AB$. We consider the notion of…

We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of evaluating each of these polynomials at each fixed rational…

The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…

Let $p$ be a prime number. We compute the trivial source character tables of finite Frobenius groups $G$ with an abelian Frobenius complement $H$ and an elementary abelian Frobenius kernel of order $p^2$. More precisely, we deal with all…

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…

We analyze the algorithm in [Holub, 2009], which decides whether a given word is a fixed point of a nontrivial morphism. We show that it can be implemented to have complexity in O(mn), where n is the length of the word and m the size of the…

Our main interest is the low-rank approximation of a matrix in R^m.n under a weighted Frobenius norm. This norm associates a weight to each of the (m x n) matrix entries. We conjecture that the number of approximations is at most min(m, n).…