Related papers: A note on one-sided recognizable morphisms
The purpose of this note is to give a number of open problems on matching theory and their relation to the well-known results in this area. We also give a linear analogue of the acyclic matchings.
Combinatorial and topological aspects of monoids with an absorbing element and their associated algebras are considered. Phd thesis.
We prove that the two-sided limit shadowing property is among the strongest known notions of pseudo-orbit tracing. It implies shadowing, average shadowing, asymptotic average shadowing and specification properties. We also introduce a…
We establish the deformation theory of Lie groupoid morphisms, describe the corresponding deformation cohomology of morphisms, and show the properties of the cohomology. We prove its invariance under isomorphisms of morphisms. Additionally,…
We study the problem of orbifold deconstruction, i.e., the process of recognizing, using only readily available information, whether a given conformal model can be realized as an orbifold, and the identification of the twist group and the…
We use functions of a bicomplex variable to unify the existing constructions of harmonic morphisms from a 3-dimensional Euclidean or pseudo-Euclidean space to a Riemannian or Lorentzian surface. This is done by using the notion of…
Present notes can be viewed as an attempt to extend the notion of Schubert/Grothendieck polynomial to the context of an arbitrary algebraic oriented cohomology theory and, hence, of a commutative one-dimensional formal group law.
We study holonomy representations admitting a pair of supplementary faithful sub-representations. In particular the cases where the sub-representations are isomorphic respectively dual to each other are treated. In each case we have a…
In \cite{LS14} the analogy between the Kleisli construction and the construction of "warping a skew monoidale category" in the sense of \cite{LS12} was outlined. In this note we present the same work in a slightly more formal way.
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
Faceted arrangement of entities and typed relations for representing different associations between the entities are established tools in knowledge representation. In this paper, a proposal is being discussed combining both tools to draw…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
In this note we refine the alternativity in some bifurcation theorems of Rabinowitz type, and then improve a few of results in Lu (2022) [17].
We consider various notions of holomorphic extendability of complex valued functions defined on subsets of $\mathbf C^n$, including one-sided extendability. We show that in the relevant function spaces, these phenomena of holomorphic…
A cohomology theory for lambda-rings is developed. This is then applied to study deformations of lambda-rings.
The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].
The aim of this short note is to show how can be derived from the properties of fundamental interpolation polynomials some nice identities.
The phrase "(co)simplicial (pre)sheaf" can be reasonably interpreted in multiple ways. In this survey we study how the various notions familiar to the author relate to one another. We end by giving some example applications of the most…
Although the notion of a concept as a collection of objects sharing certain properties, and the notion of a conceptual hierarchy are fundamental to both Formal Concept Analysis and Description Logics, the ways concepts are described and…