Related papers: On the complexity of evaluating highest weight vec…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
Let $V$ be a linear representation of a connected complex reductive group $G$. Given a choice of character $\theta$ of $G$, Geometric Invariant Theory defines a locus $V^{ss}_\theta(G) \subseteq V$ of semistable points. We give necessary,…
In this article, we give a survey of Geometric Invariant Theory for Toric Varieties, and present an application to the Einstein-Weyl Geometry. We compute the image of the Minitwistor space of the Honda metrics as a categorical quotient…
Many real world categories are multimodal, with single classes occupying disjoint regions in feature space. Classical linear models (logistic regression, linear SVM) use a single global hyperplane and perform poorly on such data, while…
Let $k$ be a field, let $G$ be a reductive algebraic group over $k$, and let $V$ be a linear representation of $G$. Geometric invariant theory involves the study of the $k$-algebra of $G$-invariant polynomials on $V$, and the relation…
Motivated by problems in algebraic complexity theory (e.g., matrix multiplication) and extremal combinatorics (e.g., the cap set problem and the sunflower problem), we introduce the geometric rank as a new tool in the study of tensors and…
The Strong Exponential Time Hypothesis (SETH) asserts that for every $\varepsilon>0$ there exists $k$ such that $k$-SAT requires time $(2-\varepsilon)^n$. The field of fine-grained complexity has leveraged SETH to prove quite tight…
Let k be an algebraically closed field of arbitrary characteristic. First we give explicit bases for the highest weight vectors for the action of GL_r x GL_s on the coordinate ring k[Mat_{rs}^m] of m-tuples of r x s-matrices. It turns out…
Geometric constraints between feature matches are critical in 3D point cloud registration problems. Existing approaches typically model unordered matches as a consistency graph and sample consistent matches to generate hypotheses. However,…
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…
The $G$-representation variety $R_G(\Sigma_g)$ parametrizes the representations of the fundamental groups of surfaces $\pi_1(\Sigma_g)$ into an algebraic group $G$. Taking $G$ to be the groups of $n \times n$ upper triangular or unipotent…
The ability to align points across two related yet incomparable point clouds (e.g. living in different spaces) plays an important role in machine learning. The Gromov-Wasserstein (GW) framework provides an increasingly popular answer to…
The Separation of Variables theory for the Hamilton-Jacobi equation is 'by definition' related to the use of special kinds of coordinates, for example Jacobi coordinates on the ellipsoid or St\"ackel systems in the Euclidean space. However,…
In this paper, we consider an arbitrary irreducible unitary representation $(\pi_{\lambda},V_{\lambda})$ of a compact connected, simply connected semisimple Lie group $G$ with highest weight $\lambda$, and apply the idea of…
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…
Gaussian graphical models can capture complex dependency structures among variables. For such models, Bayesian inference is attractive as it provides principled ways to incorporate prior information and to quantify uncertainty through the…
Curvature in form of the Hessian or its generalized Gauss-Newton (GGN) approximation is valuable for algorithms that rely on a local model for the loss to train, compress, or explain deep networks. Existing methods based on implicit…
We revisit the classical Goddard-Kent-Olive coset construction. We find the formulas for the highest weight vectors in coset decomposition and calculate their norms. We also derive formulas for matrix elements of natural vertex operators…
Thanks to earlier work of Koiran, it is known that the truth of the Generalized Riemann Hypothesis (GRH) implies that the dimension of algebraic sets over the complex numbers can be determined within the polynomial-hierarchy. The truth of…
We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether's Normalization Lemma. For general explicit varieties, as formally defined in this paper, we give a randomized…