Related papers: On the complexity of evaluating highest weight vec…
We study linear actions of algebraic groups on smooth projective varieties X. A guiding goal for us is to understand the cohomology of "quotients" under such actions, by generalizing (from reductive to non-reductive group actions) existing…
We review and extend the Gauge Vectors-Tensor gravity: a covariant theory of gravity composed of a metric and gauge fields, leading to simple second order partial differential equations of motion, whose Newtonian and strong limits coincide…
The Gauss-Bonnet topological scalar is presented in metric-teleparallel formalism as well as in the symmetric and general teleparallel formulations. In all of the aforementioned frameworks, the full expressions are provided explicitly in…
Given a continuous linear operator $T:X\to X$, where $X$ is a topological vector space, let $\mathrm{UFHC}(T)$ be the set of upper frequently hypercyclic vectors, that is, the set of vectors $x \in X$ such that $\{n \in \omega: T^nx \in…
We identify Whittaker vectors for $\mathcal{W}_k(\mathfrak{g})$-modules with partition functions of higher Airy structures. This implies that Gaiotto vectors, describing the fundamental class in the equivariant cohomology of a suitable…
We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…
An irreducible representation of a reductive Lie algebra, when restricted to a Cartan subalgebra, decomposes into weights with multiplicity. The first part of this paper outlines a procedure to compute symmetric polynomials (e.g., power…
For $G$ a semisimple, simply-connected complex algebraic group and two dominant integral weights $\lambda, \mu$, we consider the dimensions of weight spaces $V_\lambda(\mu)$ of weight $\mu$ in the irreducible, finite-dimensional highest…
Large scale numerical experiments are commonplace today in theoretical physics. The high performance algorithms described herein are the most compact, efficient methods known for representing and analyzing systems modeled well by sets or…
McMullen's g-vector is important for simple convex polytopes. This paper postulates axioms for its extension to general convex polytopes. It also conjectures that, for each dimension d, a stated finite calculation gives the formula for the…
Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…
We study the complexity of counting (weighted) planar graph homomorphism problem $\tt{Pl\text{-}GH}(M)$ parametrized by an arbitrary symmetric non-negative real valued matrix $M$. For matrices with pairwise distinct diagonal values, we…
A general theory of vector-valued modular functions, holomorphic in the upper half-plane, is presented for finite dimensional representations of the modular group. This also provides a description of vector-valued modular forms of arbitrary…
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…
We apply geometric techniques from representation theory to the study of homologically finite differential graded (DG) modules $M$ over a finite dimensional, positively graded, commutative DG algebra $U$. In particular, in this setting we…
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
Perturbation theory (PT) is often used to model statistical observables capturing the translation and rotation-invariant information in cosmological density fields. PT produces higher-order corrections by integration over linear statistics…
Character tables of finite groups and closely related commutative algebras have been investigated recently using new perspectives arising from the AdS/CFT correspondence and low-dimensional topological quantum field theories. Two important…
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…