31 citations · 42 across the 2 of their papers we have counts for
4 papers
Polynomial-time computing over quadratic maps I: sampling in real algebraic sets
Dima Grigoriev, Dmitrii V. Pasechnik
Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X))…
The isometries of the cut, metric and hypermetric cones
Antoine Deza, Boris Goldengorin, Dmitrii V. Pasechnik
We show that the symmetry groups of the cut cone Cut(n) and the metric cone Met(n) both consist of the isometries induced by the permutations on {1,...,n}; that is, Is(Cut(n))=Is(M…
Local Characterizations of Geometries
Dmitrii V. Pasechnik
Geometric approach to classical and exceptional groups of Lie type has been quite successful and has led to the deveopment of the concept of buildings and polar spaces. The latter…
On equicut graphs
Michel Deza, Dmitrii V. Pasechnik
The size sz(G) of an l_1-graph G=(V,E) is the minimum of n_f/t_f over all its possible l_1-embeddings f into n_f-dimensional hypercube with scale t_f. In terms of v=|V|, the sum of…