Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Rao, Sujit"'
Autor:
Rao, Sujit
The sum-of-squares hierarchy of semidefinite programs has become a common tool for algorithm design in theoretical computer science, including problems in quantum information. In this work we study a connection between a Hermitian version of the SoS
Externí odkaz:
http://arxiv.org/abs/2411.04057
Autor:
Rao, Sujit
The noncommutative sum-of-squares (ncSoS) hierarchy was introduced by Navascu\'{e}s-Pironio-Ac\'{i}n as a sequence of semidefinite programming relaxations for approximating values of noncommutative polynomial optimization problems, which were origina
Externí odkaz:
http://arxiv.org/abs/2311.09010
Autor:
Rao, Sujit
We introduce fully general Macaulay bases of modules, which are a common generalization of Groebner bases and Macaulay 𝐻-bases to suitably graded modules over a commutative graded k-algebra, where the index sets of the two gradings may differ. The
Externí odkaz:
https://hdl.handle.net/1721.1/139576
It is a useful fact in classical computer science that many search problems are reducible to decision problems; this has led to decision problems being regarded as the $\textit{de facto}$ computational task to study in complexity theory. In this work
Externí odkaz:
http://arxiv.org/abs/2111.02999
The Chow ring of a matroid (or more generally, atomic latice) is an invariant whose importance was demonstrated by Adiprasito, Huh and Katz, who used it to resolve the long-standing Heron-Rota-Welsh conjecture. Here, we make a detailed study of the C
Externí odkaz:
http://arxiv.org/abs/1802.04241
Autor:
Rao, Sujit, Suk, Joe
Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially $q$-analogues, have useful interpretations related to actions and representations of the cyclic group. We propose a definition of sieving for an arbitrary gro
Externí odkaz:
http://arxiv.org/abs/1710.06517
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.