Related papers: On Gr\"obner Basis for certain one-point AG codes
In this paper we state and explain techniques useful for the computation of strong Gr\"obner and standard bases over Euclidean domains: First we investigate several strategies for creating the pair set using an idea by Lichtblau. Then we…
We prove a spectral theorem for bimodules in the context of graph C*-algebras. A bimodule over a suitable abelian algebra is determined by its spectrum (i.e., its groupoid partial order) iff it is generated by the Cuntz-Krieger partial…
In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…
In this manuscript, we consider decoding Grassmann codes, linear codes associated to Grassmannian of planes in an affine space. We look at the orbit structure of Grassmannian arising from the natural action of multiplicative group of…
In this paper we construct a generalization of the classical Steinberg section for the quotient map of a semisimple group with respect to the conjugation action. We then give various applications of our construction including the…
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…
The subgroup pattern of a finite groups $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we present an algorithm for the computation of the subgroup…
A set of Maple V R.3/4 computer algebra routines for the analytical solving of 1st. order ODEs, using Lie group symmetry methods, is presented. The set of commands includes a 1st. order ODE-solver and routines for, among other things: the…
We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for this problem, which may produce drawings with exponential…
We start with a given modular invariant M of a two dimensional su(n)_k conformal field theory (CFT) and present a general method for solving the Ocneanu modular splitting equation and then determine, in a step-by-step explicit construction,…
This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been around for some years, but it does it in a systematic way…
Given a planar curve defined by means of a real rational parametrization, we prove that the affine values of the parameter generating the real singularities of the offset are real roots of a univariate polynomial that can be derived from…
In this paper we show how to construct a certain class of orthonormal bases in $L^2({\bf R}^d)$ starting from one or more Gabor orthonormal bases in $L^2({\bf R})$. Each such basis can be obtained acting on a single function…
A method of constructing algebraic-geometric codes with many automorphisms arising from Galois points for algebraic curves is presented.
Let $G$ be an $n$-vertex connected graph. A cyclic base ordering of $G$ is a cyclic ordering of all edges such that every cyclically consecutive $n-1$ edges induce a spanning tree of $G$. In this project, we study cyclic base ordering of…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
Let $\mathcal{C}$ be a decomposable plane curve over an algebraically closed field $k$ of characteristic 0. That is, $\mathcal{C}$ is defined in $k^2$ by an equation of the form $g(x) = f(y)$, where $g$ and $f$ are polynomials of degree at…
We develop an algebraic approach to the branching of representations of the general linear Lie superalgebra $\mathfrak{gl}_{p|q}({\mathbb C})$, by constructing certain super commutative algebras whose structure encodes the branching rules.…