15 citations · 24 across the 9 of their papers we have counts for
10 papers
On Certificates for Almost Sure Reachability in Stochastic Systems
Arash Bahari Kordabad, Rupak Majumdar, Harshit Jitendra Motwani +1
Almost sure reachability refers to the property of a stochastic system whereby, from any initial condition, the system state reaches a given target set with probability one. In thi…
Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi +3
The problem of checking satisfiability of linear real arithmetic (LRA) and non-linear real arithmetic (NRA) formulas has broad applications, in particular, they are at the heart of…
Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
Giovanna K. Conrado, Amir K. Goharshady, Harshit J. Motwani +1
We present efficient combinatorial parameterized algorithms for several classical graph-based counting problems in computational chemistry, including (i) Kekule structures, (ii) th…
Template-based Program Synthesis using Stellensätze
Amir Kafshdar Goharshady, S. Hitarth, Fatemeh Mohammadi +1
Template-based synthesis, also known as sketching, is a localized approach to program synthesis in which the programmer provides not only a specification, but also a high-level ``s…
Global Rigidity of Line Constrained Frameworks
James Cruickshank, Fatemeh Mohammadi, Harshit J Motwani +2
We consider the global rigidity problem for bar-joint frameworks where each vertex is constrained to lie on a particular line in . In our setting we allow multiple ver…
The Linear Span of Uniform Matrix Product States
Claudia De Lazzari, Harshit J Motwani, Tim Seynnaeve
The variety of uniform matrix product states arises both in algebraic geometry as a natural generalization of the Veronese variety, and in quantum many-body physics as a model for…
The leading coefficient of Lascoux polynomials
Alessio Borzí, Xiangying Chen, Harshit J. Motwani +2
Lascoux polynomials have been recently introduced to prove polynomiality of the maximum-likelihood degree of linear concentration models. We find the leading coefficient of the Las…
Matroid stratifications of hypergraph varieties, their realization spaces, and discrete conditional independence models
Oliver Clarke, Kevin Grace, Fatemeh Mohammadi +1
We study varieties associated to hypergraphs from the point of view of projective geometry and matroid theory. We describe their decompositions into matroid varieties, which may be…
Computing Maximum Likelihood Estimates for Gaussian Graphical Models with Macaulay2
Carlos Améndola, Luis David García Puente, Roser Homs +2
We introduce the package "GraphicalModelsMLE" for computing the maximum likelihood estimates (MLEs) of a Gaussian graphical model in the computer algebra system Macaulay2. This pac…
Conditional probabilities via line arrangements and point configurations
Oliver Clarke, Fatemeh Mohammadi, Harshit J. Motwani
We study the connection between probability distributions satisfying certain conditional independence (CI) constraints, and point and line arrangements in incidence geometry. To a…