English
Related papers

Related papers: On the Blaschke conjecture for 3-webs

200 papers

We use the Brill-Noether theory to prove the Green conjecture for exceptional curves on K3 surfaces. Such curves count among the few ones having Clifford dimension at least three. We obtain our result by adopting an infinitesimal approach…

Algebraic Geometry · Mathematics 2013-11-19 Marian Aprodu , Gianluca Pacienza

To each three-component link in the 3-sphere, we associate a geometrically natural characteristic map from the 3-torus to the 2-sphere, and show that the pairwise linking numbers and Milnor triple linking number that classify the link up to…

Geometric Topology · Mathematics 2016-11-23 Dennis DeTurck , Herman Gluck , Rafal Komendarczyk , Paul Melvin , Clayton Shonkwiler , David Shea Vela-Vick

We prove the joints conjecture, showing that for any $N$ lines in ${\Bbb R}^3$, there are at most $O(N^{{3 \over 2}})$ points at which 3 lines intersect non-coplanarly. We also prove a conjecture of Bourgain showing that given $N^2$ lines…

Combinatorics · Mathematics 2008-12-08 Larry Guth , Nets Hawk Katz

Optimal linear-time algorithms for testing the planarity of a graph are well-known for over 35 years. However, these algorithms are quite involved and recent publications still try to give simpler linear-time tests. We give a simple…

Data Structures and Algorithms · Computer Science 2012-02-23 Jens M. Schmidt

We have conjectured that the constraint equations defined by a generic Laman graph are not soluble by radicals when the graph is 3-connected. We prove that this conjecture follows from the following simpler conjecture: the constraint…

Combinatorics · Mathematics 2007-05-23 John C. Owen , Stephen C. Power

We show how the techniques of Voevodsky's proof of the Milnor conjecture and the Voevodsky- Rost proof of its generalization the Bloch-Kato conjecture can be used to study counterexamples to the classical L\"uroth problem. By generalizing a…

Algebraic Geometry · Mathematics 2019-02-20 Aravind Asok

We definitively solve the old problem of finding a minimal integrity basis of polynomial invariants of the fourth-order elasticity tensor C. Decomposing C into its SO(3)-irreducible components we reduce this problem to finding joint…

Mathematical Physics · Physics 2019-01-01 Nicolas Auffray , Marc Olive , Boris Kolev

Nous donnons un procede explicite de determination du rang d'un d-tissu non singulier du plan quelconque a l'aide de sa connexion associee. Une etude de quelques invariants du tissu est egalement proposee. We give an explicit process of…

Algebraic Geometry · Mathematics 2007-05-23 Olivier Ripoll

A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…

Computational Complexity · Computer Science 2025-10-07 Erin Chambers , Tim Ophelders , Anna Schenfisch , Julia Sollberger

In this work, we study the interlace polynomial as a generalization of a graph invariant to delta-matroids. We prove that the interlace polynomial satisfies the four-term relation for delta-matroids and determines thus a finite type…

Combinatorics · Mathematics 2020-03-02 Nadezhda Kodaneva

In one of their seminal articles on allowable sequences, Goodman and Pollack gave combinatorial generalizations for three problems in discrete geometry, one of which being the Dirac conjecture. According to this conjecture, any set of $n$…

Combinatorics · Mathematics 2022-08-30 Adrian Dumitrescu

In a previous article, we reduced the unsolved problem of the convergence of Collatz sequences, to convergence of Collatz sequences of odd numbers, that are divisible by 3. In this article, we further reduce this set to odd numbers that are…

Combinatorics · Mathematics 2020-01-07 Maya Mohsin Ahmed

We determine the three fundamental invariants in the entries of a $3 \times 3 \times 3$ array over $\mathbb{C}$ as explicit polynomials in the 27 variables $x_{ijk}$ for $1 \le i, j, k \le 3$. By the work of Vinberg on $\theta$-groups, it…

Commutative Algebra · Mathematics 2015-03-19 Murray R. Bremner , Jiaxiong Hu

We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels that are structurally simple, gauged by certain types of…

Logic in Computer Science · Computer Science 2025-04-30 Thomas Feller , Tim S. Lyon , Piotr Ostropolski-Nalewaja , Sebastian Rudolph

We prove that for every Aronzsajn line A and every Countryman line C, there is a proper forcing extension in which A contains an isomorphic copy of either C or its converse C*. As a corollary, we obtain answers to several related questions…

Logic · Mathematics 2025-10-23 John Krueger , Justin Tatch Moore

We extend the $sl(3)$-polynomial invariant for links to tangles. Motivated by Kuperberg's construction of this invariant via planar trivalent graphs, we first define a category of $sl(3)$ webs and its sister linear category, and describe…

Geometric Topology · Mathematics 2025-08-28 Nipun Amarasinghe

Given a knot K we introduce a new invariant coming from the Blanchfield pairing and we show that it gives a lower bound on the unknotting number of K. This lower bound subsumes the lower bounds given by the Levine-Tristram signatures, by…

Geometric Topology · Mathematics 2015-05-27 Maciej Borodzik , Stefan Friedl

We compare two natural bases for the invariant space of a tensor product of irreducible representations of A_2, or sl(3). One basis is the web basis, defined from a skein theory called the combinatorial A_2 spider. The other basis is the…

q-alg · Mathematics 2007-05-23 Mikhail Khovanov , Greg Kuperberg

We consider the algebra of invariants of binary forms of degree 9 with complex coefficients, find the 92 basic invariants, give an explicit system of parameters and show the existence of four more systems of parameters with different sets…

Representation Theory · Mathematics 2010-02-04 Andries E. Brouwer , Mihaela Popoviciu

We give a construction that provides infinitely many 2-connected, cubic, bipartite, and planar graphs G with 3k vertices and such that the number of disjoint copies of a 3-vertex path in G is less than k.

Combinatorics · Mathematics 2007-12-28 Alexander Kelmans
‹ Prev 1 8 9 10 Next ›