Related papers: Transfer matrix for spanning trees, webs and color…
In this paper we introduce the notion of spread net. Spread nets are (safe) Petri nets equipped with vector clocks on places and with ticking functions on transitions, and are such that vector clocks are consistent with the ticking of…
We investigate a model of cell division in which the length of telomeres within the cell regulate their proliferative potential. At each cell division the ends of linear chromosomes change and a cell becomes senescent when one or more of…
We consider the double-row (open) transfer matrix constructed from generic tensor-type representations of various types of Hecke algebras. For different choices of boundary conditions for the relevant integrable lattice model we express the…
The far-field pattern of a simple one-dimensional laser array of emitters radiating into free space is considered. In the path of investigating the inverse problem for their near fields leading to a target beam form, surprisingly we found…
When lattice QCD is formulated in sectors of fixed quark numbers, the canonical fermion determinants can be expressed explicitly in terms of transfer matrices. This in turn provides a complete factorization of the fermion determinants in…
Transfer learning research attempts to make model induction transferable across different domains. This method assumes that specific information regarding to which domain each instance belongs is known. This paper helps to extend the…
This article proposes a new layered model to represent the spectrum assignment on flexible-grid optical networks. This model can reduce the time-complexity of existing routing and spectrum assignment methods by providing a data structure…
The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…
We consider the analysis of high dimensional data given in the form of a matrix with columns consisting of observations and rows consisting of features. Often the data is such that the observations do not reside on a regular grid, and the…
Short spanning trees subject to additional constraints are important building blocks in various approximation algorithms. Especially in the context of the Traveling Salesman Problem (TSP), new techniques for finding spanning trees with…
We study the representation theory of the Temperley-Lieb algebra $\mathsf{TL}_n^k(\delta)$ in mixed characteristic, i.e. over an arbitrary field $k$ of characteristic $p$ and where $\delta$ satisfies some minimal polynomial $m_\delta$. In…
We give series solutions to single insertion place propagator-type systems of Dyson--Schwinger equations using binary tubings of rooted trees. These solutions are combinatorially transparent in the sense that each tubing has a…
It is well known that for a regular semistable curve $\mathfrak X$ over a DVR with algebraically closed residue field, the spanning trees of the dual graph of the special fiber of $\mathfrak X$ are in bijection with components of the…
In this work we study the scattering and transfer matrices for electric fields defined with respect to an angular spectrum of plane waves. For these matrices, we derive the constraints that are enforced by conservation of energy,…
As a generalization of the Edmonds arborescence packing theorem, Kamiyama--Katoh--Takizawa (2009) gave a good characterization of directed graphs that contain arc-disjoint arborescences spanning the set of vertices reachable from each root.…
The anisotropic XY-model in a transverse field (s=1/2) on the one-dimensional alternating superlattice (closed chain) is considered. The solution of the model is obtained by introducing a generalized Jordan-Wigner transformation which maps…
The seriation problem is an important ordering issue which consists of finding the best ordering of a set of units whose interrelationship is defined by a bipartite graph. It has important applications in, e.g., archaeology, anthropology,…
We consider two approaches to designing fermion-qubit mappings: (1) ternary tree transformations, which use Pauli representations of the Majorana operators that correspond to root-to-leaf paths of a tree graph and (2) linear encodings of…
Time-series of persistence diagrams, known as vineyards, have shown to be useful in diverse applications. A natural algebraic version of vineyards is a time series of persistence modules equipped with interleaving maps between the…
We study the correspondence between the linear matrix model and the interacting nonlinear string theory. Starting from the simple matrix harmonic oscillator states, we derive in a direct way scattering amplitudes of 2-dimensional strings,…