scholarly journals Computing Minimal Generating Sets of Invariant Rings of Permutation Groups with SAGBI-Gröbner Basis

2001 ◽  
Vol DMTCS Proceedings vol. AA,... (Proceedings) ◽  
Author(s):  
Nicolas Thiéry
Keyword(s):  
Gröbner Basis ◽  
The Other ◽  
Permutation Groups ◽  
Grobner Basis ◽  
Generating Sets ◽  
Invariant Rings ◽  
Invariant Ring ◽  
International Audience ◽  
System Of Parameters ◽  
Special Case

International audience We present a characteristic-free algorithm for computing minimal generating sets of invariant rings of permutation groups. We circumvent the main weaknesses of the usual approaches (using classical Gröbner basis inside the full polynomial ring, or pure linear algebra inside the invariant ring) by relying on the theory of SAGBI- Gröbner basis. This theory takes, in this special case, a strongly combinatorial flavor, which makes it particularly effective. Our algorithm does not require the computation of a Hironaka decomposition, nor even the computation of a system of parameters, and could be parallelized. Our implementation, as part of the library $permuvar$ for $mupad$, is in many cases much more efficient than the other existing software.

scholarly journals COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES

2010 ◽  
Vol 09 (02) ◽  
pp. 241-256 ◽  
Author(s):  
ELEONORA GUERRINI ◽  
EMMANUELA ORSINI ◽  
MASSIMILIANO SALA
Keyword(s):  
Weight Distribution ◽  
Gröbner Basis ◽  
Black Box ◽  
Distance Distribution ◽  
The Other ◽  
Brute Force ◽  
Grobner Basis ◽  
Other Hand ◽  
Closest Pair ◽  
Nonlinear Codes

The most important families of nonlinear codes are systematic. A brute-force check is the only known method to compute their weight distribution and distance distribution. On the other hand, it outputs also all closest word pairs in the code. In the black-box complexity model, the check is optimal among closest-pair algorithms. In this paper, we provide a Gröbner basis technique to compute the weight/distance distribution of any systematic nonlinear code. Also our technique outputs all closest pairs. Unlike the check, our method can be extended to work on code families.

scholarly journals PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES

2002 ◽  
Vol 12 (06) ◽  
pp. 849-865 ◽  
Author(s):  
EDGAR MARTÍNEZ-MORO
Keyword(s):  
Design Of Experiments ◽  
Coding Theory ◽  
Gröbner Basis ◽  
Association Schemes ◽  
Permutation Groups ◽  
Grobner Basis ◽  
Combinatorial Objects ◽  
Buchberger Algorithm ◽  
Minimal Generators

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 designs etc. In this paper we show some techniques for computing properties of association schemes. The main framework arises from the fact that we can characterize completely the Bose–Mesner algebra in terms of a zero-dimensional ideal. A Gröbner basis of this ideal can be easily derived without the use of Buchberger algorithm in an efficient way. From this statement, some nice relations arise between the treatment of zero-dimensional ideals by reordering techniques (FGLM techniques) and some properties of the schemes such as P-polynomiality, and minimal generators of the algebra.

scholarly journals Divisors on graphs, Connected flags, and Syzygies

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Fatemeh Mohammadi ◽  
Farbod Shokrieh
Keyword(s):  
Gröbner Basis ◽  
Betti Numbers ◽  
Point Of View ◽  
Grobner Basis ◽  
Generating Set ◽  
Term Order ◽  
Syzygy Module ◽  
International Audience ◽  
The Given ◽  
Minimal Generating Set

International audience We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gröbner theory. We give an explicit description of a minimal Gröbner basis for each higher syzygy module. In each case the given minimal Gröbner basis is also a minimal generating set. The Betti numbers of $I_G$ and its initial ideal (with respect to a natural term order) coincide and they correspond to the number of ``connected flags'' in $G$. Moreover, the Betti numbers are independent of the characteristic of the base field.

scholarly journals The Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order

1999 ◽  
Vol Vol. 3 no. 2 ◽  
Author(s):  
Manfred Göbel
Keyword(s):  
Lower Bound ◽  
Total Degree ◽  
Invariant Rings ◽  
Invariant Ring ◽  
International Audience ◽  
Optimal Lower Bound

International audience We prove the existence of an invariant ring \textbfC[X_1,...,X_n]^T generated by elements with a total degree of at most 2, which has no finite SAGBI basis with respect to any admissible order. Therefore, 2 is the optimal lower bound for the total degree of generators of invariant rings with such a property.

scholarly journals On the first fall degree of summation polynomials

2019 ◽  
Vol 13 (3-4) ◽  
pp. 229-237
Author(s):  
Stavros Kousidis ◽  
Andreas Wiemers
Keyword(s):  
Elliptic Curve ◽  
Gröbner Basis ◽  
Discrete Logarithm ◽  
Polynomial Systems ◽  
Discrete Logarithm Problem ◽  
Grobner Basis ◽  
Weil Descent ◽  
Degree Bound

Abstract We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.

scholarly journals The game of Double-Silver on intervals

2001 ◽  
Vol 26 (8) ◽  
pp. 485-496 ◽  
Author(s):  
Gerald A. Heuer
Keyword(s):  
Measure Zero ◽  
Optimal Strategies ◽  
The Other ◽  
Parameter Plane ◽  
Left Endpoint ◽  
Relative Placement ◽  
Special Case

Silverman's game on intervals was analyzed in a special case by Evans, and later more extensively by Heuer and Leopold-Wildburger, who found that optimal strategies exist (and gave them) quite generally when the intervals have no endpoints in common. They exist in about half the parameter plane when the intervals have a left endpoint or a right endpoint, but not both, in common, and (as Evans had earlier found) exist only on a set of measure zero in this plane if the intervals are identical. The game of Double-Silver, where each player has its own threshold and penalty, is examined. There are several combinations of conditions on relative placement of the intervals, the thresholds and penalties under which optimal strategies exist and are found. The indications are that in the other cases no optimal strategies exist.

Sign in / Sign up

Export Citation Format

Share Document