Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
130 views

How to find a single-variable polynomial in a zero-dimensional ideal?

Given finitely many multivariate polynomials with algebraic coefficients that generate a zero-dimensional ideal, is there an easy way to find a nonzero single-variable polynomial in this ideal? If we ...
Dustin G. Mixon's user avatar
2 votes
0 answers
188 views

Help with Macaulay2 computation of invariant ring

Consider the algebraic group $G:=\operatorname{SL}_{2}\times\operatorname{SL}_{2}$ acting on $V:=\operatorname{Mat}_{2\times 2}\oplus\operatorname{Mat}_{2\times 2}$ via the action $(A,B)\,\cdot\,(X,Y)=...
It'sMe's user avatar
  • 839
1 vote
1 answer
210 views

Primary decomposition of huge ideals using M2/Singular

I used to ask similar questions in other communities, but so far never received any feedback. Given four Hermitian $n\times n$ matrices $A_1,A_2,B_1,B_2$ together with the constraints $[A_i,B_j]=0$, I ...
Timo59's user avatar
  • 71
2 votes
0 answers
113 views

Computing whether a set of polynomials cuts out a projective variety

I have a set of multivariate polynomials over $\mathbb{Q}$, and I want to compute whether they cut out a projective variety, i.e. whether the radical of the ideal $I$ that they generate is homogeneous....
Ben's user avatar
  • 980
5 votes
0 answers
2k views

Saturated ideals in computational algebra

Let $R$ a commutative ring with one and $I, J \triangleleft R$ two ideals. The saturated ideal $I^{sat}_J$ with respect $J$ is the ideal $$(I : J^\infty )= \cup_{n \geq 1} (I:J^n)$$ where $(I:J^n)= \{...
user267839's user avatar
  • 6,028
4 votes
0 answers
104 views

Compute the closure of graph of function from complement of hypersurface in $\mathbb{A}^n$

I'm hoping someone can give me some tips to help speed up computation on the following problem: Suppose I have a map $G=(g_1/f,\dots,g_m/f):\mathbb{A}^n\setminus{V(f)}\to \mathbb{A}^m$. I'm ...
user2520938's user avatar
  • 2,788
4 votes
1 answer
273 views

Resultants for compactly represented product form polynomials?

Typically computing resultnt of $n+1$ different $n+1$-variate homogeneous polynomials takes $O(poly(\prod_{i=1}^{d_{i}}))$ time where $d_i$ is degree of $i$th polynomial. In certain cases the ...
Turbo's user avatar
  • 13.9k
6 votes
1 answer
269 views

Algebraization of Bayesian networks?

The algebraization of classical propositional logic is Boolean algebra. Bayesian networks are a generalization of classical propositional logic with probability truth-values. What is the ...
YKY's user avatar
  • 558
1 vote
0 answers
280 views

Algebraic independence criterion

Is there any criterion for checking algebraic independence of a set of polynomials in $n$ variables in terms of the leading monomials with respect to some monomial order ? The Jacobian criterion is ...
Jack's user avatar
  • 11
6 votes
0 answers
293 views

Constructing the normal sheaf for the plucker embedding in MAGMA (or a similar programming language)

How would one construct the normal sheaf $N_{G(2,6)/\mathbb P^{14}}$ to the plucker embedding of the grassmannian $G(2,6) \rightarrow \mathbb P^{14}$ as a sheaf in MAGMA (or another programming ...
Aaron Landesman's user avatar
16 votes
2 answers
721 views

From polynomial ideal over $\mathbb{Q}$ to polynomial ideal over $\mathbb{Z}$

Is there an algorithm to compute, given a polynomial ideal $I\subset \mathbb{Q}[x_1,\dotsc,x_n]$, the ideal $I\cap \mathbb{Z}[x_1,\dotsc,x_n]$ in $\mathbb{Z}[x_1,\dotsc,x_n]$? The input and output ...
Boris Bukh's user avatar
  • 7,836
28 votes
1 answer
1k views

Algebraic dependency over $\mathbb{F}_{2}$

Let $f_{1},f_{2},\ldots,f_{n}$ be $n$ polynomials in $\mathbb{F}_{2}[x_{1},x_{2},\ldots,x_{n}]$ such that $\forall a=(a_1,a_2,\ldots,a_n)\in\mathbb{F}_{2}^{n}$ we have $\forall i\in[n]:f_{i}(a)=a_{i}$....
Gorav Jindal's user avatar
4 votes
0 answers
312 views

Dimension of a commuting nilpotent variety

Fix $k$ an algebraically closed field, $n$ a natural number, and $\lambda=(\lambda_1,\ldots,\lambda_m)$ a partition of $n$. Let $A$ be any $n\times n$ nilpotent matrix with entries in $k$ whose ...
Jared's user avatar
  • 768
1 vote
1 answer
470 views

Serre's conditions under blow-ups, Blowup and normalization

Suppose $X = \mathbb{Z}[x, y, z]/(f,g)$ is a 2-dimensional Cohen-Macaulay surface. In particular, $X$ satisfies Serre's condition $S_2$. Suppose it is irreducible, reduced but not normal. $\bf{...
LMN's user avatar
  • 3,555
4 votes
2 answers
1k views

Algorithm to decide if ideal is principal

Suppose $R = \mathbb{Q}[x_1, ..., x_n]/I$, and $J \subset R$ is a given height one ideal. Is there a quick algorithm one could write to determine if $J$ is a principal ideal or necessarily not ...
LMN's user avatar
  • 3,555
2 votes
0 answers
179 views

Randomized alternative to Buchberger's algorithm

Richard Lipton's blog describes a A New Way To Solve Linear Equations by Prasad Raghavendra. Can the ideas in this algorithm be generalized to systems of polynomial equations to provide a randomized ...
user19172's user avatar
  • 529
6 votes
1 answer
530 views

Does a variety contain a cartesian product of two curves?

We are given an affine variety $V\subset \mathbb{A}^n\times\mathbb{A}^n$, and wish to know if it contains a product of the form $C_1\times C_2$, where $C_1$ and $C_2$ are two curves in $\mathbb{A}^n$. ...
Boris Bukh's user avatar
  • 7,836
5 votes
1 answer
499 views

software for computations on flag varieties in arbitrary characteristic

Is there any software that will compute cohomology of vector bundles (or just line bundles) on flag manifolds? The only one I know of is Macaulay2, via the Schubert2 package, but it works with what ...
Graham Leuschke's user avatar
6 votes
3 answers
1k views

Is there a software package that does Schubert Calculus computations?

Is there a good software package for doing computations in the cohomology ring of Grassmannians? Things like, I can write down a polynomial in, in fact, special Schubert classes, but it's one where ...
Charles Siegel's user avatar