Related papers: On the complexity of evaluating highest weight vec…
It has been proposed that quantum complexity is dual to the volume of the extremal surface, the action of the Wheeler-DeWitt patch, and the spacetime volume of the patch. Recently, a generalized volume-complexity observable was formulated…
We present a geometric scalar theory of gravity. Our proposal will be described using the "background field method" introduced by Gupta, Feynman and others as a field theory formulation of general relativity. We analyze previous criticisms…
The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…
Superintegrable systems are classical and quantum Hamiltonian systems which enjoy much symmetry and structure that permit their solubility via analytic and even, algebraic means. They include such well-known and important models as the…
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…
This paper describes a method for solving smooth nonconvex minimization problems subject to bound constraints with good worst-case complexity guarantees and practical performance. The method contains elements of two existing methods: the…
We show that the core reasons that complex and hypercomplex valued neural networks offer improvements over their real-valued counterparts is the weight sharing mechanism and treating multidimensional data as a single entity. Their algebra…
We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph $G= (A \cup P, E)$ with weights on the edges in $E$, and with lower and upper quotas on the vertices in $P$. We…
The Weak Gravity Conjecture imposes stringent constraints on effective field theories to allow for an ultraviolet completion within quantum gravity. While substantial evidence supports the conjecture across broad classes of string…
The Jackiw-Teitelboim (JT) model arises from the dimensional reduction of charged black holes. Motivated by the holographic complexity conjecture, we calculate the late-time rate of change of action of a Wheeler-DeWitt patch in the JT…
In this short note we announce three formulas for the set of weights of various classes of highest weight modules $\V$ with highest weight \lambda, over a complex semisimple Lie algebra $\lie{g}$ with Cartan subalgebra $\lie{h}$. These…
On the base of the distinction between covariant and contravariant metric tensor components, an approach from algebraic geometry will be proposed, aimed at finding new solutions of the Einstein's equations both in GTCCCM and in standard…
Let g denote a Lie algebra over a field of characteristic zero, and let T(g) denote the tensor product of g with a ring of truncated polynomials. The Lie algebra T(g) is called a truncated current Lie algebra, or in the special case when g…
The hyperpfaffian polynomial was introduced by Barvinok in 1995 as a natural generalization of the well-known Pfaffian polynomial to higher order tensors. We prove that the hyperpfaffian is the unique smallest degree SL-invariant on the…
Geometric (Clifford) algebra provides an efficient mathematical language for describing physical problems. We formulate general relativity in this language. The resulting formalism combines the efficiency of differential forms with the…
In a representative democracy, the electoral process involves partitioning geographical space into districts which each elect a single representative. These representatives craft and vote on legislation, incentivizing political parties to…
This is an expository paper in which we define projective GIT quotients and introduce toric varieties from this perspective. It is intended primarily for readers who are learning either invariant theory or toric geometry for the first time.
We consider a weighted counting problem on matchings, denoted $\textrm{PrMatching}(\mathcal{G})$, on an arbitrary fixed graph family $\mathcal{G}$. The input consists of a graph $G\in \mathcal{G}$ and of rational probabilities of existence…
We study various aspects of higher-curvature theories of gravity built from contractions of the metric, the Riemann tensor and the covariant derivative, $\mathcal{L}(g^{ab},R_{abcd},\nabla_a)$. We characterise the linearized spectrum of…
Neural gates compute functions based on weighted sums of the input variables. The expressive power of neural gates (number of distinct functions it can compute) depends on the weight sizes and, in general, large weights (exponential in the…