Results 11 to 20 of about 74 (62)
Approximation numérique de racines isolées multiples de systèmes analytiques [PDF]
, 2019 The approximation of a multiple isolated root is a dicult problem. In fact the root can even be arepulsive root for a fixed point method like the Newton method.
Yakoubsohn, Jean-Claude, Giusti, Marc
core +8 more sources
On the resolvent of an ideal and some applications
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 70, Page 4421-4434, 2003., 2003 We give an algorithm to compute a resolvent of an algebraic variety without computing its irreducible components; we decompose the radical of an ideal into prime ideals and we test the primality of a regular ideal.
Driss Bouziane, Abdelilah Kandri Rody
wiley +1 more source
Classification of Filiform Lie Algebras up to dimension 7 Over Finite Fields
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 This paper tries to develop a recent research which consists in using Discrete Mathematics as a tool in the study of the problem of the classification of Lie algebras in general, dealing in this case with filiform Lie algebras up to dimension 7 over ...
Falcón Óscar J. +4 more
doaj +1 more source
Analysis of a certain polycyclic-group-based cryptosystem
Journal of Mathematical Cryptology, 2015 We investigate security properties of the Anshel–Anshel–Goldfeld commutator key-establishment protocol [Math. Res. Lett. 6 (1999), 287–291] used with certain polycyclic groups described by Eick and Kahrobaei [http://arxiv.org/abs/math.GR/0411077].
Kotov Matvei, Ushakov Alexander
doaj +1 more source
APPROXIMATION NUMÉRIQUE DE RACINES ISOLÉES MULTIPLES DE SYSTÈMES ANALYTIQUES
, 2018 . The approximation of a multiple isolated root is a difficult problem. In fact the root can even be a repulsive root for a fixed point method like the Newton method.
Yakoubsohn, Jean-Claude, Giusti, M
core +4 more sources
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 In this paper, the maximal abelian dimension is algorithmically and computationally studied for the Lie algebra hn, of n×n upper-triangular matrices. More concretely, we define an algorithm to compute abelian subalgebras of hn besides programming its ...
Ceballos Manuel +2 more
doaj +1 more source
A generalization of Kruskal–Katona’s theorem
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 Let K be a field, E the exterior algebra of a finite dimensional K-vector space, and F a finitely generated graded free E-module with homogeneous basis g1, . . ., gr such that deg g1 ≤ deg g2 ≤ · · · ≤ deg gr.
Amata Luca, Crupi Marilena
doaj +1 more source
Symbolic computation of optimal systems of subalgebras of three- and four-dimensional real Lie algebras [PDF]
Open Communications in Nonlinear Mathematical PhysicsThe complete optimal systems of subalgebras of all nonisomorphic three- and four-dimensional real Lie algebras are analyzed by the program \symbolie running in the computer algebra system \emph{Wolfram Mathematica}\texttrademark.
Luca Amata +2 more
doaj +1 more source
Cryptanalysis of matrix conjugation schemes
Journal of Mathematical Cryptology, 2014 In this paper we cryptanalyze two protocols: the Grigoriev–Shpilrain authentication protocol and a public key cryptosystem due to Wang, Wang, Cao, Okamoto and Shao.
Myasnikov Alex D., Ushakov Alexander
doaj +1 more source
Parallel Homotopy Algorithms to Solve Polynomial Systems
, 2006 Homotopy continuation methods to compute numerical approximations to all isolated solutions of a polynomial system are known as “embarrassingly parallel”, i.e.: because of their low communication overhead, these methods scale very well for a large number
Jan Verschelde, Anton Leykin, Yan Zhuang
core +1 more source