Related papers: A general framework for applying FGLM techniques t…
In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…
We present GDLNN, a new graph machine learning architecture, for graph classification tasks. GDLNN combines a domain-specific programming language, called GDL, with neural networks. The main strength of GDLNN lies in its GDL layer, which…
A machine-learnable variational scheme using Gaussian radial basis functions (GRBFs) is presented and used to approximate linear problems on bounded and unbounded domains. In contrast to standard mesh-free methods, which use GRBFs to…
A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…
Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…
The Gr\"obner basis technique for calculating Feynman diagrams proposed in [O.V. Tarasov, Acta Physica Polonica, v. B29 (1998) 2655] is applied to the two-loop propagator type integrals with arbitrary masses and momentum. We describe the…
Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…
This paper considers generalized linear models using rule-based features, also referred to as rule ensembles, for regression and probabilistic classification. Rules facilitate model interpretation while also capturing nonlinear dependences…
We develop a Gr\"obner basis theory for a class of algebras that generalizes both PBW-algebras and rings of differential algebras on smooth varieties. Emphasis lies on methods to compute filtrations and graded structures defined by weight…
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…
Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…
These notes originate from a reading course held by the authors in the spring of 2024 at the Universit\`a di Genova. They provide a hands-on introduction to the F4 and FGLM algorithms. In addition to the notes, we present two…
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…
Sparse matrix computations are ubiquitous in scientific computing. With the recent interest in scientific machine learning, it is natural to ask how sparse matrix computations can leverage neural networks (NN). Unfortunately, multi-layer…
In this paper, linear bases for the partially commutative Lie algebras are found. The method of the Gr\"{o}bner--Shirshov bases is used. It easily follows from the structure that the equality problem is algorithmically solvable for the…
Gr\"obner Bases and Cylindrical Algebraic Decomposition are generally thought of as two, rather different, methods of looking at systems of equations and, in the case of Cylindrical Algebraic Decomposition, inequalities. However, even for a…
Learning to optimize is a rapidly growing area that aims to solve optimization problems or improve existing optimization algorithms using machine learning (ML). In particular, the graph neural network (GNN) is considered a suitable ML model…
Unit derived schemes applied to Hadamard matrices are used to construct and analyse linear block and convolutional codes. Codes are constructed to prescribed types, lengths and rates and multiple series of self-dual, dual-containing, linear…
Hulls of linear codes have been of interest and extensively studied due to their rich algebraic structures and wide applications. In this paper, alternative characterizations of hulls of linear codes are given as well as their applications.…
We consider two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We argue that the task of program learning should be more tractable for these architectures…