Related papers: Factorization of piecewise constant matrix functio…
For a commutative ring $S$ and self-orthogonal subcategory $\mathsf{C}$ of $\mathsf{Mod}(S)$, we consider matrix factorizations whose modules belong to $\mathsf{C}$. Let $f\in S$ be a regular element. If $f$ is $M$-regular for every $M\in…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
We obtain a general characterization of discrete-time all-pass rational matrix functions from state-space representations. It can be employed to address model reduction problems in the same vein of the theory developed by Glover in the…
Issues concerning intelligent data analysis occurring in machine learning are investigated. A scheme for synthesizing correct supervised classification procedures is proposed. These procedures are focused on specifying partial order…
A new method that enables easy and convenient discretization of partial differential equations with derivatives of arbitrary real order (so-called fractional derivatives) and delays is presented and illustrated on numerical solution of…
Graph-based analysis holds both theoretical and applied significance, attracting considerable attention from researchers and yielding abundant results in recent years. However, research on fractional problems remains limited, with most of…
In this paper we study a new generalization of the kinetic equation emerging in run-and-tumble models. We show that this generalization leads to a wide class of generalized fractional kinetic (GFK) and telegraph-type equations depending by…
For a set $S$ of vertices of a graph $G$, we define its density $0 \leq \sigma(S) \leq 1$ as the ratio of the number of edges of $G$ spanned by the vertices of $S$ to ${|S| \choose 2}$. We show that, given a graph $G$ with $n$ vertices and…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
Recent innovations on the differential calculus for functions of non-commuting variables, begun for a quaternionic variable, are now extended to the case of a general matrix over the complex numbers. The expansion of F(X+Delta) is given to…
We propose a method by which to examine all possible partial difference Lax pairs that consist of 'two by two' discrete linear problems, where the matrices contain one separable term in each entry. We thereby derive new, higher-order…
We give a number of explicit matrix-algorithms for analysis/synthesis in multi-phase filtering; i.e., the operation on discrete-time signals which allow a separation into frequency-band components, one for each of the ranges of bands, say…
We prove that any given function can be smoothly approximated by functions lying in the kernel of a linear operator involving at least one fractional component. The setting in which we work is very general, since it takes into account…
We present a novel numerical method for solving the elliptic partial differential equation problem for the electrostatic potential with piecewise constant conductivity. We employ an integral equation approach for which we derive a system of…
Let M be a complete n-dimensional Riemannian spin manifold, partitioned by q two-sided hypersurfaces which have a compact transverse intersection N and which in addition satisfy a certain coarse transversality condition. Let E be a…
We study factorizations of rational matrix functions with simple poles on the Riemann sphere. For the quadratic case (two poles) we show, using multiplicative representations of such matrix functions, that a good coordinate system on this…
The first focus of this paper is the characterization of the spectrum and the singular values of the coefficient matrix stemming from the discretization with space-time grid for a parabolic diffusion problem and from the approximation of…
We extend the notion of a factorization system in a category to the realm of $\infty$-categories. To this end, we provide a description of the category of $\infty$-categories with factorization systems as the category of presheaves of…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…