Related papers: On the complexity of evaluating highest weight vec…
Planar graphs can be represented as intersection graphs of different types of geometric objects in the plane, e.g., circles (Koebe, 1936), line segments (Chalopin \& Gon{\c{c}}alves, 2009), \textsc{L}-shapes (Gon{\c{c}}alves et al, 2018).…
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and NP. They are defined using non-uniform sequences of…
Using Jakobsen theorems, unitarizability in Hermitian Symmetric Spaces is discussed. The set of all missing highest weights is explicitly calculated and the construction of their corresponding highest weights vectors is studied.
We determine the all-genus Hodge-Gromov-Witten theory of a smooth hypersurface in weighted projective space defined by a chain or loop polynomial. In particular, we obtain the first genus-zero computation of Gromov-Witten invariants for…
In the Geometric Median problem with outliers, we are given a finite set of points in d-dimensional real space and an integer m, the goal is to locate a new point in space (center) and choose m of the input points to minimize the sum of the…
General relativity is highly successful in explaining a wide range of gravitational phenomena including the gravitational waves emitted by binary systems and the shadows cast by supermassive black holes. From a modern perspective the theory…
We continue our study of Hilbert space representations of the Reflection Equation Algebra, again focusing on the algebra constructed from the $R$-matrix associated to the $q$-deformation of $GL(N,\mathbb{C})$ for $0<q<1$. We develop a form…
The NP-hard Distinct Vectors problem asks to delete as many columns as possible from a matrix such that all rows in the resulting matrix are still pairwise distinct. Our main result is that, for binary matrices, there is a complexity…
Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…
Graph Neural Networks (GNNs) have gathered increasing interest as learnable solvers of Boolean Satisfiability Problems (SATs), operating on graph representations of logical formulas. However, their performance degrades sharply on harder and…
The possible role of gravity in a noncommutative geometry is investigated. Due to the Moyal *-product of fields in noncommutative geometry, it is necessary to complexify the metric tensor of gravity. We first consider the possibility of a…
The Super-SAT or SSAT problem was introduced by Dinur et al.(2002,2003) to prove the NP-hardness of approximation of two popular lattice problems - Shortest Vector Problem(SVP) and Closest Vector Problem(CVP). They conjectured that SSAT is…
The Gilbert-Johnson-Keerthi (GJK) algorithm is an iterative improvement technique for finding the minimum distance between two convex objects. It can easily be extended to work with concave objects and return the pair of closest points. [4]…
In this paper, starting from the common foundation of Connes' noncommutative geometry (NCG) [1,2,3,4], various possible alternatives in the formulation of a theory of gravity in noncommutative spacetime are discussed in detail. The…
We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate…
We consider robust covariance estimation with group symmetry constraints. Non-Gaussian covariance estimation, e.g., Tyler scatter estimator and Multivariate Generalized Gaussian distribution methods, usually involve non-convex minimization…
Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving…
Let $\mathfrak{g}=\mathfrak{g}_{\bar0}+\mathfrak{g}_{\bar1}$ be a basic classical Lie superalgebra over $\mathbb{C}$, and $e=e_{\theta}\in\mathfrak{g}_{\bar0}$ with $-\theta$ being a minimal root of $\mathfrak{g}$. Set $U(\mathfrak{g},e)$…
In a recent work [2] with Datta, we introduced the mu vector (with respect to a given field) of simplicial complexes and used it to study tightness and lower bounds. In this paper, we modify the definition of mu vectors. With the new…
According to the pioneering work of Nielsen and collaborators, the length of the minimal geodesic in a geometric realization of a suitable operator space provides a measure of the quantum complexity of an operation. Compared with the…