Related papers: Splitting full matrix algebras over algebraic numb…

We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…

We study a numerical semigroup ring as an algebra over another numerical semigroup ring. The complete intersection property of numerical semigroup algebras is investigated using factorizations of monomials into minimal ones. The goal is to…

We propose an algorithm for finding zero divisors in quaternion algebras over quadratic number fields, or equivalently, solving homogeneous quadratic equations in three variables over $\mathbb{Q}(\sqrt{d})$ where $d$ is a square-free…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Let K be a subfield of the complex numbers, and let D be the Weyl algebra of K-linear differential operators on K[x_1,...,x_n]. If M and N are holonomic left D-modules we present an algorithm that computes explicit generators for the finite…

We investigate the computational complexity of the problem of deciding if an algebra homomorphism can be factored through an intermediate algebra. Specifically, we fix an algebraic language, L, and take as input an algebra homomorphism f…

Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…

Let $F$ be an algebraically closed field of characteristic zero, and $G$ be a finite abelian group. If $A=\oplus_{g\in G} A_g$ is a $G$-graded algebra, we study degree-inverting involutions on $A$, i.e., involutions $*$ on $A$ satisfying…

This paper is concerned with the problem of determining the number of division algebras which share the same collection of finite splitting fields. As a corollary we are able to determine when two central division algebras may be…

Let $A$ and $B$ be finite-dimensional simple algebras with arbitrary signature over an algebraically closed field. Suppose $A$ and $B$ are graded by a semigroup $S$ so that the graded identitical relations of $A$ are the same as those of…

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

In this paper, we present an isomorphism between the ring of general polynomials over a division ring of degree $p$ over its center $F$ and the group ring of the free monoid with $p^2$ variables. Using this isomorphism, we define the…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

The graphical realization of a given degree sequence and given partition adjacency matrix simultaneously is a relevant problem in data driven modeling of networks. Here we formulate common generalizations of this problem and the Exact…

We prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of the complex plane and D an effective divisor supported on the boundary of…

This is a first stab at a mathematical framework in which one can study quantum field theories on spacetimes with quite general geometries. We will study these theories via their factorization algebras. The aim is to identify a minimalist…

We describe the Median K-Flats (MKF) algorithm, a simple online method for hybrid linear modeling, i.e., for approximating data by a mixture of flats. This algorithm simultaneously partitions the data into clusters while finding their…

An $F$-algebra $A$ with unit $1$ is said to be a locally matrix algebra if an arbitrary finite collection of elements $a_1,$ $\ldots,$ $a_s $ from $ A$ lies in a subalgebra $B$ with $1$ of the algebra $A$, that is isomorphic to a matrix…

Efficient methods for computing with matrices over finite fields often involve randomised algorithms, where matrices with a certain property are sought via repeated random selection. Complexity analyses for these algorithms require…

We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…