Related papers: On P vs. NP, Geometric Complexity Theory, and the …
In this Master of Science Thesis I introduce geometric algebra both from the traditional geometric setting of vector spaces, and also from a more combinatorial view which simplifies common relations and operations. This view enables us to…
The set theory relations \in, \backslash, \Delta, \cap, and \cup have corollaries in subspace relations. Geometric Algebra is introduced as the ideal framework to explore these subspace operations. The relations \in, \backslash, and \Delta…
In this work, we show that it is possible to define a classical system associated with a Generalized Uncertainty Principle (GUP) theory via the implementation of a consistent symplectic structure. This provides a solid framework for the…
In this PhD thesis, we give a new geometric approach to higher Teichm\"uller theory. In particular we construct a geometric structure on surfaces, generalizing the complex structure, and we explore its link to Hitchin components. The…
We study a generalization of the Set Cover problem called the \emph{Partial Set Cover} in the context of geometric set systems. The input to this problem is a set system $(X, \mathcal{S})$, where $X$ is a set of elements and $\mathcal{S}$…
Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…
Let $k$ be a field, let $G$ be a reductive algebraic group over $k$, and let $V$ be a linear representation of $G$. Geometric invariant theory involves the study of the $k$-algebra of $G$-invariant polynomials on $V$, and the relation…
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…
Data aggregation in Geographic Information Systems (GIS) is only marginally present in commercial systems nowadays, mostly through ad-hoc solutions. In this paper, we first present a formal model for representing spatial data. This model…
Knowledge Graph (KG) is a graph based data structure to represent facts of the world where nodes represent real world entities or abstract concept and edges represent relation between the entities. Graph as representation for knowledge has…
The Geometric Bin Packing (GBP) problem is a generalization of Bin Packing where the input is a set of $d$-dimensional rectangles, and the goal is to pack them into unit $d$-dimensional cubes efficiently. It is NP-Hard to obtain a PTAS for…
The general position problem is to find the cardinality of a largest vertex subset S such that no triple of vertices of S lie on a common geodesic. For a connected graph G, the cardinality of S is denoted by gp(G) and called gp-number (or…
These are a set of lecture notes on generalized global symmetries in quantum field theory. The focus is on invertible symmetries with a few comments regarding non-invertible symmetries. The main topics covered are the basics of higher-form…
The principal goal of this paper is to pass all quantum probability formulas to the projective space associated to the complex Hilbert space of a given quantum system, providing a more complete geometrization of quantum theory. Quantum…
A discretisation scheme that preserves topological features of a physical problem is extended so that differential geometric structures can be approximated in a consistent way thus giving access to the study of physical systems which are…
A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the…
This article discusses methods of geometric analysis in general relativity, with special focus on the role of "critical surfaces" such as minimal surfaces, marginal surface, maximal surfaces and null surfaces.
Interpreting graph neural networks (GNNs) is difficult because message passing mixes signals and internal channels rarely align with human concepts. We study superposition, the sharing of directions by multiple features, directly in the…
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…
In this paper, we present a series of techniques to describe General Relativity using Geometric Algebra (GA). We emphasize the physical interpretation of quantities and provide a step-by-step guide for performing calculations. In doing so,…