English
Related papers

Related papers: Toward a salmon conjecture

200 papers

In this paper, we consider a family of closed planar algebraic curves $\mathcal{C}$ which are given in parametrization form via a trigonometric polynomial $p$. When $\mathcal{C}$ is the boundary of a compact convex set, the polynomial $p$…

Algebraic Geometry · Mathematics 2013-12-17 Magali Bardet , Térence Bayen

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

Symbolic Computation · Computer Science 2018-06-22 Cordian Riener , Mohab Safey El Din

We present a new generalization of the classical trisecant lemma. Our approach is quite different from previous generalizations. Let $X$ be an equidimensional projective variety of dimension $d$. For a given $k \leq d + 1$, we are…

Algebraic Geometry · Mathematics 2020-01-14 Yirmeyahu J. Kaminski , Alexei Kanel-Belov , Mina Teicher

An exact expression for the determinant of the splitting matrix is derived: it allows us to analyze the asympotic behaviour needed to amend the large angles theorem proposed in Ann. Inst. H. Poincar\'e, B-60, 1, 1994. The asymptotic…

chao-dyn · Physics 2009-10-30 G. Gallavotti , G. Gentile , V. Mastropietro

While the P vs NP problem is mainly approached form the point of view of discrete mathematics, this paper proposes reformulations into the field of abstract algebra, geometry, fourier analysis and of continuous global optimization - which…

Computational Complexity · Computer Science 2022-10-25 Jarek Duda

We estimate the number of possible types degree patterns of $k$-lacunary polynomials of degree $t < p$ which split completely modulo $p$. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with…

Number Theory · Mathematics 2011-11-18 Khodakhast Bibak , Igor E. Shparlinski

Given a polynomial map $\psi:S^m\to \mathbb{R}^k$ with components of degree $d$, we investigate the structure of the semialgebraic set $Z\subseteq S^m$ consisting of those points where $\psi$ and its derivatives satisfy a given list of…

Algebraic Geometry · Mathematics 2021-11-01 Antonio Lerario , Michele Stecconi

Given a sufficiently positive embedding $X\subset\mathbb{P}^N$ of a smooth projective variety $X$, we consider its secant variety $\Sigma$ that comes equipped with the embedding $\Sigma\subset\mathbb{P}^N$ by its construction. In this…

Algebraic Geometry · Mathematics 2024-07-24 Sebastian Olano , Debaditya Raychaudhury

For each sequence of polynomials, P=(p_1(t),p_2(t),...), we define a characteristic series of groups, called the derived series localized at P. Given a knot K in S^3, such a sequence of polynomials arises naturally as the orders of certain…

Geometric Topology · Mathematics 2011-10-18 Tim D. Cochran , Shelly Harvey , Constance Leidy

Let $X \subset \mathbb{C}^n$ be an algebraic variety, and let $\Lambda \subset \mathbb{C}^n$ be a discrete subgroup whose real and complex spans agree. We describe the topological closure of the image of $X$ in $\mathbb{C}^n / \Lambda$,…

Algebraic Geometry · Mathematics 2022-09-23 Spencer Dembner , Hunter Spink

This paper solves a long standing open problem of whether NP-complete problems could be solved in polynomial time on a deterministic Turing machine by showing that the indistinguishable binomial decision tree can be formed in a 3-SAT…

Computational Complexity · Computer Science 2018-01-31 Keum-Bae Cho

We prove a determinantal formula for quantities related to the problem of enumeration of (semi-) meanders, namely the topologically inequivalent planar configurations of non-self-intersecting loops crossing a given (half-) line through a…

High Energy Physics - Theory · Physics 2008-02-03 P. Di Francesco

We study the secant variety of the spinor variety, focusing on its equations of degree three and four. We show that in type $D_n$, cubic equations exist if and only if $n\ge 9$. In general the ideal has generators in degrees at least three…

Algebraic Geometry · Mathematics 2009-07-24 Laurent Manivel

We adapt algorithms for resolving the singularities of complex algebraic varieties to prove that the natural map of homology theories from complex bordism to the bordism theory of complex derived orbifolds splits. In equivariant stable…

Algebraic Topology · Mathematics 2025-04-25 Mohammed Abouzaid , Shaoyun Bai

We consider semiclassical orthogonal polynomials on the unit circle associated with a weight function that satisfy a Pearson-type differential equation involving two polynomials of degree at most three. Structure relations and difference…

Classical Analysis and ODEs · Mathematics 2025-06-05 Cleonice F. Bracciali , Karina S. Rampazzi , Luana L. Silva Ribeiro

Let $K=\mathbb{Q}(\omega)$ with $\omega$ the root of a degree $n$ monic irreducible polynomial $f\in\mathbb{Z}[X]$. We show the degree $n$ polynomial $N(\sum_{i=1}^{n-k}x_i\omega^{i-1})$ in $n-k$ variables formed by setting the final $k$…

Number Theory · Mathematics 2019-10-30 James Maynard

Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…

Logic in Computer Science · Computer Science 2025-03-12 Vitor Greati , Sérgio Marcelino , João Marcos , Umberto Rivieccio

In this paper we address the following question arising from the work of P. Etingof, D. Kazhdan and A. Polishchuk (math.AG/0003009): given a homogeneous complex polynomial, when the rational map defined by its partials is of degree 1? We…

Algebraic Geometry · Mathematics 2007-05-23 Igor V. Dolgachev

Let $K$ be a global field and let $Z$ be a geometrically irreducible algebraic variety defined over $K$. We show that if a big set $S\subseteq Z$ of rational points of bounded height occupies few residue classes modulo $\mathfrak{p}$ for…

Number Theory · Mathematics 2021-11-16 Juan Manuel Menconi , Marcelo Paredes , Román Sasyk

The field of fine-grained complexity aims at proving conditional lower bounds on the time complexity of computational problems. One of the most popular assumptions, Strong Exponential Time Hypothesis (SETH), implies that SAT cannot be…

Computational Complexity · Computer Science 2023-07-24 Tatiana Belova , Alexander S. Kulikov , Ivan Mihajlin , Olga Ratseeva , Grigory Reznikov , Denil Sharipov