Related papers: A general framework for applying FGLM techniques t…
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…
For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…
In this work we present a way to construct the so-called root diagram for one-point AG codes $C$ arising from certain types of curves $\mathcal{X}$ over $\mathbb{F}_q$ with plane model $f(y)=g(x)$. Using this root diagram we can get an…
Large Language Models (LLMs) trained on petabytes of data are highly compressed repositories of a significant proportion of the knowledge accumulated and distilled so far. In this paper we study techniques to elicit this knowledge in the…
We introduce a new computational framework for estimating parameters in generalized generalized linear models (GGLM), a class of models that extends the popular generalized linear models (GLM) to account for dependencies among observations…
We present a generic programming framework for OCAML which makes it possible to implement extensible transformations for a large scale of type definitions. Our framework makes use of objectoriented features of OCAML, utilising late binding…
We study algebraic geometry linear codes defined by linear sections of the Grassmannian variety as codes associated to FFN$(1,q)$-projective varieties. As a consequence, we show that Schubert, Lagrangian-Grassmannian, and isotropic…
Generalized linear models (GLMs) have been used quite effectively in the modeling of a mean response under nonstandard conditions, where discrete as well as continuous data distributions can be accommodated. The choice of design for a GLM…
This paper presents an algorithm for computing Groebner bases based upon labeled polynomials and ideas from the algorithm F5. The main highlights of this algorithm compared with analogues are simplicity both of the algorithm and of the its…
In this expository style of writing I will give an introduction of Gr\"{o}bner bases and compute it for some algebras and then show how to use it to compute Hilbert series for algebras from chains.
A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for…
We present a formalization of Gr\"obner basis theory in Lean 4, built on top of Mathlib's infrastructure for multivariate polynomials and monomial orders. Our development covers the core foundations of Gr\"obner basis theory, including…
We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…
Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and also in the design of experiments, coding theory, partition…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
We assess how the code reasoning abilities of large language models (LLMs) generalize to different kinds of programs. We present techniques for obtaining in- and out-of-distribution programs with different characteristics: code sampled from…
We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…
Algebraic-geometric codes can be constructed by evaluating a certain set of functions on a set of distinct rational points of an algebraic curve. The set of functions that are evaluated is the linear space of a given divisor or,…
Linear codes are widely employed in communication systems, consumer electronics, and storage devices. All linear codes over finite fields can be generated by a generator matrix. Due to this, the generator matrix approach is called a…
We describe a version of the FGLM algorithm that can be used to compute generic fibers of positive-dimensional polynomial ideals. It combines the FGLM algorithm with a Hensel lifting strategy. In analogy with Hensel lifting, we show that…