Related papers: On P vs. NP, Geometric Complexity Theory, and the …
Geometric quantization is an attempt at using the differential-geometric ingredients of classical phase spaces regarded as symplectic manifolds in order to define a corresponding quantum theory. Generally, the process of geometric…
Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance, are the graphs induced by quadrilateral flips in…
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…
The notion of geometric construction is introduced. This notion allows to compare incidence configurations in the algebraic and tropical plane. We provide an algorithm such that, given a tropical instance of a geometric construction, it…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
We give an introduction to some of the recent ideas that go under the name "geometric complexity theory". We first sketch the proof of the known upper and lower bounds for the determinantal complexity of the permanent. We then introduce the…
In this paper the reason why entropy reduction (negentropy) can be used to measure the complexity of any computation was first elaborated both in the aspect of mathematics and informational physics. In the same time the equivalence of…
Geometric algebra is an optimal frame work for calculating with vectors. The geometric algebra of a space includes elements that represent all the its subspaces (lines, planes, volumes, ...). Conformal geometric algebra expands this…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
Graph contrastive learning (GCL) is an effective paradigm for node representation learning in graphs. The key components hidden behind GCL are data augmentation and positive-negative pair selection. Typical data augmentations in GCL, such…
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…
A point visibility graph is a graph induced by a set of points in the plane where the vertices of the graph represent the points in the point set and two vertices are adjacent if and only if no other point from the point set lies on the…
The classical no-three-in-line problem is to find the maximum number of points that can be placed in the $n \times n$ grid so that no three points lie on a line. Given a set $S$ of points in an Euclidean plane, the General Position Subset…
The term higher gauge theory refers to the generalization of gauge theory to a theory of connections at two levels, essentially given by 1- and 2-forms. So far, there have been two approaches to this subject. The differential picture uses…
The description of gravity in the form of an embedding theory is based on the hypothesis that our space-time is a four-dimensional surface in a flat ten-dimensional space. The choice of standard Einstein-Hilbert action leads in this case to…
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…
What is the best representation for doing euclidean geometry on computers? These notes from a SIGGRAPH 2019 short course entitled "Geometric algebra for computer graphics" introduce projective geometric algebra (PGA) as a modern framework…
A theory of topological gravity is a homotopy-theoretic representation of the Segal-Tillmann topologification of a two-category with cobordisms as morphisms. This note describes a relatively accessible example of such a thing, suggested by…
Recent studies show that graph convolutional network (GCN) often performs worse for low-degree nodes, exhibiting the so-called structural unfairness for graphs with long-tailed degree distributions prevalent in the real world. Graph…
We review a geometric approach to classification and examination of quantum correlations in composite systems. Since quantum information tasks are usually achieved by manipulating spin and alike systems or, in general, systems with a finite…