Journal Information

Applicable Algebra in Engineering, Communication and Computing

Please Login to view website of journal
Free account: view official websites, track deadlines, and get email reminders.
Register Login
Impact Factor:
0.5
Publisher:
Springer
ISSN:
0938-1279
Viewed:
21020
Tracked:
0
Something wrong with this page? Tell us
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.

Call For Papers

Applicable Algebra in Engineering, Communication and Computing is an academic journal published by Springer. (ISSN 0938-1279, impact factor 0.5).

Aims and scope Algebra is ubiquitous in science and a common language in many disciplines. In developing this language, mathematicians prove results and design methods that often have applications in different scientific areas. In using this language, scientists consider algebra as an indispensable tool to create methods and techniques that facilitate their research. Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic results, methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, finite fields, algebraic curves, curves and geometry, number theory, error correcting codes, cryptography, arithmetics, algorithms, complexity, computer algebra, symbolic computation, term rewriting systems, theorem proving, vision, robotics. The Journal was founded by Thomas Beth and Jacques Calmet as a spin-off of the AAECC conference oriented to algebraic techniques in coding theory started by Alain Poli in 1983; the aim was “interdisciplinarity based upon the notion of applicable algebra”. Reformulating and adapting Thomas Beth’s introduction to the AAECC-4 Conference, the general aims of the A.A.E.C.C. Journal can be expressed in the form of the following pentagon: AA Applicable Algebra: Algebraic foundations and techniques applicable to any scientific area, mainly mathematics, statistics, computer science, electrical and communications engineering AE Algebraic Engineering: Algebraic algorithms, their improvements, complexity analysis EC Error-correcting Codes: Algebraic structure, analysis, optimality, engineering and communication applications CC Combinatorics and Cryptography: Combinatorial techniques leading to effective applications, classical mathematics applied to cryptography and cryptographic systems CA Computer Algebra: Symbolic and algebraic computation, solving polynomial systems, mathematical software We therefore intend to attract papers which have a solid mathematical background (in algebra or related topics such as combinatorics and number theory) and have some potential applications. Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of potential interest for applications in the above mentioned fields are relevant for this journal. On the practical side, technology and know-how transfer papers from engineering and computer science are out of the scope of the journal unless they stimulate or illustrate research in applicable algebra.
Last updated by Admin Agent on

Special Issues

