Related papers: Gr\"obner crystal structures
In this paper, the tropical differential Gr\"obner basis is studied, which is a natural generalization of the tropical Gr\"obner basis to the recently introduced tropical differential algebra. Like the differential Gr\"obner basis, the…
Let G be a connected reductive algebraic group. We prove that the string parametrization of a crystal basis for a finite dimensional irreducible representation of G extends to a natural valuation on the field of rational functions on the…
We give algorithms for computing multiplier ideals using Gr\"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial.…
We consider reasoning and minimization in systems of polynomial ordinary differential equations (ode's). The ring of multivariate polynomials is employed as a syntax for denoting system behaviours. We endow this set with a transition system…
In this paper we present a new methodology for solving multiobjective integer linear programs using tools from algebraic geometry. We introduce the concept of partial Gr\"obner basis for a family of multiobjective programs where the…
In this paper we show that determinantal ideals of generic matrices are Knutson ideals. This fact leads to a useful result about Gr\"obner bases of certain sums of determinantal ideals. More specifically, given $I=I_1+\ldots+I_k$ a sum of…
In 1980, White conjectured that the toric ideal of a matroid is generated by quadratic binomials corresponding to a symmetric exchange. In this paper, we compute Gr\"obner bases of toric ideals associated with matroids and show that, for…
Let $X$ be a set of points whose coordinates are known with limited accuracy; our aim is to give a characterization of the vanishing ideal $I(X)$ independent of the data uncertainty. We present a method to compute a polynomial basis $B$ of…
Based on the partition of parameter space, two algorithms for computing the rational univariate representation of zero-dimensional ideals with parameters are presented in the paper. Unlike the rational univariate representation of…
In this paper we develop a Grobner bases theory for ideals of partial difference polynomials with constant or non-constant coefficients. In particular, we introduce a criterion providing the finiteness of such bases when a difference ideal…
An algorithm for determining crystal structures from diffraction data is described which does not rely on the usual Fourier-space formulations of atomicity. The new algorithm implements atomicity constraints in real-space, as well as…
We characterise the class of one-cogenerated Pfaffian ideals whose natural generators form a Gr\"obner basis with respect to any anti-diagonal term-order. We describe their initial ideals as well as the associated simplicial complexes,…
Each integrable lowest weight representation of a symmetrizable Kac-Moody Lie algebra g has a crystal in the sense of Kashiwara, which describes its combinatorial properties. For a given g, there is a limit crystal, usually denoted by…
Using recent work by Erman-Sam-Snowden, we show that finitely generated ideals in the ring of bounded-degree formal power series in infinitely many variables have finitely generated Gr\"obner bases relative to the graded reverse…
Let G be a connected reductive group defined over Q_p. The set of crystals contained in a given G-isocrystal is viewed from a Bruhat-Tits building-theoretic vantage point as a kind of tubular neighborhood of a skeleton characterized by a…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
We give a brief review of some generalized continuum theories applied to the crystals with complicated microscopic structure. Three different ways of generalization of the classical elasticity theory are discussed. One is the high-gradient…
Let B be the crystal basis of the minus part of the quantized enveloping algebra of a semi-simple Lie algebra. Kashiwara has shown that B has a combinatorial description in terms of an embedding of B into the tensor product of B and k…