Analogue of Newton-Puiseux series for non-holonomic D-modules and factoring (2008)
We introduce a concept of a fractional-derivatives series and prove that any linear partial differential equation in two independent variables has a fractional-derivatives series solution with...
Non-holonomic Ideals in the Plane and Absolute Factoring (2008)
We study {\it non-holonomic} overideals of a left differential ideal $J\subset F[\partial_x, \partial_y]$ in two variables where $F$ is a differentially closed field of characteristic zero. The main...
{\bf Construction.} For a dominating polynomial mapping {$F: K^n\to K^l$} with an isolated critical value at 0 ($K$ an algebraically closed field of characteristic zero) we construct a closed {\it...
An Improved Limit on the Muon Electric Dipole Moment (2008)
Bennett, G. W., Bousquet, B., Brown, H. N., Bunce, G., Carey, R. M., Cushman, P., ...
Three independent searches for an electric dipole moment (EDM) of the positive and negative muons have been performed, using spin precession data from the muon g-2 storage ring at Brookhaven National...
M. Schmidbauer, Zh.M. Wang, Yu.I. Mazur, P.M. Lytvyn, G.J. Salamo, ...
Journal article
Coherent x-ray imaging of individual islands in GISAXS geometry (2007)
I.A. Vartanyants, D. Grigoriev, A.V. Zozulya
Journal article
Theoretical analysis of surface pressure of monolayers formed by nano-particles (2006)
Fainerman, V. B., Kovalchuk, V. I., Grigoriev, D., Leser, M. E., Miller, R.
Making good foams and emulsions – the role of adsorption layer properties (2006)
Leser, M. E., Serieye, S., Frossard, P., Acquistapatce, S., Appolonia-Nouzille, C., ...
M. Schmidbauer, Sh. Seydmohamadi, D. Grigoriev, Zh.M. Wang, Yu.I. Mazur, ...
Journal article
Quantum optical device accelerating dynamic programming (2005)
Grigoriev, D., Kazakov, A., Vakulenko, S.
In this paper we discuss analogue computers based on quantum optical systems accelerating dynamic programming for some computational problems. These computers, at least in principle, can be realized...
Generalized Loewy decomposition of D-modules (2005)
Starting from the well-known factorization of linear ordinary differential equations, we define the generalized Loewy decomposition for a ${\\cal D}$-module. To this end, for any module $I$,...
Generalized loewy decomposition of D-modules (2005)
Starting from the well-known factorization of linear ordinary differential equations, we define the generalized Loewy decomposition for a ${\\cal D}$-module. To this end, for any module $I$,...
D. Grigoriev, M. Schmidbauer, P. Schäfer, S. Besedin, Yu. Besedin, ...
Journal article
No evidence for large-scale proton ordering in Antarctic ice from powder neutron diffraction. (2004)
Fortes, A. D., Wood, I. G., Grigoriev, D., Alfredsson, M., Kipfstuhl, S.
Grain boundary hierarchy in the EPICA-DML deep ice core, Antarctica (2004)
Hamann, I., Kipfstuhl, S., Faria, S. H., Lambrecht, A., Grigoriev, D., Marino, F.
No evidence for large-scale proton ordering in Antarctic ice from powder neutron diffraction (2004)
Fortes, A D, Wood, I G, Grigoriev, D, Alfredsson, M, Kipfstuhl, S, Knight, K S, ...
We have examined a sample of 3000 year old Antarctic ice, collected at the Kohnen Station, by time-of-flight powder neutron diffraction to test the hypothesis of Fukazawa et al. [e.g., Ann. Glaciol....
Factoring and Solving Linear Partial Differential Equations (2004)
The problem of factoring a linear partial differential operator is studied. An algorithm is designed which allows one to factor an operator when its symbol is separable, and if in addition the...
Diffuse X-ray scattering of InGaAs/GaAs quantum dots (2004)
Hanke, M., Grigoriev, D., Schmidbauer, M., Schäfer, P., Köhler, R., Pohl, U.W., ...
M. Hanke, M. Schmidbauer, D. Grigoriev, H. Raidt, P. Schäfer, ...
Journal article
Aspect ratio of LPE-SiGe/Si(001) islands as probed by high resolution x-ray diffraction (2004)
M. Hanke, M. Schmidbauer, D. Grigoriev, R. Köhler
Journal article
M. Hanke, M. Schmidbauer, D. Grigoriev, H. Raidt, P. Schäfer, ...
Journal article
Aspect ratio of LPE-SiGe/Si(001) islands as probed by high resolution x-ray diffraction (2004)
M. Hanke, M. Schmidbauer, D. Grigoriev, R. Köhler
Journal article
Diffuse X-Ray Scattering of InGaAs/GaAs Quantum Dots (2004)
M. Hanke, D. Grigoriev, M. Schmidbauer, P. Schäfer, R. Köhler, ...
Journal article
M. Hanke, D. Grigoriev, M. Schmidbauer, P. Schäfer, R. Köhler, ...
Journal article
On non-abelian homomorphic public-key cryptosystems (2002)
Grigoriev, D., Ponomarenko, I.
An important problem of modern cryptography concerns secret public-key computations in algebraic structures. We construct homomorphic cryptosystems being (secret) epimorphisms f:G --> H, where G, H...
Public-key cryptography and invariant theory (2002)
Public-key cryptosystems are suggested based on invariants of groups. We give also an overview of the known cryptosystems which involve groups.
Some Polytime Algorithms for Shortest Paths Approximations in 3-Dimensional Space (2001)
D. Burago, D. Grigoriev, A. Slissenko
We consider two 3-dimensional situations when a polytime algorithm for approximating a shortest path can be constructed. The main part of the paper treats a well known problem of constructing a...
Resonant Amplification of Electroweak Baryogenesis at Preheating (2001)
Cornwall, J. M., Grigoriev, D., Kusenko, A.
We explore viable scenarios for parametric resonant amplification of electroweak (EW) gauge fields and Chern-Simons number during preheating, leading to baryogenesis at the electroweak (EW) scale. In...
The project of upgrading the detector CMD-2 is presented. The upgraded detector is called CMD-2M and is going to take data with new collider VEPP-2000 at BINP. The general structure of the detector...
Some Polytime Algorithms for Shortest Paths Approximations in 3-Dimensional Space (2000)
D. Burago, D. Grigoriev, A. Slissenko
We consider two 3-dimensional situations when a polytime algorithm for approximating a shortest path can be constructed. The main part of the paper treats a well known problem of constructing a...
Complexity Lower Bounds For Randomized Computation Trees Over Zero Characteristic Fields (2000)
this paper can be extended from the considered above arrangements to the so-called "distorted" arrangements. Namely, for irreducible polynomials h 1 ; : : : ; hm 2 F [X 1 ; : : : ; Xn ] (here we...
Randomized Complexity Lower Bounds (2000)
this paper we consider RCT over an arbitrary zerocharacteristic field F with branching signs f=; 6=g and also more customary RCT over reals with branching signs f; ?g. We remind (see e.g. [24], [19],...
Testing Shift-Equivalence of Polynomials Using Quantum Machines (2000)
1 Introduction In the paper we deal with the problem of testing, whether two given polynomials f; g 2 F [X1 ; : : : ; Xn ] are shift-equivalent, i.e. there exists a shift ff 1 ; : : : ; ff n such...
Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane (2000)
. Given a set of semi-algebraic obstacles in the plane and two points in the same connected component of the complement, the problem is to construct a polygonal path between these points which has...
Testing Shift-Equivalence Of Polynomials By Deterministic, Probabilistic And Quantum Machines (2000)
10.08> n ) = f . Introduction In the paper we deal with the problem of testing, whether two given polynomials f; g 2 F [X 1 ; : : : ; Xn ] are shift-equivalent, i.e. there exists a shift ff 1 ; : : :...
An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX (2000)
D. Grigoriev, M. Karpinski, A. C. Yao
We prove an exponential lower bound on the size of any fixed-degree algebraic decision tree for solving MAX, the problem of finding the maximum of n real numbers. This complements the n Gamma 1 lower...
Complexity Lower Bounds For Computation Trees With Elementary Transcendental Function Gates (2000)
. We consider computation trees which admit as gate functions along with the usual arithmetic operations also algebraic or transcendental functions like exp, log, sin, square root (defined in the...
Given a set of semi-algebraic obstacles in the plane and two points in the same connected component of the complement, the problem is to construct the shortest path between these points in a given...
Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs (1999)
this paper we develop an approach which allows to produce explicitly a system of polynomials of degree 6 and to prove a linear lower bound on the degree of its boolean Nullstellensatz refutation....
An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX (1996)
D. Grigoriev, M. Karpinski, A. C. Yao
. We prove an exponential lower bound on the size of any fixeddegree algebraic decision tree for solving MAX, the problem of finding the maximum of n real numbers. This complements the n Gamma 1...