Related papers: F-threshold of determinantal rings

We study rings $R$ for which whenever non-zero polynomials $f(x)$ and $g(x)$ satisfy $f(x)g(x)f(x)=0$, it implies that there is a non-zero element $r\in R$ such that $f(x)rf(x)=0$. We call such rings inner McCoy rings. We explore some…

We give upper and lower bounds on the determinant of a perturbation of the identity matrix or, more generally, a perturbation of a nonsingular diagonal matrix. The matrices considered are, in general, diagonally dominant. The lower bounds…

Consider a deterministic self-adjoint matrix X_n with spectral measure converging to a compactly supported probability measure, the largest and smallest eigenvalues converging to the edges of the limiting measure. We perturb this matrix by…

By an old result of Cohn (1965), a Hadamard matrix of order n has no proper Hadamard submatrices of order m > n/2. We generalise this result to maximal determinant submatrices of Hadamard matrices, and show that an interval of length…

The small finitistic dimension $\fPD(R)$ of a ring $R$ is defined to be the supremum of projective dimensions of $R$-modules with finite projective resolutions. In this paper, we investigate the small finitistic dimensions of four types of…

In this manuscript we prove the Bernstein inequality and develop the theory of holonomic D-modules for rings of invariants of finite groups in characteristic zero, and for strongly F-regular finitely generated graded algebras with FFRT in…

We say that a commutative ring R satisfies the restricted minimum (RM) condition if for all essential ideals I in R, factor R/I is an Artinian ring. We will focus on Noetherian reduced rings because in this setting known results for RM…

The study of Fourier transforms of probability measures on fractal sets plays an important role in recent research. Faster decay rates are known to yield enhanced results in areas such as metric number theory. This paper focuses on…

This work shows that the smallest natural number $d_n$ that is not the determinant of some $n\times n$ binary matrix is at least $c\,2^n/n$ for $c=1/201$. That same quantity naturally lower bounds the number of distinct integers $D_n$ which…

Using the Grosshans Principle, we develop a method for proving lower bounds for the maximal degree of a system of generators of an invariant ring. This method also gives lower bounds for the maximal degree of a set of invariants that define…

We extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

Generalised quantum determinantal rings are the analogue in quantum matrices of Schubert varieties. Maximal orders are the noncommutative version of integrally closed rings. In this paper, we show that generalised quantum determinantal…

We determine the minimal number of separating invariants for the invariant ring of a matrix group $G < \mathrm{GL}_n(\mathbb{F}_q)$ over the finite field $\mathbb{F}_q$. We show that this minimal number can be obtained with invariants of…

An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this…

Linear upper bounds may be derived by imposing specific structural conditions on a generating set, such as additional constraints on ranks, eigenvalues, or the degree of the minimal polynomial of the generating matrices. This paper…

The classical "generalized principal ideal theorems" of Macaulay, Eagon-Northcott, and others give sharp bounds on the heights of determinantal ideals in arbitrary rings. But in regular local rings (or graded polynomial rings) these are far…

Let A be an n by n doubly substochastic matrix and denote {\sigma}(A) the sum of all elements of A. In this paper we give the upper bound of the permanent of (I-A) with respect to n and {\sigma}(A).