Results 11 to 20 of about 456 (33)

The short resolution of a semigroup algebra [PDF]

open access: yes, 2017
This work generalizes the short resolution given in Proc. Amer. Math. Soc. \textbf{131}, 4, (2003), 1081--1091, to any affine semigroup. Moreover, a characterization of Ap\'{e}ry sets is given.
Ojeda, Ignacio   +1 more
core   +3 more sources

Progress on Polynomial Identity Testing - II [PDF]

open access: yes, 2014
We survey the area of algebraic complexity theory; with the focus being on the problem of polynomial identity testing (PIT). We discuss the key ideas that have gone into the results of the last few years.Comment: 17 pages, 1 figure ...
Saxena, Nitin
core   +2 more sources

Quantum computation of discrete logarithms in semigroups

open access: yesJournal of Mathematical Cryptology, 2014
We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor's algorithms for period finding and the discrete logarithm problem as subroutines.
Childs Andrew M., Ivanyos Gábor
doaj   +1 more source

On the resolvent of an ideal and some applications

open access: yesInternational 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

A Reduction Method for Higher Order Variational Equations of Hamiltonian Systems [PDF]

open access: yes, 2011
Let $\mathbf{k}$ be a differential field and let $[A]\,:\,Y'=A\,Y$ be a linear differential system where $A\in\mathrm{Mat}(n\,,\,\mathbf{k})$. We say that $A$ is in a reduced form if $A\in\mathfrak{g}(\bar{\mathbf{k}})$ where $\mathfrak{g}$ is the Lie ...
Aparicio, Ainhoa, Weil, Jacques-Arthur
core   +2 more sources

Classification of Filiform Lie Algebras up to dimension 7 Over Finite Fields

open access: yesAnalele 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

open access: yesJournal 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

A generalization of Kruskal–Katona’s theorem

open access: yesAnalele 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

Cryptanalysis of matrix conjugation schemes

open access: yesJournal 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

Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective

open access: yesAnalele 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

Home - About - Disclaimer - Privacy