Related papers: On the Guy-Kelly Conjecture for the No-Three-In-Li…
We give a counterexample to a trilinear version of the operator space Grothendieck theorem. In particular, we show that for trilinear forms on $\ell_\infty$, the ratio of the symmetrized completely bounded norm and the jointly completely…
We collect some results in combinatorial geometry that follow from an inequality of Langer in algebraic geometry. Langer's inequality gives a lower bound on the number of incidences between a point set and its spanned lines, and was…
The classical Gagliardo-Nirenberg inequality was established in $\mathbb{R}^n$. An extension to a bounded domain was given by Gagliardo in 1959. In this note, we present a simple proof of this result and prove a new Gagliardo-Nirenberg…
This article contains work associated with a resolution of the Riemann hypothesis, following work by Taylor \cite{prt}, Lagarias and Suzuki \cite{lagandsuz} and Ki \cite{ki}, as well as Pustyl'nikov \cite{pust, pust2} and Keiper…
Superluminal communications have been proposed to solve the Einstein, Podolsky and Rosen (EPR) paradox. So far, no evidence for these superluminal communications has been obtained and only lower bounds for the superluminal velocities have…
In an influential 2008 paper, Baker proposed a number of conjectures relating the divisor theory of algebraic curves with an analogous combinatorial theory on finite graphs. In this note, we examine Baker's Brill--Noether existence…
A celebrated unit distance conjecture due to Erd\H os says that that the unit distances cannot arise more than $C_{\epsilon}n^{1+\epsilon}$ times (for any $\epsilon>0$) among $n$ points in the Euclidean plane (see e.g. \cite{SST84} and the…
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…
A well known theorem of Kuratowski in 1932 states that a graph is planar if, and only if, it does not contain a subdivision of $K_5$ or $K_{3,3}$. Wagner proved in 1937 that if a graph other than $K_5$ does not contain any subdivision of…
A logical approach to Bell's Inequalities of quantum mechanics has been introduced by Abramsky and Hardy [2]. We point out that the logical Bell's Inequalities of [2] are provable in the probability logic of Fagin, Halpern and Megiddo [4].…
Lovasz and Plummer conjectured in the 1970's that cubic bridgeless graphs have exponentially many perfect matchings. This conjecture has been verified for bipartite graphs by Voorhoeve in 1979, and for planar graphs by Chudnovsky and…
We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability $1/2$. The lower bound is more of theoretical than practical importance; it improves very marginally the expurgated bound,…
For a non-CM elliptic curve $E$ defined over the rationals, Lang and Trotter made very deep conjectures concerning the number of primes $p\leq x$ for which $a_p(E)$ is a fixed integer (and for which the Frobenius field at $p$ is a fixed…
We demonstrate theory and computations for finite-energy line defect solutions in an improvement of Ericksen-Leslie liquid crystal theory. Planar director fields are considered in two and three space dimensions, and we demonstrate straight…
It is a well-known conjecture, sometimes attributed to Frankl, that for any family of sets which is closed under the union operation, there is some element which is contained in at least half of the sets. Gilmer was the first to prove a…
The ternary Goldbach conjecture states that every odd number n>=7 is the sum of three primes. The estimation of sums of the form \sum_{p\leq x} e(\alpha p), \alpha = a/q + O(1/q^2), has been a central part of the main approach to the…
We give an exact criterion of a conjecture of L.M.Kelly to hold true which is stated as follows. If there is a finite family $\Sigma$ of mutually skew lines in $\mathbb{R}^l,l\geq 4$ such that the three dimensional affine span (hull) of…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…
This paper presents a possible link between Cages and Expander Graphs by introducing three interconnected variants of the Bermond and Bollob\'as Conjecture, originally formulated in 1981 within the context of the Degree/Diameter Problem. We…
Let $X$ be a curve of genus $g\geq 2$ over a number field $F$ of degree $d = [F:Q]$. The conjectural existence of a uniform bound $N(g,d)$ on the number $\#X(F)$ of $F$-rational points of $X$ is an outstanding open problem in arithmetic…