Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let ${\mathcal G}(n,W)$ be the random graph obtained by independently including each edge $jk\in \binom{[n]}{2}$ with probability $W_{jk}=W_{kj}$. Given a degree sequence $\textbf{d}=(d_1,\ldots, d_n)$, let ${\mathcal G}(n,\textbf{d})$ denote a uniformly random graph with degree sequence $\textbf{d}$. We couple ${\mathcal G}(n,W)$ and ${\mathcal G}(n,\textbf{d})$ together so that asymptotically almost surely ${\mathcal G}(n,W)$ is a subgraph of ${\mathcal G}(n,\textbf{d})$, where $W$ is some function of $\textbf{d}$. Let $\Delta (\textbf{d})$ denote the maximum degree in $\textbf{d}$. Our coupling result is optimal when $\Delta (\textbf{d})^2\ll \|\textbf{d}\|_1$, that is, $W_{ij}$ is asymptotic to ${\mathbb P}(ij\in{\mathcal G}(n,\textbf{d}))$ for every $i,j\in [n]$. We also have coupling results for $\textbf{d}$ that are not constrained by the condition $\Delta (\textbf{d})^2\ll \|\textbf{d}\|_1$. For such $\textbf{d}$ our coupling result is still close to optimal, in the sense that $W_{ij}$ is asymptotic to ${\mathbb P}(ij\in{\mathcal G}(n,\textbf{d}))$ for most pairs $ij\in \binom{[n]}{2}$.

Every countable group G can be embedded in a finitely generated group $G^*$ that is hopfian and complete, that is, $G^*$ has trivial centre and every epimorphism $G^*\to G^*$ is an inner automorphism. Every finite subgroup of $G^*$ is conjugate to a finite subgroup of G. If G has a finite presentation (respectively, a finite classifying space), then so does $G^*$. Our construction of $G^*$ relies on the existence of closed hyperbolic 3-manifolds that are asymmetric and non-Haken.

Taking as a starting point the variation in introspective judgments on embedded gapping in English in the literature, the main goal of this paper is to test the ‘No Embedding Constraint’ experimentally. Building on a first experimental study designed to measure the interaction between that-omission and factivity in English embedded complement clauses, we conducted two experiments testing the role of the complementizer in embedded gapping, paying special attention to the semantic nature of the matrix predicates (non-factives vs semi-factives vs true factives). Our results show, on the one hand, that the ‘No Embedding Constraint’ makes too strong claims that are not backed up by our experimental findings, and, on the other hand, that embedded gapping is affected by both the presence/absence of that and by the semantic class of the matrix predicate in English. In particular, embedded gapping seems to be more acceptable under non-factive verbs, especially in the absence of a complementizer. Both constraints (that-omission and factivity) can be accounted for by a constructionist fragment-based analysis, where the gapped clause is a non-finite phrase that has to address the same Question Under Discussion as its source. This explains, in turn, why embedded gapping under true factive predicates is considered significantly less acceptable. We show that the acceptable cases of embedded gapping involve true syntactic embedding (so, the matrix clause has no parenthetical use). We conclude that English has the same sensitivity to the semantic class of the matrix predicate as other languages, but that the requirements on the presence/absence of that are English specific.

We show that the image of a subshift X under various injective morphisms of symbolic algebraic varieties over monoid universes with algebraic variety alphabets is a subshift of finite type, respectively a sofic subshift, if and only if so is X. Similarly, let G be a countable monoid and let A, B be Artinian modules over a ring. We prove that for every closed subshift submodule $\Sigma \subset A^G$ and every injective G-equivariant uniformly continuous module homomorphism $\tau \colon \! \Sigma \to B^G$, a subshift $\Delta \subset \Sigma $ is of finite type, respectively sofic, if and only if so is the image $\tau (\Delta )$. Generalizations for admissible group cellular automata over admissible Artinian group structure alphabets are also obtained.

Let ${\mathbb{G}(n_1,n_2,m)}$ be a uniformly random m-edge subgraph of the complete bipartite graph ${K_{n_1,n_2}}$ with bipartition $(V_1, V_2)$ , where $n_i = |V_i|$ , $i=1,2$ . Given a real number $p \in [0,1]$ such that $d_1 \,{:\!=}\, pn_2$ and $d_2 \,{:\!=}\, pn_1$ are integers, let $\mathbb{R}(n_1,n_2,p)$ be a random subgraph of ${K_{n_1,n_2}}$ with every vertex $v \in V_i$ of degree $d_i$ , $i = 1, 2$ . In this paper we determine sufficient conditions on $n_1,n_2,p$ and m under which one can embed ${\mathbb{G}(n_1,n_2,m)}$ into $\mathbb{R}(n_1,n_2,p)$ and vice versa with probability tending to 1. In particular, in the balanced case $n_1=n_2$ , we show that if $p\gg\log n/n$ and $1 - p \gg \left(\log n/n \right)^{1/4}$ , then for some $m\sim pn^2$ , asymptotically almost surely one can embed ${\mathbb{G}(n_1,n_2,m)}$ into $\mathbb{R}(n_1,n_2,p)$ , while for $p\gg\left(\log^{3} n/n\right)^{1/4}$ and $1-p\gg\log n/n$ the opposite embedding holds. As an extension, we confirm the Kim–Vu Sandwich Conjecture for degrees growing faster than $(n \log n)^{3/4}$ .

