Related papers: More Reduced Obstruction Theories
The usual Laurent expansion of the analytic tensors on the complex plane is generalized to any closed and orientable Riemann surface represented as an affine algebraic curve. As an application, the operator formalism for the $b-c$ systems…
G.W. Mackey's celebrated obstruction theory for projective representations of locally compact groups was remarkably generalized by J. M. G. Fell and R. S. Doran to the wide area of saturated Banach *-algebraic bundles. Analogous obstruction…
Approaching limitations of digital computing technologies have spurred research in neuromorphic and other unconventional approaches to computing. Here we argue that if we want to systematically engineer computing systems that are based on…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
We consider local-global principles for rational points on varieties, in particular torsors, over one-variable function fields over complete discretely valued fields. There are several notions of such principles, arising either from the…
In this paper, we propose a novel formalism called Probabilistic Obstruction Temporal Logic (POTL), which extends Obstruction Logic (OL) by incorporating probabilistic elements. POTL provides a robust framework for reasoning about the…
Simple conceptual graphs are considered as the kernel of most knowledge representation formalisms built upon Sowa's model. Reasoning in this model can be expressed by a graph homomorphism called projection, whose semantics is usually given…
The aim of this short note is to develop a (co)homology theory for topological spaces together with the specialisation preorder. A known way to construct such a (co)homology is to define a partial order on the topological space starting…
In a recent paper published in Nature, Y.I. Sobolev et al. introduced the concept of trajectoids: convex, rigid objects, which roll without slip or spin on a flat plane along a prescribed periodic, unbounded planar path. A geometric…
Traffic-light modelling is a complex task, because many factors have to be taken into account. In particular, capturing all traffic flows in one model can significantly complicate the model. Therefore, several realistic features are…
We propose a new 2D shape decomposition method based on the short-cut rule. The short-cut rule originates from cognition research, and states that the human visual system prefers to partition an object into parts using the shortest possible…
This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms. The formalisms are in higher-order logic (with and without type…
We study toroidal orbifold models with topologically invariant terms in the path integral formalism and give physical interpretations of the terms from an operator formalism point of view. We briefly discuss a possibility of a new class of…
A possible alternative route to a quantum theory of gravity is presented. The usual path is to quantize the gravitational field in order to introduce the statistical structure characteristic of quantum mechanics. The procedure followed here…
An informal discussion of how the construction problem in algebraic geometry motivates the search for formal proof methods. Also includes a brief discussion of my own progress up to now, which concerns the formalization of category theory…
A new necessary separability criterion that relates the structures of the total density matrix and its reductions is given. The method used is based on the realignment method [K. Chen and L.A. Wu, Quant. Inf. Comput. 3, 193 (2003)]. The new…
We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems. This framework covers the most popular kinds of conditional reasoning in logic-based KR: the semantics we…
A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.
We discuss two simple but useful observations that allow the construction of modular forms from given ones using invariant theory. The first one deals with elliptic modular forms and their derivatives, and generalizes the Rankin-Cohen…
Reduced Order Models (ROMs) form essential tools across engineering domains by virtue of their function as surrogates for computationally intensive digital twinning simulators. Although purely data-driven methods are available for ROM…