Results 271 to 280 of about 617,016 (320)
Some of the next articles are maybe not open access.
Journal of Mathematical Sciences, 2002
Let \(n\) be an odd integer. Then the splitting fields \(K\) of \(f(x)= x^4- 2nx-1\) over \(\mathbb{Q}\) has Galois group \(S_4\). The author proves that the nonsplit embedding problem of \(K/\mathbb{Q}\) with kernel of order 2 has a solution if in the prime decomposition of \(16+ 27n^4\) the primes of odd multiplicity are of the form \(8m+ 1\), \(8m ...
openaire +2 more sources
Let \(n\) be an odd integer. Then the splitting fields \(K\) of \(f(x)= x^4- 2nx-1\) over \(\mathbb{Q}\) has Galois group \(S_4\). The author proves that the nonsplit embedding problem of \(K/\mathbb{Q}\) with kernel of order 2 has a solution if in the prime decomposition of \(16+ 27n^4\) the primes of odd multiplicity are of the form \(8m+ 1\), \(8m ...
openaire +2 more sources
Journal of Combinatorial Mathematics and Combinatorial Computing
We propose and study the problem of finding the smallest nonnegative integer s such that a GDD ( m , n , 3 ; 0 , λ ) can be embedded into a BIBD ( m n + s , 3 , λ ) . We find the values of s for all cases except for the case where n ≡ 5 ( mod 6 ) and m ≡ 1 , 3 ( mod 6 ) and m ≥ 3 , which remains as an open problem.
Sarvate, Dinesh G., Zhang, Li
openaire +2 more sources
We propose and study the problem of finding the smallest nonnegative integer s such that a GDD ( m , n , 3 ; 0 , λ ) can be embedded into a BIBD ( m n + s , 3 , λ ) . We find the values of s for all cases except for the case where n ≡ 5 ( mod 6 ) and m ≡ 1 , 3 ( mod 6 ) and m ≥ 3 , which remains as an open problem.
Sarvate, Dinesh G., Zhang, Li
openaire +2 more sources
On the Embedding Problem in Differential Geometry
American Journal of Mathematics, 19501. The theorem. Let gik gik(U, v) be the elements of a 2 by 2, symmetric, positive definite (function) matrix, defined in a neighborhood of (un, v) (0, 0). The problem to be dealt with concerns the existence of a 2-dimensional surface, in a 3-dimensional Euclidean space, for which ds2 = g,dU2 + 2g12du dv + g22dV2; in other words, with the existence of ...
Hartman, Philip, Wintner, Aurel
openaire +1 more source
Journal of Mathematical Physics, 1988
This paper contains two results. First it is shown that the three-dimensional Riemannian space, which is invariant under the transformations of the rotation group, cannot be embedded in a four-dimensional Euclidean space (except, of course, for the three-dimensional sphere).
openaire +1 more source
This paper contains two results. First it is shown that the three-dimensional Riemannian space, which is invariant under the transformations of the rotation group, cannot be embedded in a four-dimensional Euclidean space (except, of course, for the three-dimensional sphere).
openaire +1 more source
2004
Let K[x1, ... , x n ] be the polynomial algebra in n variables over a field K. Any collection of polynomials p1, ... , p m from K[x1, ... , x n ] determines an algebraic variety {p i = 0, i = 1, ... , m} in the affine space K n . We shall denote this algebraic variety by V (p1, ... , p m ).
Alexander A. Mikhalev +2 more
openaire +1 more source
Let K[x1, ... , x n ] be the polynomial algebra in n variables over a field K. Any collection of polynomials p1, ... , p m from K[x1, ... , x n ] determines an algebraic variety {p i = 0, i = 1, ... , m} in the affine space K n . We shall denote this algebraic variety by V (p1, ... , p m ).
Alexander A. Mikhalev +2 more
openaire +1 more source
The embedding problem for predistance matrices
Bulletin of Mathematical Biology, 1991A fundamental problem in molecular biology is the determination of the conformation of macromolecules from NMR data. Several successful distance geometry programs have been developed for this purpose, for example DISGEO. A particularly difficult facet of these programs is the embedding problem, that is the problem of determining those conformations ...
Glunt, W., Hayden, T. L., Liu, Wei-Min
openaire +3 more sources
An Embedding Problem with Cyclic Kernel
Journal of Mathematical Sciences, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ishkhanov, V. V., Lur'e, B. B.
openaire +1 more source
Ultrasolvability and Singularity in the Embedding Problem
Journal of Mathematical Sciences, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kiselev, D. D., Lur'e, B. B.
openaire +1 more source
THE EMBEDDING PROBLEM WITH GIVEN LOCALIZATIONS
Mathematics of the USSR-Izvestiya, 1975In this paper we find necessary and sufficient conditions, stated in cohomological terms, for the existence of a solution to the numerical abelian imbedding problem with given local behavior for a finite set of prime points.Bibliography: 6 items.
openaire +2 more sources
IFAC Proceedings Volumes, 2005
Abstract We compute a stable polynomial matrix embedding a stabilizable one. The algorithm resembles the one described by Beelen and Van Dooren for the unimodular embedding problem. We also desribe the numerical problems associated with this kind of algorithms, and point out why the stable embedding algorithm has better prospects than its unimodular ...
R. Zavala Yoé +2 more
openaire +3 more sources
Abstract We compute a stable polynomial matrix embedding a stabilizable one. The algorithm resembles the one described by Beelen and Van Dooren for the unimodular embedding problem. We also desribe the numerical problems associated with this kind of algorithms, and point out why the stable embedding algorithm has better prospects than its unimodular ...
R. Zavala Yoé +2 more
openaire +3 more sources