Related papers: The theories of Baldwin-Shi hypergraphs and their …

In this paper, we prove that any relative character (a.k.a. spherical character) of any admissible representation of a real reductive group with respect to any pair of spherical subgroups is a holonomic distribution on the group. This…

We prove a version of the strong Taylor's conjecture for stable graphs: if $G$ is a stable graph whose chromatic number is strictly greater than $\beth_2(\aleph_0)$ then $G$ contains all finite subgraphs of Sh$_n(\omega)$ and thus has…

Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…

Let $Y$ be a complex algebraic variety, $G \curvearrowright Y$ an action of an algebraic group on $Y$, $U \subseteq Y({\mathbb C})$ a complex submanifold, $\Gamma < G({\mathbb C})$ a discrete, Zariski dense subgroup of $G({\mathbb C})$…

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.…

This is the first of a series of papers about \emph{quantization} in the context of \emph{derived algebraic geometry}. In this first part, we introduce the notion of \emph{$n$-shifted symplectic structures}, a generalization of the notion…

We construct a new family of infinite-dimensional quasi-graded Lie algebras on hyperelliptic curves. We show that constructed algebras possess infinite number of invariant functions and admit a decomposition into the direct sum of two…

We develop a general theory of algebraic group superschemes, which are not necessarily affine. Our key result is a category equivalence between those group superschemes and Harish-Chandra pairs, which generalizes the result known for affine…

The celebrated canonical Ramsey theorem of Erd\H{o}s and Rado implies that for a given $k$-uniform hypergraph (or $k$-graph) $H$, if $n$ is sufficiently large then any colouring of the edges of the complete $k$-graph $K^{(k)}_n$ gives rise…

The Abu-Khzam--Langston conjecture, that is the weak-immersion analogue of Hadwiger's conjecture and a weak version of an earlier conjecture of Lescure and Meyniel, asserts that every graph $G$ contains a weak immersion of $K_{\chi(G)}$. We…

The K{\L}R conjecture of Kohayakawa, {\L}uczak, and R\"odl is a statement that allows one to prove that asymptotically almost surely all subgraphs of the random graph G_{n,p}, for sufficiently large p : = p(n), satisfy an embedding lemma…

We develop a geometric invariant Littlewood-Paley theory for arbitrary tensors on a compact 2 dimensional manifold. We show that all the important features of the classical LP theory survive with estimates which depend only on very limited…

A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…

We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…

In 2018, by Ramsey and Hoffman theory, Koolen, Yang, and Yang presented a structural result on graphs with smallest eigenvalue at least $-3$ and large minimum degree. In this study, we depart from the conventional use of Ramsey theory and…

We give an exposition of results of Baldwin-Shelah on saturated free algebras, at the level of generality of complete first order theories $T$ with a saturated model $M$ which is in the algebraic closure of an indiscernible set. We then…

There is no known polynomial-time algorithm for graph isomorphism testing, but elementary combinatorial "refinement" algorithms seem to be very efficient in practice. Some philosophical justification is provided by a classical theorem of…

In addition to superconformal symmetry, (1,1) supersymmetric two-dimensional sigma models on special holonomy manifolds have extra symmetries that are in one-to-one correspondence with the covariantly constant forms on these manifolds. The…

We analyze some local properties of sparse Erdos-Renyi graphs, where $d(n)/n$ is the edge probability. In particular we study the behavior of very short paths. For $d(n)=n^{o(1)}$ we show that $G(n,d(n)/n)$ has asymptotically almost surely…