Related papers: Spectral Filtrations via Generalized Morphisms
Using morphic cohomology, we produce a sequence of conjectures, called morphic conjectures, which terminates at the Grothendieck standard conjecture A. A refinement of Hodge structures is given, and with the assumption of morphic…
A classical problem in dynamical systems is to measure the complexity of a map in terms of their orbits. One of the main tools we have to achieve this goal is entropy. However, many interesting families of dynamical systems have every…
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
We generalize the spherical harmonics for l=1 and give the differential equation that the generalized forms satisfy. The new forms have an obvious interpretation in the context of quantum mechanics.
In this paper, we generalize Conley's fundamental theorem of dynamical systems in Conley index theory. We also conclude the existence of regular index filtration for every Morse decomposition.
We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…
Convolution is a broadly useful operation with applications including signal processing, machine learning, probability, optics, polynomial multiplication, and efficient parsing. Usually, however, this operation is understood and implemented…
A new generalization of Fiedler's lemma is obtained by introducing the concept of the main function of a matrix. As applications, the universal spectra of the H-join, the spectra of the H-generalized join and the spectra of the generalized…
We introduce a notion of proper morphism for schematic finite spaces and prove the analogue of Grothendieck's finiteness theorem for it by means of the classic result for schemes and general descent arguments. This result also generalizes…
In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…
We introduce a natural geometric framework for the study of logarithmically divergent integrals on manifolds with corners and algebraic varieties, using the techniques of logarithmic geometry. Key to the construction is a new notion of…
Three categories of algebras with morphisms generalising the usual set of algebra homomorphisms are described. The Sweedler product provides a hom-tensor equivalence relating these three categories, and a tool enabling the universal…
We give a generalization of the random matrix ensembles, including all lassical ensembles. Then we derive the joint density function of the generalized ensemble by one simple formula, which give a direct and unified way to compute the…
We present a novel approach for finding multiple noisily embedded template graphs in a very large background graph. Our method builds upon the graph-matching-matched-filter technique proposed in Sussman et al., with the discovery of…
Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…
In the context of discrete Morse theory, we introduce Morse frames, which are maps that associate a set of critical simplexes to all simplexes. The main example of Morse frames are the Morse references. In particular, these Morse references…
A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…
Clustering data objects into homogeneous groups is one of the most important tasks in data mining. Spectral clustering is arguably one of the most important algorithms for clustering, as it is appealing for its theoretical soundness and is…
We extend the homological method of quantization of generalized Drinfeld--Sokolov reductions to affine superalgebras. This leads, in particular, to a unified representation theory of superconformal algebras.