Related papers: On the complexity of evaluating highest weight vec…

The study of unitarization of representations for non compact real forms of simple Lie Algebras has been achieved in the past decade by Jakobsen (JA81, JA83) and by Enright, Howe and Wallach (EH83) following different paths but arriving at…

This is an introduction to geometric algebra, an alternative to traditional vector algebra that expands on it in two ways: 1. In addition to scalars and vectors, it defines new objects representing subspaces of any dimension. 2. It defines…

We consider the complexity of counting weighted graph homomorphisms defined by a symmetric matrix $A$. Each symmetric matrix $A$ defines a graph homomorphism function $Z_A(\cdot)$, also known as the partition function. Dyer and Greenhill…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

The geometry conjecture, which was posed nearly a quarter of a century ago, states that the fixed point set of the composition of projectors onto nonempty closed convex sets in Hilbert space is actually equal to the intersection of certain…

The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…

Let $K$ be a number field, $\OK$ be its ring of integers. We introduce the notion of compactified representation of $GL_N(\OK)$ and, we see how to associate to a hermitian vector bundle $\E$ over $\Spec(\OK)$ and a compactified…

The Kronecker coefficient g_{\lambda \mu \nu} is the multiplicity of the GL(V)\times GL(W)-irreducible V_\lambda \otimes W_\mu in the restriction of the GL(X)-irreducible X_\nu via the natural map GL(V)\times GL(W) \to GL(V \otimes W),…

Holant problems are a general framework to study the computational complexity of counting problems. It is a more expressive framework than counting constraint satisfaction problems (CSP) which are in turn more expressive than counting graph…

We consider a model of gravity and matter fields which is invariant only under unimodular general coordinate transformations (GCT). The determinant of the metric is treated as a separate field which transforms as a scalar under unimodular…

Linear and geometric mixtures are two methods to combine arbitrary models in data compression. Geometric mixtures generalize the empirically well-performing PAQ7 mixture. Both mixture schemes rely on weight vectors, which heavily determine…

The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…

The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in G. Herein, a vertex v separates a pair {u,w} if the…

We study highest weight vectors for symmetric and alternating spaces of tensors, whose dimensions are given by generalized Kronecker coefficients. We describe the algebraic relations for classical constructions of corresponding spanning…

We show that the category of graded modules over a finite-dimensional graded algebra admitting a triangular decomposition can be endowed with the structure of a highest weight category. When the algebra is self-injective, we show…

This article is an expanded version of talks given by the authors in Oberwolfach, Bochum, and at the Fano Conference in Torino. Some new results (e. g. the material concerning flag varieties, Quot spaces over $\P^1$, and the generalized…

We present a geometric formulation of the Multiple Kernel Learning (MKL) problem. To do so, we reinterpret the problem of learning kernel weights as searching for a kernel that maximizes the minimum (kernel) distance between two convex…

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…

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…

The aim of this paper is to introduce the categorical setup which helps us to relate the theory of Macdonald polynomials and the theory of Weyl modules for current Lie algebras discovered by V.\,Chari and collaborators. We identify…