Related papers: The theories of Baldwin-Shi hypergraphs and their …
We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As…
This short note contains a combinatorial construction of symmetries arising in symplectic geometry (partially wrapped or infinitesimal Fukaya categories), algebraic geometry (derived categories of singularities), and K-theory (Waldhausen's…
We show that (with one possible exception) there exist strongly dense free subgroups in any semisimple algebraic group over a large enough field. These are nonabelian free subgroups all of whose subgroups are either cyclic or Zariski dense.…
Using constructions of Hirsch and Hodkinson, we show that the class of strongly atom structures for various cylindric-like algebras is not elementary. This applies to diagonal free reducts and polyadic algebras with and without equality.…
We extend the concept of "almost indiscernible theory" introduced by Pillay and Sklinos in [Bull. Symb. Log., 2015] (which was itself a modernization and expansion of Baldwin and Shelah [Algebra Universalis, 1983]), to uncountable languages…
We introduce the notion of normal hyperimaginary and we develop its basic theory. We present a new proof of Lascar-Pillay's theorem on bounded hyperimaginaries based on properties of normal hyperimaginaries. However, the use of Peter-Weyl's…
We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e.,…
The Littlewood-Paley theory is extended to weighted spaces of distributions on $[-1,1]$ with Jacobi weights $ \w(t)=(1-t)^\alpha(1+t)^\beta. $ Almost exponentially localized polynomial elements (needlets) $\{\phi_\xi\}$, $\{\psi_\xi\}$ are…
A graph on $n$ vertices is said to be \emph{$C$-Ramsey} if every clique or independent set of the graph has size at most $C \log n$. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed…
The occurrence of the Askey-Wilson (AW) algebra in the $SU(2)$ Chern-Simons (CS) theory and in the Reshetikhin-Turaev (RT) link invariant construction with quantum algebra $U_q(\mathfrak{su}_2)$ is explored. Tangle diagrams with three…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
In this paper we study spectra of Laplacians of infinite weighted graphs. Instead of the assumption of local finiteness we impose the condition of summability of the weight function. Such graphs correspond to reversible Markov chains with…
In the framework of algebraic supergeometry, we give a construction of the scheme-theoretic supergeometric analogue of Chevalley groups, namely affine algebraic supergroups associated to simple Lie superalgebras of classical type. In…
We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…
We compare quasi-graphs and generalized $\sin(1/x)$-type continua, which are two classes of continua that generalize topological graphs and contain the Warsaw circle as a nontrivial common element. We show that neither class is a subset of…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
Let $\Gamma$ be a discrete subgroup of a simply connected, solvable Lie group~$G$, such that $\Ad_G\Gamma$ has the same Zariski closure as $\Ad G$. If $\alpha \colon \Gamma \to \GL_n(\real)$ is any finite-dimensional representation…
Similarity metrics are central in the theory of large networks and graph limits. For bounded-degree graphs, the Benjamini--Schramm metric records the distribution of rooted neighbourhoods, while the stronger colored-neighbourhood metric…
A result due to Gy\'arf\'as, Hubenko, and Solymosi (answering a question of Erd\"os) states that if a graph $G$ on $n$ vertices does not contain $K_{2,2}$ as an induced subgraph yet has at least $c\binom{n}{2}$ edges, then $G$ has a…
We consider Stanley--Reisner rings $k[x_1,...,x_n]/I(\mc{H})$ where $I(\mc{H})$ is the edge ideal associated to some particular classes of hypergraphs. For instance, we consider hypergraphs that are natural generalizations of graphs that…