Related papers: A new Algorithm for the Computation of logarithmic…
The main purpose of this paper is to provide explicit computations of the fundamental group of several algebras. For this purpose, given a $k$-algebra $A$, we consider the category of all connected gradings of $A$ by a group $G$ and we…
For an algebraic number field K with 3-class group \(Cl_3(K)\) of type (3,3), the structure of the 3-class groups \(Cl_3(N_i)\) of the four unramified cyclic cubic extension fields \(N_i\), \(1\le i\le 4\), of K is calculated with the aid…
We introduce an algorithm that computes explicit class fields of an imaginary quadratic field $K$ for a given modulus $\mathfrak{f}\subset\mathcal{O}_K$ more efficiently than the use of their classical counterparts. Therein, we prove the…
In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…
In this paper we present an algorithm that computes the genus of a global function field. Let F/k be function field over a field k, and let k0 be the full constant field of F/k. By using lattices over subrings of F, we can express the genus…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
Logistic regression (LR) is an important machine learning model for classification, with wide applications in text classification, image analysis and medicine diagnosis, etc. However, training LR generally entails an iterative gradient…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
The notion of branch numbers of a linear transformation is crucial for both linear and differential cryptanalysis. The number of non-zero elements in a state difference or linear mask directly correlates with the active S-Boxes. The…
The investigation of the ideal class group $Cl_K$ of an algebraic number field $K$ is one of the key subjects of inquiry in algebraic number theory since it encodes a lot of arithmetic information about K. There is a considerable amount of…
The purpose of this paper is to propose an efficient method to compute the automorphism group of an arbitrary hyperelliptic function field (genus>1) over a given ground field of characteristic >2 as well as over its algebraic extensions.
We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements.…
The resummation of logarithms in Quantum Field Theories is a long tale plenty of successes, yet the resummation of logarithms in non-relativistic theories has remained elusive. This was the most frustrating, since the first quantum field…
We analyse the complexity of the computation of the class group structure, regulator, and a system of fundamental units of a certain class of number fields. Our approach differs from Buchmann's, who proved a complexity bound of L(1/2,O(1))…
Let G be a connected reductive group. To any irreducible G-variety one associates a certain linear group generated by reflections called the Weyl group. Weyl groups play an important role in the study of embeddings of homogeneous spaces. We…
Despite the recent progress towards efficient multiple kernel learning (MKL), the structured output case remains an open research front. Current approaches involve repeatedly solving a batch learning problem, which makes them inadequate for…
Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coefficients. In previous papers we parameterized the prime ideals of $K$ in terms of certain invariants attached to Newton polygons of higher…
Based on the general strategy described by Borel and Serre and the Voronoi algorithm for computing unit groups of orders we present an algorithm for finding presentations of $S$-unit groups of orders. The algorithm is then used for some…
In this paper we present a new approach of incorporating kernels into dictionary learning. The kernel K-SVD algorithm (KKSVD), which has been introduced recently, shows an improvement in classification performance, with relation to its…
In a recent work, Girard proposed a new and innovative approach to computational complexity based on the proofs-as-programs correspondence. In a previous paper, the authors showed how Girard proposal succeeds in obtaining a new…