Given a finite lattice L that can be embedded in the recursively enumerable (r.e.) Turing degrees $\langle \mathcal {R}_{\mathrm {T}},\leq _{\mathrm {T}}\rangle $ , we do not in general know how to characterize the degrees $\mathbf {d}\in \mathcal {R}_{\mathrm {T}}$ below which L can be bounded. The important characterizations known are of the $L_7$ and $M_3$ lattices, where the lattices are bounded below $\mathbf {d}$ if and only if $\mathbf {d}$ contains sets of “fickleness” $>\omega $ and $\geq \omega ^\omega $ respectively. We work towards finding a lattice that characterizes the levels above $\omega ^2$ , the first non-trivial level after $\omega $ . We introduced a lattice-theoretic property called “ $3$ -directness” to describe lattices that are no “wider” or “taller” than $L_7$ and $M_3$ . We exhaust the 3-direct lattices L, but they turn out to also characterize the $>\omega $ or $\geq \omega ^\omega $ levels, if L is not already embeddable below all non-zero r.e. degrees. We also considered upper semilattices (USLs) by removing the bottom meet(s) of some 3-direct lattices, but the removals did not change the levels characterized. This leads us to conjecture that a USL characterizes the same r.e. degrees as the lattice on which the USL is based. We discovered three 3-direct lattices besides $M_3$ that also characterize the $\geq \omega ^\omega $ -levels. Our search for a $>\omega ^2$ -candidate therefore involves the lattice-theoretic problem of finding lattices that do not contain any of the four $\geq \omega ^\omega $ -lattices as sublattices.

Abstract prepared by Liling Ko.

E-mail: ko.390@osu.edu

URL: http://sites.nd.edu/liling-ko/

In this note, we show that given a closed connected oriented $3$ -manifold M, there exists a knot K in M such that the manifold $M'$ obtained from M by performing an integer surgery admits an open book decomposition which embeds into the trivial open book of the $5$ -sphere $S^5.$

The bandwidth theorem of Böttcher, Schacht, and Taraz [Proof of the bandwidth conjecture of Bollobás andKomlós, Mathematische Annalen, 2009] gives a condition on the minimum degree of an n-vertex graph G that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth $o(n)$ , thereby proving a conjecture of Bollobás and Komlós [The Blow-up Lemma, Combinatorics, Probability, and Computing, 1999]. In this paper, we prove a version of the bandwidth theorem for locally dense graphs. Indeed, we prove that every locally dense n-vertex graph G with $\delta (G)> (1/2+o(1))n$ contains as a subgraph any given (spanning) H with bounded maximum degree and sublinear bandwidth.

We provide a finite basis for the class of Borel functions that are not in the first Baire class, as well as the class of Borel functions that are not $\sigma $ -continuous with closed witnesses.

We prove some open book embedding results in the contact category with a constructive approach. As a consequence, we give an alternative proof of a theorem of Etnyre and Lekili that produces a large class of contact 3-manifolds admitting contact open book embeddings in the standard contact 5-sphere. We also show that all the Ustilovsky $(4m+1)$-spheres contact open book embed in the standard contact $(4m+3)$-sphere.

We present an actuarial claims reserving technique that takes into account both claim counts and claim amounts. Separate (overdispersed) Poisson models for the claim counts and the claim amounts are combined by a joint embedding into a neural network architecture. As starting point of the neural network calibration, we use exactly these two separate (overdispersed) Poisson models. Such a nested model can be interpreted as a boosting machine. It allows us for joint modeling and mutual learning of claim counts and claim amounts beyond the two individual (overdispersed) Poisson models.

It is proved that the free topological vector space $\mathbb{V}([0,1])$ contains an isomorphic copy of the free topological vector space $\mathbb{V}([0,1]^{n})$ for every finite-dimensional cube $[0,1]^{n}$, thereby answering an open question in the literature. We show that this result cannot be extended from the closed unit interval $[0,1]$ to general metrisable spaces. Indeed, we prove that the free topological vector space $\mathbb{V}(X)$ does not even have a vector subspace isomorphic as a topological vector space to $\mathbb{V}(X\oplus X)$, where $X$ is a Cook continuum, which is a one-dimensional compact metric space. This is also shown to be the case for a rigid Bernstein set, which is a zero-dimensional subspace of the real line.

For a smooth manifold N denote by Em(N) the set of smooth isotopy classes of smooth embeddings N → ℝm. A description of the set Em(Sp × Sq) was known only for p = q = 0 or for p = 0, m ≠ q + 2 or for 2m ⩾ 2(p + q) + max{p, q} + 4. (The description was given in terms of homotopy groups of spheres and of Stiefel manifolds.) For m ⩾ 2p + q + 3 we introduce an abelian group structure on Em(Sp × Sq) and describe this group ‘up to an extension problem’. This result has corollaries which, under stronger dimension restrictions, more explicitly describe Em(Sp × Sq). The proof is based on relations between sets Em(N) for different N and m, in particular, on a recent exact sequence of M. Skopenkov.