Related papers: Parametrized Fixed Points on O-Categories and Appl…
In this paper we study categories O over quantizations of symplectic resolutions admitting Hamiltonian tori actions with finitely many fixed points. In this generality, these categories were introduced by Braden, Licata, Proudfoot and…
Hypergraph categories are symmetric monoidal categories where each object is equipped with a special commutative Frobenius algebra (SCFA). Dagger-hypergraph categories are the same, but with dagger-symmetric monoidal categories and…
The process of segmenting point cloud data into several homogeneous areas with points in the same region having the same attributes is known as 3D segmentation. Segmentation is challenging with point cloud data due to substantial…
We consider a class of formula equations in first-order logic, Horn formula equations, which are defined by a syntactic restriction on the occurrences of predicate variables. Horn formula equations play an important role in many…
Diers developed a general theory of right multi-adjoint functors leading to a purely categorical, point-set construction of spectra. Situations of multiversal properties return sets of canonical solutions rather than a unique one. In the…
Attributes are semantically meaningful characteristics whose applicability widely crosses category boundaries. They are particularly important in describing and recognizing concepts where no explicit training example is given, \textit{e.g.,…
While spatial reasoning has made progress in object localization relationships, it often overlooks object orientation-a key factor in 6-DoF fine-grained manipulation. Traditional pose representations rely on pre-defined frames or templates,…
For a finite group $G$, the so-called $G$-Mackey functors form an abelian category $M(G)$ that has many applications in the study of $G$-equivariant stable homotopy. One would expect that the derived category $D(M(G))$ would be similarly…
Knop constructed a tensor category associated to a finitely-powered regular category equipped with a degree function. In recent work with Harman, we constructed a tensor category associated to an oligomorphic group equipped with a measure.…
In this paper we introduce a notion of {\it generalized operad} containing as special cases various kinds of operad--like objects: ordinary, cyclic, modular, properads etc. We then construct inner cohomomorphism objects in their categories…
We introduce and develop the notion of *displayed categories*. A displayed category over a category C is equivalent to "a category D and functor F : D --> C", but instead of having a single collection of "objects of D" with a map to the…
Text classification is a fundamental language task in Natural Language Processing. A variety of sequential models is capable making good predictions yet there is lack of connection between language semantics and prediction results. This…
Given a Hilbert space and a finite family of operators defined on the space, the common fixed point problem (CFPP) is to find a point in the intersection of the fixed point sets of these operators. Instances of the problem have numerous…
Given a static vertex-selection problem (e.g. independent set, dominating set) on a graph, we can define a corresponding temporally satisfying reconfiguration problem on a temporal graph which asks for a sequence of solutions to the…
In this paper, we study the existence of fixed points for mappings defined on complete metric space (X, d) satisfying a general contractive inequality of integral type depended on another function. This conditions is analogous of Banach…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
This paper presents a framework for computing random operator-valued feature maps for operator-valued positive definite kernels. This is a generalization of the random Fourier features for scalar-valued kernels to the operator-valued case.…
We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…
Whether it be in normal form games, or in fair allocations, or in voter preferences in voting systems, a certain pattern of reasoning is common. From a particular profile, an agent or a group of agents may have an incentive to shift to a…
We study O(N) models with power-law interactions by using functional renormalization group methods: we show that both in Local Potential Approximation (LPA) and in LPA' their critical exponents can be computed from the ones of the…