Related papers: On evaluation of permanents
Idempotent elements play a fundamental role in ring theory, as they encode significant information about the underlying algebraic structure. In this paper, we study idempotent matrices from two perspectives. First, we analyze the partially…
We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…
The iteration of rational maps is well-understood in dimension 1 but less so in higher dimensions. We study some maps on spaces of matrices which present a weak complexity with respect to the ring structure. First we give some properties of…
In this paper, we investigate semirings whose elements are either units or zero-divisors (nilpotents) with many examples. While comparing these semirings with their counterparts in ring theory, we observe that their behavior is different in…
After a few historic remarks on magnetic materials we introduce the basic definitions related to permanent magnets. The magnetic properties of the most common materials are reviewed and the production processes are described. Measurement…
We study the structure of seminoetherian modules. Seminoetherian modules over non-primitive hereditary noetherian prime rings are completely described.
Circulant matrices over finite fields and over commutative finite chain rings have been of interest due to their nice algebraic structures and wide applications. In many cases, such matrices over rings have a closed connection with diagonal…
We consider realization and isomorphism problems for formal matrix rings over a given ring. Principal multiplier matrices of such rings play an important role in this case.\\ The work of A.A.Tuganbaev is supported by Russian Scientific…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
We show that the permanent of a matrix is a linear combination of determinants of block diagonal matrices which are simple functions of the original matrix. To prove this, we first show a more general identity involving \alpha-permanents:…
In this paper, we give some determinantal and permanental representations of Generalized Lucas Polynomials by using various Hessenberg matrices, which are general form of determinantal and permanental representations of ordinary Lucas and…
There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…
We present a deterministic algorithm, which, for any given 0< epsilon < 1 and an nxn real or complex matrix A=(a_{ij}) such that | a_{ij}-1| < 0.19 for all i, j computes the permanent of A within relative error epsilon in n^{O(ln n -ln…
A valuation theory for superrings is developed, extending classical constructions from commutative algebra to the $\mathbb Z_2$-graded and supercommutative setting. We define valuations on superrings, investigate their fundamental…
We study permutability properties of matrix semigroups over commutative bipotent semirings (of which the best-known example is the tropical semiring). We prove that every such semigroup is weakly permutable (a result previous stated in the…
This paper is a survey on universal algorithms for solving the matrix Bellman equations over semirings and especially tropical and idempotent semirings. However, original algorithms are also presented. Some applications and software…
In this paper, we introduce multiplicative semiderivation and we investigate the commutativity of semiprime rings satisfying certain conditions and identities involving multiplicative semiderivations on a nonzero ideal I of a ring R.
We investigate some general machinery for describing semidualizing modules over generic constructions like ladder determinantal rings with coefficients in a normal domain. We also pose and investigate natural localization questions that…
Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.
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…