Related papers: Transfer matrix for spanning trees, webs and color…
We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…
Springer fibers are a family of subvarieties of the flag variety parametrized by nilpotent matrices that are important in geometric representation theory and whose geometry encodes deep combinatorics. Two-row Springer fibers, which…
Linear arrangements of graphs are a well-known type of graph labeling and are found in many important computational problems, such as the Minimum Linear Arrangement Problem ($\texttt{minLA}$). A linear arrangement is usually defined as a…
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a previous block. They were used to encode ordinal trees and to…
We propose a fourth-order cut-cell method for solving the two-dimensional advection-diffusion equation with moving boundaries on a Cartesian grid. We employ the ARMS technique to give an explicit and accurate representation of moving…
One of the biggest challenges in the field of biomedical imaging is the comprehension and the exploitation of the photon scattering through disordered media. Many studies have pursued the solution to this puzzle, achieving light-focusing…
The decision tree recursively partitions the input space into regions and derives axis-aligned decision boundaries from data. Despite its simplicity and interpretability, decision trees lack parameterized representation, which makes it…
We consider tensors in the Hierarchical Tucker format and suppose the tensor data to be distributed among several compute nodes. We assume the compute nodes to be in a one-to-one correspondence with the nodes of the Hierarchical Tucker…
A decision tree looks like a simple directed acyclic computational graph, where only the leaf nodes specify the output values and the non-terminals specify their tests or split conditions. From the numerical perspective, we express decision…
In this paper, we propose an approach for transferring the knowledge of a neural model for sequence labeling, learned from the source domain, to a new model trained on a target domain, where new label categories appear. Our transfer…
When a simply connected domain $D\subset{\mathbb{R}}^d$ ($d\ge 2$) is approximated in a "good" way by embedded connected weighted graphs, we prove that the transfer current matrix (defined on the edges of the graph viewed as an electrical…
Timbre transfer aims to modify the timbral identity of a musical recording while preserving the original melody and rhythm. While single-instrument timbre transfer has made substantial progress, existing approaches to multi-instrument…
In the present paper we propose a new approach on `distributed systems': the processes are represented through total orders and the communications are characterized by means of biorders. The resulting distributed systems capture situations…
In the paper nonlinear transformations of the Jordan-Wigner (JW) type are introduced in the form different from the ones known previously, for the purpose of expressing multi-index Pauli operators in terms of multi-index Fermi creation and…
The energy transition towards high shares of renewable energy will affect the stability of electricity grids in many ways. Here, we aim to study its impact on propagation of disturbances by solving nonlinear swing equations describing…
Linear problems appear in a variety of disciplines and their application for the transmission matrix recovery is one of the most stimulating challenges in biomedical imaging. Its knowledge turns any random media into an optical tool that…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…
We address the problem of spring-like coupling between bosons in an open chain configuration where the counter-rotating terms are explicitly included. We show that fruitful insight can be gained by decomposing the time-evolution operator of…
We present an MPI-parallel algorithm for the in-situ visualization of computational data that is built around a distributed linear forest-of-octrees data structure. Such octrees are frequently used in element-based numerical simulations;…
An algorithm for solving the random resistor problem by means of the transfer-matrix approach is presented. Preconditioning by spanning clusters extraction both reduces the size of the conductivity matrix and speed up the calculations.