相关论文: Matrix morphology and composition of higher degree…

We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…

In this paper, it is shown that if F(x , y) is an irreducible binary form with integral coefficients and degree $n \geq 3$, then provided that the absolute value of the discriminant of F is large enough, the equation |F(x , y)| = 1 has at…

We study determinantal varieties from conditional independence models with hidden variables, focusing on their irreducible decompositions, dimensions, degrees, and Gr\"obner bases. Each variety encodes a collection of matroids, whose flats…

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

The Riemann-Liouville formula for fractional derivatives and integrals (differintegration) is used to derive formulae for matrix order derivatives and integrals. That is, the parameter for integration and differentiation is allowed to…

We introduce a natural generalization of Maya diagrams -- the space of infinite Fibonacci configurations, which are specified functions on $\mathbb{Z}$ with values $1$ and $0$. Infinite Fibonacci configurations are particularly interesting…

This article examines matrices whose entries are determined by recursive relations of the form $A_{i, j} = x A_{i, j-1} + y A_{i-1, j-1} + z A_{i-1, j}$, where $x, y, z$ are constants, and the initial conditions are defined along the first…

Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of matrix identities as hard instances for strong proof systems. A matrix identity of $d \times d$ matrices over a field $\mathbb{F}$, is a…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Using our recent results on eigenvalues of invariants associated to the Lie superalgebra gl(m|n), we use characteristic identities to derive explicit matrix element formulae for all gl(m|n) generators, particularly non-elementary…

Pfaffians of matrices with entries z[i,j]/(x\_i+x\_j), or determinants of matrices with entries z[i,j]/(x\_i-x\_j), where the antisymmetrical indeterminates z[i,j] satisfy the Pl\"ucker relations, can be identified with a trace in an…

Two square matrices of (arbitrary) order N are introduced. They are defined in terms of N arbitrary numbers z_{n}, and of an arbitrary additional parameter (a respectively q), and provide finite-dimensional representations of the two…

In this paper many classes of sets of matrices with entries in F (F=R, F=C, F=H) are introduced. Each class with the corresponding topology determines a real analytical, complex or symplectic manifold for F=R, F=C or F=H respectively. Any…

Integration by parts identities (IBPs) can be used to express large numbers of apparently different d-dimensional Feynman Integrals in terms of a small subset of so-called master integrals (MIs). Using the IBPs one can moreover show that…

Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…

We give necessary and sufficient conditions, in the form of matrix identities, for a polynomial f in C[X,Y] to be a component of a polynomial automorphism of C^2 and to be a component of a Keller polynomial mapping of C^2, respectively…

Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

Given free modules $M\subseteq L$ of finite rank $f\geq 1$ over a principal ideal domain $R$, we give a procedure to construct a basis of $L$ from a basis of $M$ assuming the invariant factors or elementary divisors of $L/M$ are known.…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…