Special Issue on GRÖBNER FREE METHODS AND THEIR APPLICATIONS Submission Date: 2026-11-30 CALL FOR PAPERS. SPECIAL ISSUE OF AAECC “GRÖBNER FREE METHODS AND THEIR APPLICATIONS”, April 13—15, 2026, BARCELONA We kindly invite interested researchers (not limited to the participants at the event) to submit a paper to the special issue of the journal AAECC (Applicable Algebra in Engineering, Communications and Computing) dedicated to Gröbner free methods and their applications 2026. This special issue will include selected refereed original papers not simultaneously submitted to another journal or conference which are within the scope of the conference which have been stated in the call as follows. Hilbert's and Gordan's proofs of the Basissatz, which both consisted in giving an algorithm (an algorithm, not a procedure!) for producing a Gröbner basis of a given ideal, settled the elementary approach toward Buchberger Theory: from the need of a term-ordering (stated implicitly by Hilbert and explicitly by Gordan) to the introduction of a rewriting procedure, which in Gordan is exactly Buchberger's. The first group of researchers who deeply studied the notions and the tools introduced by Hilbert in his seminal paper, as Macaulay, Gunther and (mainly) Janet (who, studying with and under Hilbert, reinterpreted Riquier's results) are, consequently, the first which introduced the most important alternatives to Buchberger Algorithm for producing Gröbner bases: Macaulay's Matrix from which Faugère's F4-F5 stemmed and Janet's involutive bases. The influence that Gröbner bases have had on Algebra and Geometry during the last 40 years cannot be overstated; however, using Buchberger's algorithm as a default method in solving problems may lead to unnecessary computations. Consequently, alternative algorithms have been proposed: Gröbner-free Solving (or, more generally, Degröbnerization), proposes to find alternative ways to get the same solutions, using, for example, tools from Linear Algebra and from Combinatorics. The idea is that computable objects for studying algebraic varieties, constructible or semi-algebraic sets might be defined and/or computed without imposing Gröbner bases as a prerequisite. Therefore, new ways to solve specific problems that have been originally solved using Gröbner basis computation and Buchberger's reduction, are searched, leaving the use of the latter only to the cases where it is really necessary. Usually, the "new ways" consist in using linear algebra and combinatorial methods. Gröbner-free combinatorial approaches are also largely used (and promise to be more effective) to study the reverse problem with respect to solving, namely the bonding problem for algebras and ideals: Given the variety associated with a 0-dimensional ideal, i.e. a finite set of points, the structure of the quotient algebra (which actually contains more information than the ideal itself) can be recovered only using Combinatorics. The four cornerstones of Degröbnerization are: - Auzinger-Stetter Matrices, - Mourrain's notion of connected to 1, - Lundqvist's fast algorithm for merging sorted lists of monomials and adding polynomials, and - Cerlienco-Mureddu Correspondence. The central point of such alternative Gröbner-free approaches to bonding, is to switch in the study of A=k[x_1,..,x_n]/I(X), X a finite set of points, from the study of the structure of the ideal I(X) to the one of the algebra itself. Specific topics include, but are not limited to the following ones: - To improve and optimize Buchberger's, Janet's and Macaulay's algorithms; - To extend them to a wider class of (not necessarily commutative) rings; for instance Moeller's reformulation of Buchberger completion/test in terms of his Lifting Theorem is today available in each effectively given ring (in the sense used by Grete Hermann and van der Waerden); - Recent developments on the theory - started by Hilbert - on "how to concretely manipulate polynomial ideals", e.g. ideal theory, resolutions, Hilbert function,... - Extensions to subalgebras; - Combinatorial techniques to deal with monomial/polynomial ideals; - 0-dimensional solving/bonding problems; - Application of classical matrices for manipulating algebras and ideals; - Extension of degröbnerization to non 0-dimensional ideals; - Extension of degröbnerization to sub-algebras; - Tag-variable techniques; - Extension of degröbnerization to non-commutative settings; - Applications of both approaches, for example to coding theory, cryptography, reverse engineering, algebraic statistics and so on; - Upper and Lower Bounds in Algebraic Complexity Theory; - Computational Methods in Algebraic and Diophantine Geometry; - Complexity of Elimination Theory and Commutative Algebra in general; - Complexity of Symbolic Algorithms in Linear and Non-Linear Algebra; - Computational Methods in Real Algebraic Geometry; - Computational Complexity. Editors of this Special Issue are: - Per Bäck (Mälardalen University, Sweden) - Michela Ceria (DMMM, Poliba) - Fatemeh Mohammadi (KU Leuven, Belgium) - Samuel Lundqvist (Stockholm University) - Teo Mora (Università degli Studi di Genova) - Alessandro Oneto (Università degli Studi di Genova) - Eduardo Sáenz de Cabezón (Universidad de la Rioja). Important dates: - Submission deadline: November 30, 2026 - Author notification: May 1, 2027 - Revisions due: June 1, 2027 Publication in AAECC: - Online : early 2028 - Hardcopy: 2028 Submission Guidelines: All papers must be original and not simultaneously submitted to another journal or conference. Please submit all papers as .pdf attachments to [email protected], using the LaTeX template available here: https://www.springer.com/journal/200/submission-guidelines#:~:text=Springer%20Nature%20LaTeX%20template Please use the subject line "Submission for SI_AN". Authors should prepare their manuscript according to the Instructions for Authors available from the Journal’s submission guidelines: https://link.springer.com/journal/200/submission-guidelinesSubmitted papers should present original, unpublished work, relevant to one of the topics of the special issue. All submitted papers will be evaluated on the basis of relevance, significance of contribution, technical quality, scholarship, and quality of presentation by at least two independent reviewers. It is the policy of the journal that no submission, or substantially overlapping submission, be published or be under review at another journal or conference at any time during the review process. The papers will undergo the standard, rigorous journal review process and be accepted only if well-suited to the topic of this special issue and meeting the scientific level of the journal. Final decisions on all papers are made by the Editor in Chief. https://link.springer.com/collections/bibcejehdb
Last updated by Admin Agent on

Related Journals

CCFFull NameImpact FactorPublisherISSN
Computing2.8Springer0010-485X
Visualization in EngineeringSpringer2213-7459
Computing and Visualization in ScienceSpringer1432-9360
Computing in Science & Engineering1.9IEEE1521-9615
CNatural Computing1.6Springer1567-7818
International Journal of Automation and ComputingSpringer1476-8186
CSoft Computing2.5Springer1432-7643
CTheory of Computing Systems0.4Springer1432-4350
Journal of Cloud ComputingSpringer2192-113X
Statistics and Computing1.6Springer0960-3174

Related Conferences

CCFICORECP-IShortFull NameSubmissionConference
B51.3CASCComputer Algebra in Scientific Computing2026-04-242026-08-31
B48.0CALCOConference on Algebra and Coalgebra in Computer Science2015-03-222015-06-24
AA*95.9SIGIRInternational Conference on Research and Development in Information Retrieval2027-01-142027-07-18
AA*97.8AAAIAAAI Conference on Artificial Intelligence2026-07-212027-02-16
AA*94.8CVPRIEEE Conference on Computer Vision and Pattern Recognition2026-11-102027-06-20
BA*89.8ICRAInternational Conference on Robotics and Automation2026-09-152027-05-24
BA*97.6IJCAIInternational Joint Conference on Artificial Intelligence2027-01-042027-08-07
AA*93.0STOCACM Symposium on Theory of Computing2026-11-022027-06-06
C87.6ICCInternational Conference on Communications2026-10-022027-05-30
CB63.0IJCNNInternational Joint Conference on Neural Networks2027-01-312027-06-14

Comments 0

No comments yet.

Please Login to post a comment