Related papers: A classification of 2-chains having 1-shell bounda…

Turaev defined a function on the first homology of a rational homology 3-sphere $Y$ as the minimal rational Seifert genus of all knots in this homology class. Ni and the first author discovered a lower bound of this function using the…

In this short note we confirm the deep structural correspondence between the complexity of a countable scattered chain (= strict linear order) and its big Ramsey combinatorics: we show that a countable scattered chain has finite big Ramsey…

We determine the first non-stable ${\mathbb A}^1$-homotopy sheaf of $SL_n$. Using techniques of obstruction theory involving the ${\mathbb A}^1$-Postnikov tower, supported by some ideas from the theory of unimodular rows, we classify vector…

Let T_n denote the set of log canonical thresholds of pairs (X,Y), with X a nonsingular variety of dimension n, and Y a nonempty closed subscheme of X. Using non-standard methods, we show that every limit of a decreasing sequence in T_n…

Consider a family $\mathcal F$ of $C_{2r+1}$-free graphs, where $r\geq 2$. Suppose that each graph in $\mathcal F$ has minimum degree linear in its number of vertices. Thomassen showed that such a family has bounded chromatic number, or,…

We introduce a natural class of models of random chain complexes of real vector spaces that some classical ensembles of random matrices, the length $1$ case. We are interested here in the homological properties of these random complexes.…

We prove that two chains of linear mappings are topologically isomorphic if and only if they are linearly isomorphic.

It is a classical theorem of Loewner that the systole of a Riemannian torus can be bounded in terms of its area. We answer a question of a similar flavor of Robert Young showing that if $T$ is a Riemannian 2-torus with boundary in $\mathbb…

In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…

For every integer $g \,\geq\, 2$ we show the existence of a compact Riemann surface $\Sigma$ of genus $g$ such that the rank two trivial holomorphic vector bundle ${\mathcal O}^{\oplus 2}_{\Sigma}$ admits holomorphic connections with…

A drawing of a graph is 1-planar if each edge participates in at most one crossing and adjacent edges do not cross. Up to symmetry, each crossing in a 1-planar drawing belongs to one out of six possible crossing types, where a type…

We study a variety of field theories with vanishing single soft limits. In all cases, the structure of the soft limit is controlled by a larger theory, which provides an extension of the original one by adding more fields and interactions.…

General coherence theorems are constructed that yield explicit presentations of categorical and algebraic objects. The categorical structures involved are finitary discrete Lawvere 2-theories, though they are approached within the language…

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

For every $k\ge 2$ and $\Delta$, we prove that there exists a constant $C_{\Delta,k}$ such that the following holds. For every graph $H$ with $\chi(H)=k$ and every tree with at least $C_{\Delta,k}|H|$ vertices and maximum degree at most…

We give examples of sequences of smooth non-isotrivial curves for every genus at least two, defined over a rational function field of positive characteristic, such that the (finite) number of rational points of the curves in the sequence…

A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…

We give a new characterization of maximal repetitions (or runs) in strings based on Lyndon words. The characterization leads to a proof of what was known as the "runs" conjecture (Kolpakov \& Kucherov (FOCS '99)), which states that the…

Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…

We study Little String Theories (LST) with ${\cal N}=(1,0)$ supersymmetry arising, in a suitable double scaling limit, from 5-branes in heterotic string theory or in the heterotic-like type II/$(-)^{F_L}\times {\rm shift}$. The limit in…