Related papers: On the Frobenius complexity of determinantal rings

We show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability problem for pseudolines arrangements. In…

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…

An explicit form of first order PDE for invariants of binary form are found. By solving the equation a minimal generation set for a ring of invariants and theirs syzygies are calculated in the cases $n\leq 6$ and $n=8.$

Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.

We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.

We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…

A general method of finding functional determinants is presented that depends on the asymptotic behaviour of the resolvent. Its application to the case of a bounded trihedral corner for which the eigenvalues are known only implicitly is…

Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the…

In this article, we give explicit formulas for the $p$-adic valuations of the Fibonomial coefficients ${p^a n \choose n}_F$ for all primes $p$ and positive integers $a$ and $n$. This is a continuation from our previous article extending…

We study congruences for Eisenstein series on $\mathrm{SL}_2(\mathbb{Z})$ modulo $p^2$, where $p \geq 5$ is prime. It is classically known that all Eisenstein series of weight at least $4$ are determined modulo $p^2$ by those of weight at…

Suppose $p$ is a prime, $t$ is a positive integer, and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial of degree $d$ with coefficients of absolute value $<\!p^t$. We show that for any fixed $t$, we can compute the number of roots in…

We prove some polynomial identities from which we deduce congruences modulo $p^2$ for the Fermat quotient $\frac{2^p-2}{p}$ for any odd prime $p$ (Proposition 1 and Theorem 1). These congruences are simpler than the one obtained by…

Let $F^n(-)$ be the Frobenius functor of Peskine and Szpiro. In this note, we show that the maximal Cohen-Macaulayness of $F^n(M)$ forces $M$ to be free, provided $M$ has a rank. We apply this result to obtain several Frobenius related…

Let $N \geq2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. Frobenius number of this $N$-tuple is defined to be the largest positive integer that cannot be expressed as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are…

In this paper we study primality and primary decomposition of certain ideals which are generated by homogeneous degree $2$ polynomials and occur naturally from determinantal conditions. Normality is derived from these results.

We use a variety of computational tools to obtain a degree-$\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \times n$ matrix. The degree of this equation has…

Let $n$ be a positive integer greater than $2$. We define \textit{the Proth numerical semigroup}, $P_{k}(n)$, generated by $\{k 2^{n+i}+1 \,\mid\, i \in \mathbb{N}\}$, where $k$ is an odd positive number and $k < 2^{n}$. In this paper, we…

In this article, we derive a list of possible characteristic polynomials of the Frobenius of simple supersingular abelian varieties of dimension 1, 2, 3, 4, 5, 6, 7 over $\mathbb{F}_q$ where $q = p^n$, n odd.

Newman showed that for primes $p\geq 5$ an integral circulant determinant of prime power order $p^t$ cannot take the value $p^{t+1}$ once $t\geq 2.$ We show that many other values are also excluded. In particular, we show that $p^{2t}$ is…

This paper is concerned with the computation of representation matrices for the action of Frobenius to the cohomology groups of algebraic varieties. Specifically we shall give an algorithm to compute the matrices for arbitrary algebraic…