Related papers: Geometry from Brackets Consistency
Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an appropriate parameter regime, a roughly constant vertex…
Based on a fundamental symmetry between space, time, mass and charge, a series of group structures of physical interest is generated, ranging from C2 to E8. The most significant result of this analysis is a version of the Dirac equation…
The initial techniques developed in Euclid's Elements, well before the use of the parallel postulate, are reexamined in order to clarify even the most obscure details, particularly those related to equality, superposition and angle…
Consider a formally self-adjoint first order linear differential operator acting on pairs (2-columns) of complex-valued scalar fields over a 4-manifold without boundary. We examine the geometric content of such an operator and show that it…
Factorization structures occur in toric differential and discrete geometry, and can be viewed in multiple ways, e.g., as objects determining substantial classes of explicit toric Sasaki and K\"ahler geometries, as special coordinates on…
Classical algebraic structures require exact satisfaction of their defining axioms. We propose similarity algebra, a framework extending algebraic and Lie structures to settings where operations satisfy quantitative bounds up to a tolerance…
We introduce linear Dirac and generalized complex structures on Cartan geometries and give criteria for Dirac subalgebras of $\frkg\ltimes\frkg^*$ representing Dirac structures on a Cartan geometry. We prove that there is a bijection…
We show that generalised geometry gives a unified description of maximally supersymmetric consistent truncations of ten- and eleven-dimensional supergravity. In all cases the reduction manifold admits a "generalised parallelisation" with a…
Breaking symmetries is a popular way of speeding up the branch-and-bound method for symmetric integer programs. We study fundamental domains, which are minimal and closed symmetry breaking polyhedra. Our long-term goal is to understand the…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
These notes survey the theory of (twisted) conformal blocks from an algebro-geometric perspective and have two main goals. The first one is to summarize the construction of conformal blocks from vertex operator algebras, and to describe…
We derive a priori bounds on the size of the structure constants of the free Lie algebra over a set of indeterminates, relative to its Hall bases. We investigate their asymptotic growth, especially as a function of the length of the…
Geometric Invariant Theory (GIT) produces quotients of algebraic varieties by reductive groups. If the variety is projective, this quotient depends on a choice of polarisation; by work of Dolgachev-Hu and Thaddeus, it is known that two…
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…
The investigation of the relation among the distances of an arbitrary point in the Euclidean space $\mathbb{R}^n$ to the vertices of a regular $n$-simplex in that space has led us to the study of simplices having a regular facet. Calling an…
Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations…
With distributed computing and mobile applications, synchronizing diverging replicas of data structures is a more and more common problem. We use algebraic methods to reason about filesystem operations, and introduce a simplified definition…
Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geometry for such problems have not been explored. We implement…
This is the lecture 1 of a mini-course of 4 lectures. Our purpose of this mini-curse is to explain some ideas of E. Cartan and S. Lie when we study differential geometry, particularly we will to explain the Cartan reduction method. The…
When spacetime torsion is present, geodesics and autoparallels generically do not coincide. In this work, the well-known method that uses Killing vectors to solve the geodesic equations is generalized for autoparallels. The main definition…