Skip to main content

All Questions

3 votes
0 answers
68 views

Practical way of computing bitangent lines of a quartic (using computers)

Are there known practical algorithms or methods to calculate the bitangent lines of a quartic defined by $f(u,v,t)=0$ in terms of the 15 coefficients? Theoretically you can set up $f(u,v,-au-bv)=(k_0u^...
fp1's user avatar
  • 101
2 votes
1 answer
259 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
2 votes
0 answers
112 views

Understanding normalization algorithms

Let $R$ be a commutative and reduced ring, finitely presented over $\mathbb Z$. Let $\overline R$ be the integral closure of $R$ in its total ring of fractions. In https://arxiv.org/abs/alg-geom/...
Thibault Poiret's user avatar
3 votes
2 answers
226 views

Writing a smooth plane quartic as the vanishing of $Q_0Q_2 - Q_1^2$ for quadratic $Q_0,Q_1,Q_2$

It seems well-known that any smooth plane quartic can be written as the vanishing of $Q_0Q_2 -Q_1^2$. Is there a good way to work out these quadratic factors $Q_0,Q_1,Q_2$? For example, given the ...
TCiur's user avatar
  • 557
3 votes
1 answer
244 views

Resultants and elimination theory

Consider an ideal $I = \langle f_1,\dotsc,f_n\rangle$ in the ring $k[x_1,\dotsc,x_m]$. Define the $i$-th elimination ideal to be $I_i = I \cap k[x_{i+1},\dotsc,x_m]$. For any two polynomials $f$ and $...
giulio bullsaver's user avatar
-2 votes
1 answer
240 views

Are there any non-elementary functions that are computable?

Does a function $\mathit{f}:\mathbb{R}→\mathbb{R}$ being non-elementary (not expressible as a combination of finitely many elementary operations), imply that it is not computable? The particular case ...
mishmish's user avatar
11 votes
2 answers
773 views

A quadratic $O(N)$ invariant equation for 4-index tensors

Consider an $O(N)$ invariant quadratic equation $$ T_{ijkl}= T_{ijmn}T_{klmn}+ T_{ikmn}T_{jlmn}+ T_{ilmn}T_{jkmn}, $$ where $T_{ijkl}$ is a real, totally symmetric 4-tensor, and the indices run from 1 ...
Slava Rychkov's user avatar
0 votes
0 answers
92 views

Boolean operation on n dimensional polyhedron

A polyhedron in $R^n$ is defined by a set of half-planes: $P = \{x \in R^n \mid Ax - b \le 0\}$. Given a set of polyhedra in $R^n$, $ P_1, P_2, \dotsc, P_k$, is there an algorithm/implementation that ...
Robin Lee's user avatar
9 votes
0 answers
288 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
3 votes
0 answers
261 views

Explicit computations of finite covers of genus one curves with two points of ramification

I have an explicit genus one curve $E$ with two points $p_1$ and $p_2$ on it and am looking for an explicit degree seven cover $X\to E$ with ramification precisely over $p_i$, with a single preimage ...
Lev Borisov's user avatar
  • 5,176
1 vote
0 answers
56 views

Are cells of 4-polytopes a convex polyhedron by definition?

I'm going by the Wikipedia definition for a 4-polytope. Do by definition, cells of 4-polytopes have to be a convex polyhedra? If not, then are there polyhedra with non-convex faces? If yes, is it the ...
Ron Michal's user avatar
0 votes
1 answer
169 views

A variation on the projective Nullstellensatz

Let $V$ be a $\mathbb{C}$-vector space, and let $f_1,\dots,f_n \in S^d(V^*)$ be homogeneous polynomials of degree $d$ for which $V(f_1,\dots, f_n)=\{0\}$. Must there exist a positive integer $k\geq d$ ...
Ben's user avatar
  • 970
1 vote
0 answers
181 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
  • 970
11 votes
0 answers
229 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,592
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
  • 970

15 30 50 per page