Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
37 views

Computing all roots of a function with square-root terms

Given $3n$ positive numbers $a_1, \ldots, a_n$, $b_1, \ldots, b_n$, and $x_1, \ldots, x_n$, we are given a function $$f(x) = \sum_{i = 1}^n \frac{a_i}{\sqrt{(x - x_i)^2 + b_i}}.$$ Can we find all the ...
Abheek Ghosh's user avatar
2 votes
1 answer
271 views

Irreducibility of an explicit complex projective variety

Let $Y\subset \mathbb P^n_\mathbb C$ be a subvariety defined by a series of homogeneous polynomials $f_1, \ldots, f_t$. Is there an effective way to determine the irreducibility of $Y$ as an algebraic ...
Pène Papin's user avatar
14 votes
2 answers
636 views

Tarski-Seidenberg for strict inequalities and bounded quantification

This theorem says that quantifiers over real variables can be eliminated from classical first order formulae built from equations and inequalities between polynomials with rational coefficients, ie in ...
Paul Taylor's user avatar
  • 8,481
9 votes
0 answers
290 views

Computer algebra tools for finding real dimension of an algebraic variety

I have a system of polynomial equations with the unknowns being real numbers. The set of solutions is infinite. What software can I use to compute the real dimension of the solution set? The CAD-based ...
bcp's user avatar
  • 175
1 vote
0 answers
183 views

Using Bertini software to determine whether or not a variety is empty

I have a system of polynomials $f_1,\dots, f_n \in \mathbb{C}[x_1,\dots, x_m]$, and I would like to determine whether the set of solutions to the system $f_1(x)=\dots=f_n(x)=0$ is empty or not. Since ...
Ben's user avatar
  • 980
11 votes
0 answers
234 views

When is cohomology of a finitely presented dg-algebra computable?

Given a smooth affine variety $X$ defined over $\mathbb{Q}$, its singular cohomology is isomorphic to the algebraic de Rham cohomology, which is the cohomology of the complex $\Omega_X^0\to\Omega_X^1\...
Anton Mellit's user avatar
  • 3,772
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
-1 votes
1 answer
120 views

IntersectInP bug of Macaulay2 [closed]

I am trying to use the intersectInP command in Macaulay2, inside package ReesAlgebra. However, I tried to follow the exact code in the user-guide, but it doesn't run in my Ubuntu app (of win 10). Can ...
Winnie_XP's user avatar
  • 287
1 vote
0 answers
71 views

Is there a workable numerical method for determining the center of a circle through three points? [closed]

I'm a 73-year-old engineer struggling with numerically implementing a math problem. I am working on a kinematic linkage project that generates motion paths (as long sequences of x,y coordinates) of ...
John Erbes's user avatar
2 votes
0 answers
61 views

Efficient algorithm to prove that a polynomial ideal contains 1

I have the following problem: Suppose to have an ideal $I\triangleleft k[x_1,...,x_n]$ defined by generators. There exists an efficient algorithm (perhaps more efficient than calculating the Groebner ...
DDT's user avatar
  • 297
2 votes
2 answers
399 views

Computer algebra for calculating curvature when the tensor metric is very big

Is there a computer algebra method to compute the curvature of a Riemannian metric on the plane when the metric tensor has long entries $E,F,G$ The computation by hand is very ...
Ali Taghavi's user avatar
1 vote
1 answer
146 views

Omitting constraints of polynomial system

Let $n_1, n_2 \geq 1$ be known integer constants. Suppose that we have the following system of $n$ polynomial inequalities for which we know that there exists a feasible solution $(p_1, p_2) \in (0,1)...
vkonton's user avatar
  • 175
26 votes
0 answers
908 views

Where to submit this work with several unusual features?

I appreciate that questions about where to submit are generally considered off-topic, but I hope that the unusual features of the present case may make it acceptable. I have put a monograph on github ...
Neil Strickland's user avatar
7 votes
1 answer
224 views

Computing homology of subvarieties of Euclidean spaces by persistent homology

Let $M$ be a submanifold of the Euclidean space $\mathbb{R}^n$. Let $G$ be a finite group acting on $M$ freely. I want to compute the homology (or even the cohomology ring) of $M/G$. Suppose the ...
Shi Q.'s user avatar
  • 543
1 vote
1 answer
242 views

Finding generators of symmetric cones

I have a bunch of vectors $\mathbf v_i$ in $\mathbb R^n$. I would like to consider the cone $C$ spanned by these vectors, together with all the other vectors that can be obtained by permuting the ...
user avatar
66 votes
3 answers
4k views

Reasons to prefer one large prime over another to approximate characteristic zero

Background: In running algebraic geometry computations using software such as Macaulay2, it is often easier and faster to work over $\mathbb F_p = \mathbb Z / p\mathbb Z$ for a large prime $p$, rather ...
Charles Staats's user avatar
11 votes
3 answers
960 views

Algorithms in Invariant Theory

Let $V$ be a polynomial representation of the general linear group $\Gamma:=\DeclareMathOperator{\Gl}{Gl}\Gl_n(\newcommand{\C}{\mathbb C}\C)$. In chapter 4.6 of his book "Algorithms in Invariant ...
Garfield's user avatar
  • 262