Related papers: On the complexity of evaluating highest weight vec…
We present a proof of Thue-Siegel-Roth's Theorem (and its more recent variants, such as those of Lang for number fields and that "with moving targets" of Vojta) as an application of Geometric Invariant Theory (GIT). Roth's Theorem is…
This article gives conjecturally correct algorithms to construct canonical bases of the irreducible polynomial representations and the matrix coordinate rings of the nonstandard quantum groups in GCT4 and GCT7, and canonical bases of the…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…
The transmission of a vertex $v$ of a graph $G$ is the sum of distances from $v$ to all the other vertices in $G$. The Wiener complexity of $G$ is the number of different transmissions of its vertices. Similarly, the eccentric complexity of…
For every involution $\mathbf{w}$ of the symmetric group $S_n$ we establish, in terms ofa special canonical quotient of the dominant Verma module associated with $\mathbf{w}$, an effective criterion, which allows us to verify whether the…
A modified theory of gravity, avoiding singularities in the standard theory of gravitation, has been developed by Hess & Greiner, known as the pseudo-complex theory of gravitation. The pc-GR theory shows remarkable observational differences…
This is the first paper in a series (of four) designed to show how to use geometric algebras of multivectors and extensors to a novel presentation of some topics of differential geometry which are important for a deeper understanding of…
A strong geodetic set of a graph~$G=(V,E)$ is a vertex set~$S \subseteq V(G)$ in which it is possible to cover all the remaining vertices of~$V(G) \setminus S$ by assigning a unique shortest path between each vertex pair of~$S$. In the…
We realize the $\mathrm{GL}_n(\mathbb{C})$-modules $S^k(S^m(\mathbb{C}^n))$ and $\Lambda^k(S^m(\mathbb{C}^n))$ as spaces of polynomial functions on $n\times k$ matrices. In the case $k=3$, we describe explicitly all the…
This paper proposes a novel method for deep learning based on the analytical convolution of multidimensional Gaussian mixtures. In contrast to tensors, these do not suffer from the curse of dimensionality and allow for a compact…
This paper introduces and solves the Generalized Heron-Waist Problem (GHWP), that integrates the classical Heron problem of optimal hub location and the waist problem of minimal-perimeter configuration. The GHWP seeks an optimal closed…
Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…
Generalized Quasitopological Gravities (GQTGs) are higher-order extensions of Einstein gravity in $D$ dimensions satisfying a number of interesting properties, such as possessing second-order linearized equations of motion on top of…
The complexity of graph homomorphism problems has been the subject of intense study. It is a long standing open problem to give a (decidable) complexity dichotomy theorem for the partition function of directed graph homomorphisms. In this…
With a view toward a fracton theory in condensed matter, we introduce a higher-moment polynomial degree-p global symmetry, acting on complex scalar/vector/tensor fields (e.g., ordinary or vector global symmetry for p$=0$ and p$=1$…
In this paper we continue our investigation of the global categorical symmetries that arise when gauging finite higher groups and their higher subgroups with discrete torsion. The motivation is to provide a common perspective on the…
Let $G$ be a finitely presented group. A new complexity called \textit{Karoubi-Weibel complexity} or \textit{covering type}, is defined for $G$. The construction is inspired by recent work of Karoubi and Weibel \cite{KW}, initially applied…
Given a finite group $G$ and two unitary $G$-representations $V$ and $W$, possible restrictions on Brouwer degrees of equivariant maps between representation spheres $S(V)$ and $S(W)$ are usually expressed in a form of congruences modulo…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…