Related papers: enumeration of weighted paths on a digraph and blo…
Branes and defects in topological Landau-Ginzburg models are described by matrix factorisations. We revisit the problem of deforming them and discuss various deformation methods as well as their relations. We have implemented these…
Motivated by the concept of network motifs we construct certain clustering methods (functors) which are parametrized by a given collection of motifs (or representers).
Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of cooperative control problems, including formation control, distributed averaging, and optimization. We refer to a digraph…
Pomset block metric is a generalization of pomset metric. In this paper, we define weight enumerator of linear block codes in pomset metric over $\mathbb{Z}_m$ and establish MacWilliams type identities for linear block codes with respect to…
We characterize positive definiteness for some family of matrices. As an application we derive explicit value of the quadratic embedding constants of the path graphs.
A framework consists of an undirected graph $G$ and a matroid $M$ whose elements correspond to the vertices of $G$. Recently, Fomin et al. [SODA 2023] and Eiben et al. [ArXiV 2023] developed parameterized algorithms for computing paths of…
Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…
A cross matrix $X$ can have nonzero elements located only on the main diagonal and the anti-diagonal, so that the sparsity pattern has the shape of a cross. It is shown that $X$ can be factorized into products of matrices that are at most…
We define triangulated factorization systems on triangulated categories, and prove that a suitable subclass thereof (the normal triangulated torsion theories) corresponds bijectively to $t$-structures on the same category. This result is…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
In this article we study algorithmic synthesis of the class of stabilizing switching signals for discrete-time switched linear systems proposed in [12]. A weighted digraph is associated in a natural way to a switched system, and the…
We investigate determinants of random unitary pencils (with scalar or matrix coefficients), which generalize the characteristic polynomial of a single unitary matrix. In particular we examine moments of such determinants, obtained by…
We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…
We show that certain digraphs with the same vertex set but different arc sets have the same sum over the weights of all arborescences with a given root vertex. We relate our results to the Matrix-Tree Theorem and show how they provide a…
Random factor graphs provide a powerful framework for the study of inference problems such as decoding problems or the stochastic block model. Information-theoretically the key quantity of interest is the mutual information between the…
We compute the determinant of the Gram matrix of the Shapovalov form on weight spaces of the basic representation of an affine Kac-Moody algebra of ADE type (possibly twisted). As a consequence, we obtain explicit formulae for the…
We give a formula that expresses the Hilbert series of one-sided ladder determinantal rings, up to a trivial factor, in form of a determinant. This allows the convenient computation of these Hilbert series. The formula follows from a…
We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar way: Block column by block column, from left to right. The need for such an evaluation scheme arises naturally in the context of option…
The determinants of modular Collatz graphs and the modular Conway amusical permutation graph are determined, and some interesting number theoretic properties are described.