Related papers: Determinants from homomorphisms
In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
Algebraic tools in statistics have recently been receiving special attention and a number of interactions between algebraic geometry and computational statistics have been rapidly developing. This paper presents another such connection,…
We provide a novel tool which may be used to construct new examples of positive maps in matrix algebras (or, equivalently, entanglement witnesses). It turns out that this can be used to prove positivity of several well known maps (such as…
In recent years many algorithms have been developed for finding patterns in graphs and networks. A disadvantage of these algorithms is that they use subgraph isomorphism to determine the support of a graph pattern; subgraph isomorphism is a…
This paper presents some relations for orthonormal bases in the Minkowski space and isotropic tetrads constructed from the vectors of these bases. As an example of an application of the obtained formulae, in particular recursion relations,…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
In this paper we consider divisibility sequences obtained from square matrices. We work with of matrix divisibility sequences associated to a semigroup and arising from endomorphisms of an affine space. We prove that determinant…
We give a characterization of the effect of sequences of pivot operations on a graph by relating it to determinants of adjacency matrices. This allows us to deduce that two sequences of pivot operations are equivalent iff they contain the…
We develop objective linear algebra in a new setting with a cardinality functor that can take negative values. The signs arise as little homotopies, as ratios between orientations. To illustrate the workings of the theory we give an…
An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…
This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…
A form in a polynomial ring over a field is said to be homaloidal if its polar map is a Cremona map, i.e., if the rational map defined by the partial derivatives of the form has an inverse rational map. The object of this work is the search…
We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…
By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…
We explain theoretically a curious empirical phenomenon: "Approximating a matrix by deterministically selecting a subset of its columns with the corresponding largest leverage scores results in a good low-rank matrix surrogate". To obtain…
In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…
In this paper, we construct a bialgebraic and further a Hopf algebraic structure on top of subgraphs of a given graph. Further, we give the dual structure of this Hopf algebraic structure. We study the algebra morphisms induced by graph…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
In this paper we propose a conseptual framework for the observed properties of discriminants of polylinear forms. The connection with classical problems of linear algebra is shown. A new class of algebraic varieties (hypergrassmanians) is…