Related papers: On P vs. NP, Geometric Complexity Theory, Explicit…
The supersymmetric Poisson Sigma model is studied as a possible worldsheet realization of generalized complex geometry. Generalized complex structures alone do not guarantee non-manifest N=(2,1) or N=(2,2) supersymmetry, but a certain…
The basic idea of quantum complexity geometry is to endow the space of unitary matrices with a metric, engineered to make complex operators far from the origin, and simple operators near. By restricting our attention to a finite subgroup of…
Generalized complex geometry is a new mathematical framework that is useful for describing the target space of N=(2,2) nonlinear sigma-models. The most direct relation is obtained at the N=(1,1) level when the sigma model is formulated with…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone $C$ and its dual $C^*$. We show that whether some one-way communication complexity problems can be…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
This is an expository article on the techniques of quantization as they are applied to Gromov-Witten theory and related areas.
We define the notion of near geodesic between points of a metric space when no geodesic exists, and use this to extend Recio-Mitter's notion of geodesic complexity to non-geodesic spaces. This has potential application to topological…
A comparison on some facts concerning the geometric quantization of symplectic manifolds is presented here. Criticism, facts and improvements on the sophisticated theory of geometric quantization are presented touching briefly, all the…
We explain how recent developments in the fields of realisability models for linear logic -- or geometry of interaction -- and implicit computational complexity can lead to a new approach of implicit computational complexity. This…
The geometrical nature of gravity emerges from the universality dictated by the equivalence principle. In the usual formulation of General Relativity, the geometrisation of the gravitational interaction is performed in terms of the…
Geometric algebra is the natural outgrowth of the concept of a vector and the addition of vectors. After reviewing the properties of the addition of vectors, a multiplication of vectors is introduced in such a way that it encodes the famous…
There are many methods developed to approximate a cloud of vectors embedded in high-dimensional space by simpler objects: starting from principal points and linear manifolds to self-organizing maps, neural gas, elastic maps, various types…
The paper summarises the contributions in a session at GCM 2019 presenting and discussing the use of native and translation-based solutions to common analysis problems for Graph Transformation Systems (GTSs). In addition to a comparison of…
Noncommutative geometry (NCG) is a branch of mathematics concerned with a geometric approach to noncommutative algebras, and with the construction of spaces that are locally presented by noncommutative algebras of functions (possibly in…
Geometric constraints between feature matches are critical in 3D point cloud registration problems. Existing approaches typically model unordered matches as a consistency graph and sample consistent matches to generate hypotheses. However,…
Mulmuley and Sohoni (GCT1 in SICOMP 2001, GCT2 in SICOMP 2008) proposed to view the permanent versus determinant problem as a specific orbit closure problem and to attack it by methods from geometric invariant and representation theory. We…
We construct real and complex matrices in terms of Kronecker products of a Witt basis of 2n null vectors in the geometric algebra over the real and complex numbers. In this basis, every matrix is represented by a unique sum of products of…
One considers geometry with the intransitive equaivalence relation. Such a geometry is a physical geometry, i.e. it is described completely by the world function, which is a half of the squared distance function. The physical geometry…
The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic…