Related papers: Determinants and Limit Systems in some Idempotent …
This paper is intended to give closed formulae for binomial determinants with consecutive or almost consecutive rows or columns, as well as calculating the generator of left nullspaces defined by some binomial matrices. In the meantime, we…
We present a novel class of real symmetric matrices in arbitrary dimension $d$, linearly dependent on a parameter $x$. The matrix elements satisfy a set of nontrivial constraints that arise from asking for commutation of pairs of such…
The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…
We diagonalize the Hilbert space of some subclass of the quasifinite module of the \Winf algebra. States are classified according to their eigenvalues for infinitely many commuting charges and the Young diagrams. The parameter dependence of…
We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…
The resultant plays a crucial role in (computational) algebra and algebraic geometry. One of the most important and well known properties of the resultant is that it is equal to the determinant of the Sylvester matrix. In 2008, Odagiri…
The determinants of $\{\pm 1\}$-matrices are calculated by via the oriented hypergraphic Laplacian and summing over an incidence generalization of vertex cycle-covers. These cycle-covers are signed and partitioned into families based on…
Coupled nonlinear integrable systems are generated from usual zero curvature equation. The relevant Maurer-Cartan forms are constructed by combining suitably chosen matrices (nilpotent, Hadamard, idempotent and k-idempotent) and Lie…
We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if…
The object of this paper is to introduce a new and fascinating method of solving large linear equations, based on Cramer's rule or Gaussian elimination but employing Sylvester's determinant identity in its computation process. In addition,…
We compute hyperdeterminants of hypermatrices whose indices belongs in a meet-semilattice and whose entries depend only of the greatest lower bound of the indices. One shows that an elementary expansion of such a polynomial allows to…
In [14], B-convexity was defined as an appropriate Painlev\'e-Kuratowski limit of linear convexities. More recently, an alternative algebraic formulation over the entire Euclidean vector space was proposed in [9] and [10]. The issue with…
With his Clifford algebra of differential forms, Kaehler's algebra addresses the overlooked manifestation of symmetry in the solutions of exterior systems. In this algebra, solutions with a given symmetry are members of left ideals…
We explore a natural extension of braid arrangements in the context of determinantal arrangements. We show that these determinantal arrangements are free divisors. Additionally, we prove that free determinantal arrangements defined by the…
The subject of time-band-limiting, originating in signal processing, is dominated by the miracle that a naturally appearing integral operator admits a commuting differential one allowing for a numerically efficient way to compute its…
The defect of a complex Hadamard matrix $H$ is an upper bound for the dimension of a continuous Hadamard orbit stemming from $H$. We provide a new interpretation of the defect as the dimension of the center subspace of a gradient flow and…
In an earlier paper, we introduced ``bordered knot algebras'', which are graded algebras indexed by a pair of integers (m,k). In a subsequent paper, we introduced a two-parameter family of differential graded algebra, the ``pong algebras'',…
The development of machine learning in particular and artificial intelligent in general has been strongly conditioned by the lack of an appropriated framework to specify and integrate learning processes, data transformation processes and…
A generalization of classical determinant inequalities like Hadamard's inequality and Fischer's inequality is studied. For a version of the inequalities originally proved by Arveson for positive operators in von Neumann algebras with a…
We generalize linear superalgebra to higher gradings and commutation factors, given by arbitrary abelian groups and bicharacters. Our central tool is an extension, to monoidal categories of modules, of the Nekludova-Scheunert faithful…