Related papers: Counting Cholesky factorizations of the zero matri…

Let $F$ be an affine flat group scheme over a commutative ring $R$, and $S$ an $F$-algebra (an $R$-algebra on which $F$ acts). We define an equivariant analogue $Q_F(S)$ of the total ring of fractions $Q(S)$ of $S$. It is the largest…

The notion of a matrix factorization was introduced by Eisenbud in the commutative case in his study of bounded (periodic) free resolutions over complete intersections. In this work, we extend the notion of (homogeneous) matrix…

In the first chapter, we will present a computation of the square value of the module of L functions associated to a Dirichlet character. This computation suggests to ask if a certain ring of arithmetic multiplicative functions exists and…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…

Euclidean distance matrices corresponding to an arithmetic progression have rich spectral and structural properties. We exploit those properties to develop completely positive factorizations of translations of those matrices. We show that…

Rational transformations of polynomials are extensively studied in the context of finite fields, especially for the construction of irreducible polynomials. In this paper, we consider the factorization of rational transformations with…

The book is devoted to investigation of arithmetic of the matrix rings over certain classes of commutative finitely generated principal ideals domains. We mainly concentrate on constructing of the matrix factorization theory. We reveal a…

Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…

We study how often exceptional configurations of irreducible polynomials over finite fields occur in the context of prime number races and Chebyshev's bias. In particular, we show that three types of biases, which we call "complete bias",…

In this paper, with the help of the theory of matrices and finite fields we generalize Zolotarev's theorem to an arbitrary finite dimensional vector space over $\mathbb{F}_q$, where $\mathbb{F}_q$ denotes the finite field with $q$ elements.

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…

We study the category of matrix factorizations for an isolated hypersurface singularity. We compute the canonical bilinear form on the Hochschild homology of this category. We find explicit expressions for the Chern character and the…

Let $F$ be a field, $p$ a prime number, $X$ an indeterminate over $F$, $D_n =F[X^{\frac{1}{p^n}}, X^{-\frac{1}{p^n}}]$ for each integer $n \geq 0$ and $D = \bigcup\limits_{n\in\mathbb{N}_0}D_n.$ Then $D$ is a one-dimensional B{\'e}zout…

This paper is devoted to the classification problem of tree-dimensional anti-commutative(zero-potent) algebras over any base field $\mathbb{F}$ such that $Char(\mathbb{F})\neq 2$ and every element admits a square root.

Let $q = p^s$ be a power of a prime number $p$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. In this paper we obtain the explicit factorization of the cyclotomic polynomial $\Phi_{2^nr}$ over $\mathbb{F}_q$ where both $r…

In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…

We present a fast direct algorithm for computing symmetric factorizations, i.e. $A = WW^T$, of symmetric positive-definite hierarchical matrices with weak-admissibility conditions. The computational cost for the symmetric factorization…

Given a finite-dimensional vector space $V$ over the finite field $\mathbb{F}_q$ and a subspace $W$ of $V$, we consider the problem of counting linear transformations $T:W\to V$ which have prescribed invariant factors. The case $W=V$ is a…