Related papers: Proof of the zig-zag conjecture
Formal multiple zeta values allow to study multiple zeta values by algebraic methods in a way that the open question about their transcendence is circumvented. In this note we show that Hoffman's basis conjecture for formal multiple zeta…
The Glazman-Povzner-Wienholtz theorem states that the completeness of a manifold, when combined with the semiboundedness of the Schr\"odinger operator $-\Delta + q$ and suitable local regularity assumptions on $q$, guarantees its essential…
In recent work with J.Mostovoy and T.Stanford,the author found that for every natural number n, a certain polynomial in the coefficients of the Conway polynomial is a primitive integer-valued degree n Vassiliev invariant, but that modulo 2,…
We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at least $K^{-\frac{4}{\epsilon}}|A|$…
We extend the the definition of Kumjian-Pask algebras to include algebras associated to finitely aligned higher-rank graphs. We show that these Kumjian-Pask algebras are universally defined and have a graded uniqueness theorem. We also…
Steinitz's theorem states that a graph $G$ is the edge-graph of a $3$-dimensional convex polyhedron if and only if, $G$ is simple, plane and $3$-connected. We prove an analogue of this theorem for ball polyhedra, that is, for intersections…
The non-trivial zeros of the Riemann zeta function and the prime numbers can be plotted by a modified von Mangoldt function. The series of non-trivial zeta zeros and prime numbers can be given explicitly by superposition of harmonic waves.…
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…
Recently De les Coves, Drescher and Netzer showed that an analogue of the Birkhoff--von Neumann theorem fails in the quantum setting. Motivated by this and questions arising in the study of quantum automorphisms of graphs, we introduce a…
We prove a strengthening of the "reciprocity conjecture" of Khare and Wintenberger. The input to the original conjecture is an odd prime p, a CM number field F containing the pth roots of unity, and a pair of primes of the maximal totally…
For integer $k\geq2$ and prime power $q$, the algebraic bipartite graph $D(k,q)$ proposed by Lazebnik and Ustimenko (1995) is meaningful not only in extremal graph theory but also in coding theory and cryptography. This graph is…
Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…
A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…
We show that cylindric polyadic algebras introduced by Ferenczi has the superamalgmation property. We give two proofs. One is a Henkin construction, and the other is inspired by duality theory in modal logic between finite zig zag products…
Knotted trivalent graphs (KTGs) form a rich algebra with a few simple operations: connected sum, unzip, and bubbling. With these operations, KTGs are generated by the unknotted tetrahedron and Moebius strips. Many previously known…
A diagrammatic expansion of coefficients in the low-momentum expansion of the genus-one four-particle amplitude in type II superstring theory is developed. This is applied to determine coefficients up to order s^6R^4 (where s is a…
The author, and independently De Concini, conjectured that the monodromy of the Casimir connection of a simple Lie algebra g is described by the quantum Weyl group operators of the quantum group U_h(g). The aim of this paper, and of its…
We prove that the Pythagoras number of the ring of integers of the compositum of all real quadratic fields is infinite. The same holds for certain infinite totally real cyclotomic fields. In contrast, we construct infinite degree totally…
A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…
An efficient implicit representation of an $n$-vertex graph $G$ in a family $\mathcal{F}$ of graphs assigns to each vertex of $G$ a binary code of length $O(\log n)$ so that the adjacency between every pair of vertices can be determined…