Related papers: More Constructions for Tur\'an's (3, 4)-Conjecture
We outline the proof that non-triangulable manifolds exist in any dimension greater than four. The arguments involve homology cobordism invariants coming from the Pin(2) symmetry of the Seiberg-Witten equations. We also explore a related…
Let $E/\mathbb{Q}$ be an elliptic curve and let $\mathbb{Q}(3^\infty)$ be the compositum of all cubic extensions of $\mathbb{Q}$. In this article we show that the torsion subgroup of $E(\mathbb{Q}(3^\infty))$ is finite and determine 20…
We provide classification results for translation generalized quadrangles of order less or equal to $64$, and hence, for all incidence geometries related to them. The results consist of the classification of all pseudo-ovals in…
For every knot K with stick number k there is a knotted polyhedral torus of knot type K with 3k vertices. We prove that at least 3k-2 vertices are necessary.
For earlier considered our sequence A166944 in [4] we prove three statements of its connection with twin primes. We also give a sufficient condition for the infinity of twin primes and pose several new conjectures; among them we propose a…
The 3x+1 Conjecture asserts that the T-orbit of every positive integer contains 1, where T maps x\mapsto x/2 for x even and x\mapsto (3x+1)/2 for x odd. A set S of positive integers is sufficient if the orbit of each positive integer…
We study twisted modules for (weak) quantum vertex algebras and we give a conceptual construction of (weak) quantum vertex algebras and their twisted modules. As an application we construct and classify irreducible twisted modules for a…
Let T_n be the Teichmueller space of flat metrics on the n-dimensional torus and identify SL(n,Z) with the corresponding mapping class group. We prove that the subset Y consisting of those points at which the systoles generate the…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…
Let $ex(Q_n, H)$ be the largest number of edges in a subgraph $G$ of a hypercube $Q_n$ such that there is no subgraph of $G$ isomorphic to $H$. We show that for any integer $k\geq 3$, $$ex(Q_n, C_{4k+2})= O(n^{\frac{5}{6} +…
In this paper, we establish a rigorous correspondence between the two tube algebras, that one comes from the Turaev-Viro-Ocneanu TQFT introduced by Ocneanu and another comes from the sector theory introduced by Izumi, and construct a…
We construct invariants of four-dimensional piecewise-linear manifolds, represented as simplicial complexes, with respect to rebuildings that transform a cluster of three 4-simplices having a common two-dimensional face in a different…
We compute invariants of quadratic forms associated to orthogonal hypergeometric groups of degree five. This allows us to determine some commensurabilities between these groups, as well as to say when some thin groups cannot be conjugate to…
For a tropical prevariety in ${R}^n$ given by a system of $k$ tropical polynomials in $n$ variables with degrees at most $d$, we prove that its number of connected components is less than ${k+7n-1 \choose 3n} \cdot \frac{d^{3n}}{k+n+1}$. On…
In this note we study numerically the combinatorics of curves and geodesics on the torus with one boundary component. A potential computational difficulty is avoided by counting inside specific orbits of the mapping class group up to a…
In this paper, we formulate and prove several variants of the Erd\H{o}s-Tur\'{a}n additive bases conjecture.
We construct small (50 and 26 points, respectively) point sets in dimension 5 whose graphs of triangulations are not connected. These examples improve our construction in J. Amer. Math. Soc., 13:3 (2000), 611--637 not only in size, but also…
There are two particular $\Theta_6$-graphs - the 6-cycle graphs with a diagonal. We find the planar Tur\'an number of each of them, i.e. the maximum number of edges in a planar graph $G$ of $n$ vertices not containing the given $\Theta_6$…
Let $r \ge 3$ be fixed and $G$ be an $n$-vertex graph. A long-standing conjecture of Gy\H{o}ri states that if $e(G) = t_{r-1}(n) + k$, where $t_{r-1}(n)$ denotes the number of edges of the Tur\'{a}n graph on $n$ vertices and $r - 1$ parts,…