Related papers: A classification of 2-chains having 1-shell bounda…
We consider the problem of classifying (possibly noncommutative) R-algebras of low rank over an arbitrary base ring R. We first classify algebras by their degree, and we relate the class of algebras of degree 2 to algebras with a standard…
The complete classification of (3,3)-nets and of (3,4)-nets with only double and triple points is given. Up to lattice isomorphism, there are exactly 3 effective possibilities in each case, and some of these provide new examples of…
An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…
Lattice regularizations of the bosonic string allow no tachyons. This has often been viewed as the reason why these theories have never managed to make any contact to standard continuum string theories when the dimension of spacetime is…
We show that in heterotic string theory compactified on a six dimensional torus, the lower bound (Bogomol'nyi bound) on the dyon mass is invariant under the SL(2,Z) transformation that interchanges strong and weak coupling limits of the…
We study two notions of being well-structured for classes of graphs that are inspired by classic model theory. A class of graphs $C$ is monadically stable if it is impossible to define arbitrarily long linear orders in vertex-colored graphs…
In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in terms of its dimension. We observe that the…
Robust sunflowers are a generalization of combinatorial sunflowers that have applications in monotone circuit complexity, DNF sparsification, randomness extractors, and recent advances on the Erd\H{o}s-Rado sunflower conjecture. The recent…
Arboreal singularities are an important class of Lagrangian singularities. They are conical, meaning that they can be understood by studying their links, which are singular Legendrian spaces in $S^{2n-1}_{\text{std}}$. Loose Legendrians are…
Let $v(F)$ denote the number of vertices in a fixed connected pattern graph $F$. We show an infinite family of patterns $F$ such that the existence of a subgraph isomorphic to $F$ is expressible by a first-order sentence of quantifier depth…
A class of graphs is $\chi$-bounded if there exists a function $f:\mathbb N\rightarrow \mathbb N$ such that for every graph $G$ in the class and an induced subgraph $H$ of $G$, if $H$ has no clique of size $q+1$, then the chromatic number…
We investigate a holographic realization in Type-IIB string theory of pure Chern-Simons theories, and focus on the level/rank dualities that they enjoy. The level/rank duality is established between the boundary theory, engineered utilizing…
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.
We give a combinatorial criterion that implies both the non-strong relative hyperbolicity and the one-endedness of a finitely generated group. We use this to show that many important classes of groups do not admit a strong relatively…
We study special Lagrangian cones in $\C^n$ with isolated singularities. Our main result constructs an infinite family of special Lagrangian cones in $\C^3$ each of which has a toroidal link. We obtain a detailed geometric description of…
A well known generalisation of Dirac's theorem states that if a graph $G$ on $n\ge 4k$ vertices has minimum degree at least $n/2$ then $G$ contains a $2$-factor consisting of exactly $k$ cycles. This is easily seen to be tight in terms of…
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non-1-planar graph $G$ is minimal if the graph $G-e$ is 1-planar for every…
The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are hard to implement due to a lack of a systematic theoretical…
In this paper we study topological lower bounds on the number of zeros of closed 1-forms without Morse type assumptions. We prove that one may always find a representing closed 1-form having at most one zero. We introduce and study a…
A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…