English
Related papers

Related papers: Many (omega)-categorical Structures Have the Small…

200 papers

At the core of the Robertson-Seymour theory of graph minors lies a powerful structure theorem which captures, for any fixed graph H, the common structural features of all the graphs not containing H as a minor. Robertson and Seymour prove…

Combinatorics · Mathematics 2011-12-13 R. Diestel , K. Kawarabayashi , T. Müller , P. Wollan

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

Logic · Mathematics 2015-06-09 Ioannis Souldatos

We show that the endomorphisms of a compact connected group that extend to endomorphisms of every compact overgroup are precisely the trivial one and the inner automorphisms; this is an analogue, for compact connected groups, of results due…

Group Theory · Mathematics 2023-09-26 Alexandru Chirvasitu

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies the partial $ \Pi $-property in $ G $ if if there exists a chief series $ \varGamma_{G}: 1 =G_{0} < G_{1} < \cdot\cdot\cdot < G_{n}= G $ of $ G $ such that for…

Group Theory · Mathematics 2024-03-19 Zhengtian Qiu , Jianjun Liu , Guiyun Chen

We construct families of cell complexes that generalize expander graphs. These families are called non-$k$-hyperfinite, generalizing the idea of a non-hyperfinite (NH) family of graphs. Roughly speaking, such a complex has the property that…

Quantum Physics · Physics 2015-10-05 M. H. Freedman , M. B. Hastings

The main theorem shows that if M is an irreducible compact connected orientable 3-manifold with non-empty boundary, then the classifying space BDiff(M rel dM) of the space of diffeomorphisms of M which restrict to the identity map on…

Geometric Topology · Mathematics 2014-11-11 Allen Hatcher , Darryl McCullough

Kostochka and Yancey resolved a famous conjecture of Ore on the asymptotic density of $k$-critical graphs by proving that every $k$-critical graph $G$ satisfies $|E(G)| \geq (\frac{k}{2} - \frac{1}{k-1})|V(G)| - \frac{k(k-3)}{2(k-1)}$. The…

Combinatorics · Mathematics 2018-11-08 Wenbo Gao , Luke Postle

In this article we deduce some algebraic properties for the group $\mathrm{Sp}_{2n} (\mathcal{O}(X))$ of holomorphic symplectic matrices on a Stein space $X$: holomorphic factorization, exponential factorization, and Kazhdan's property (T).…

Complex Variables · Mathematics 2022-07-26 Gaofeng Huang , Frank Kutzschebauch , Josua Schott

Let $f\colon M\to N$ be a continuous map between closed irreducible graph manifolds with infinite fundamental group. Perron and Shalen showed that if $f$ induces a homology equivalence on all finite covers, then $f$ is in fact homotopic to…

Geometric Topology · Mathematics 2010-04-22 Matthias Aschenbrenner , Stefan Friedl

Denote by $\mathcal{H}_k (n,p)$ the random $k$-graph in which each $k$-subset of $\{1... n\}$ is present with probability $p$, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a…

Combinatorics · Mathematics 2016-08-17 Arran Hamm , Jeff Kahn

Previous work of the author [39] showed that the Homomorphism Preservation Theorem of classical model theory remains valid when its statement is restricted to finite structures. In this paper, we give a new proof of this result via a…

Computational Complexity · Computer Science 2016-12-28 Benjamin Rossman

We show that if a field k contains sufficiently many elements(for instance, if k is infinite), and K is an algebraically closed field containing k, then every linear algebraic k-group over K is k-isomorphic to Aut(A\otimes_kK), where A is a…

Rings and Algebras · Mathematics 2007-05-23 Nikolai L. Gordeev , Vladimir L. Popov

Let $X$ be an algebraic surface with $\mathcal{L}$ an ample line bundle on $X$. Let $\Gamma(X, \mathcal{L})$ be the \emph{geometric monodromy} group associated to family of nonsingular curves in $X$ that are zero loci of sections of…

Geometric Topology · Mathematics 2024-03-13 Ishan Banerjee

A connected graph $G$ with at least $2m+2n+2$ vertices is said to have property $E(m,n)$ if, for any two disjoint matchings $M$ and $N$ of size $m$ and $n$ respectively, $G$ has a perfect matching $F$ such that $M\subseteq F$ and $N\cap…

Combinatorics · Mathematics 2010-02-04 Qiuli Li , Heping Zhang

We discuss the finiteness of the topological entropy of continuous endomorphims for some classes of locally compact groups. Firstly, we focus on the abelian case, imposing the condition of being compactly generated, and note an interesting…

Group Theory · Mathematics 2024-03-01 Francesco G. Russo , Olwethu Waka

Inspired by computational complexity results for the quantified constraint satisfaction problem, we study the clones of idempotent polymorphisms of certain digraph classes. Our first results are two algebraic dichotomy, even "gap",…

Computational Complexity · Computer Science 2015-05-13 Catarina Carvalho , Florent Madelaine , Barnaby Martin

Let $G$ be a compact connected Lie group and let $P$ be a principal $G$-bundle over $K$. The gauge group of $P$ is the topological group of automorphisms of $P$. For fixed $G$ and $K$, consider all principal $G$-bundles $P$ over $K$. It is…

Algebraic Topology · Mathematics 2016-08-11 Daisuke Kishimoto , Mitsunobu Tsutaya

This work is the extension of the results by the author in [7] and [6] for low-genus surfaces. Let $S$ be an orientable, connected surface of finite topological type, with genus $g \leq 2$, empty boundary, and complexity at least $2$; as a…

Geometric Topology · Mathematics 2026-05-27 Jesús Hernández Hernández

A graph is $k$-gap-planar if it has a drawing in the plane such that every crossing can be charged to one of the two edges involved so that at most $k$ crossings are charged to each edge. We show this class of graphs has linear expansion.…

Combinatorics · Mathematics 2025-10-21 David R. Wood

A sequence of nonnegative integers \pi =(d_1,d_2,...,d_n) is graphic if there is a (simple) graph G with degree sequence \pi. In this case, G is said to realize or be a realization of \pi. Degree sequence results in the literature generally…

Combinatorics · Mathematics 2015-11-04 Michael Ferrara , Timothy D. LeSaulnier , Casey K. Moffatt , Paul S. Wenger