English
Related papers

Related papers: Sharp Vaught's Conjecture for Some Classes of Part…

200 papers

Extending a result of K. Milliken \cite{Mi2}, in this paper we prove a Ramsey classification result for equivalence relations defined on uniform families of finite strong subtrees of a finite sequence $(U_i)_{i\in d}$ of fixed trees $U_i$,…

Logic · Mathematics 2014-10-21 Dimitris Vlitas

Robertson and Seymour's celebrated Graph Minor Theorem states that graphs are well-quasi-ordered by the minor relation. Unlike the minor relation, the topological minor relation does not well-quasi-order graphs in general. Among all known…

Combinatorics · Mathematics 2024-12-30 Chun-Hung Liu , Robin Thomas

We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…

Combinatorics · Mathematics 2024-06-24 Manuel Bodirsky , Colin Jahel

Kalai conjectured that every $n$-vertex $r$-uniform hypergraph with more than $\frac{t-1}{r} {n \choose r-1}$ edges contains all tight $r$-trees of some fixed size $t$. We prove Kalai's conjecture for $r$-partite $r$-uniform hypergraphs.…

Combinatorics · Mathematics 2019-12-25 Maya Stein

A basic problem in the theory of partially ordered vector spaces is to characterise those cones on which every order-isomorphism is linear. We show that this is the case for every Archimedean cone that equals the inf-sup hull of the sum of…

Functional Analysis · Mathematics 2023-11-27 Bas Lemmens , Hent van Imhoff , Onno van Gaans

The Torsion Anomalous Conjecture states that an irreducible variety $V$ embedded in a semi-abelian variety contains only finitely many maximal $V$-torsion anomalous varieties. In this paper we consider an irreducible variety embedded in a…

Number Theory · Mathematics 2024-04-09 Sara Checcoli , Francesco Veneziano , Evelina Viada

We disprove a well-known conjecture of Boston (2000), which claims that a just-infinite pro-$p$ group is branch if and only if it admits a positive-dimensional embedding in the group of $p$-adic automorphisms. This is obtained as a result…

Group Theory · Mathematics 2025-07-31 Jorge Fariña-Asategui

We introduce the notion of \tau-like partial order, where \tau is one of the linear order types \omega, \omega*, \omega+\omega*, and \zeta. For example, being \omega-like means that every element has finitely many predecessors, while being…

Logic · Mathematics 2013-02-08 Emanuele Frittaion , Alberto Marcone

We prove the following version of the first incompleteness theorem that simultaneously strengthens Mostowski's theorem and Vaught's theorem: For any c.e. family $\{ T_i \}_{i \in \omega}$ of consistent extensions of Tarski, Mostowski and…

Logic · Mathematics 2023-08-15 Taishi Kurahashi

Hasunuma [J. Graph Theory 102 (2023) 423-435] conjectured that for any tree $T$ of order $m$, every $k$-connected (or $k$-edge-connected) graph $G$ with minimum degree at least $k+m-1$ contains a tree $T'\cong T$ such that $G-E(T')$ is…

Combinatorics · Mathematics 2023-03-08 Qing Yang , Yingzhi Tian

We conjecture an intrinsic UV cutoff for the validity of the effective field theory with a large number of species coupled to gravity. In four dimensions such a UV cutoff takes the form $\Lambda=\sqrt{\lambda/ N}M_p$ for $N$ scalar fields…

High Energy Physics - Theory · Physics 2008-11-26 Qing-Guo Huang

Consider an order $n$ abelian group $G$ and a tree $T$ on $n$ vertices. When is it possible to (bijectively) label $V(T)$ by $G$ so that along all edges $xy$ of $T$, the sums $x+y$ are distinct? This problem can be traced back to the work…

Combinatorics · Mathematics 2025-10-07 Alp Müyesser , Alexey Pokrovskiy

A conjecture by Bollob\'as from 1995 (which is a weakenning of the famous Tree Packing Conjecture by Gy\'arf\'as from 1976) states that any set of $k$ trees $T_n,T_{n-1},\dots,T_{n-k+1}$, such that $T_{n-i}$ has $n-i$ vertices, pack into…

Combinatorics · Mathematics 2015-11-11 Andrzej Żak

An $r$-uniform hypergraph is a tight $r$-tree if its edges can be ordered so that every edge $e$ contains a vertex $v$ that does not belong to any preceding edge and the set $e-v$ lies in some preceding edge. A conjecture of Kalai [Kalai],…

Combinatorics · Mathematics 2017-12-13 Zoltán Füredi , Tao Jiang , Alexandr Kostochka , Dhruv Mubayi , Jacques Verstraëte

Luo, Tian and Wu (2022) conjectured that for any tree $T$ with bipartition $X$ and $Y$, every $k$-connected bipartite graph $G$ with minimum degree at least $k+t$, where $t=$max$\{|X|,|Y|\}$, contains a tree $T'\cong T$ such that $G-V(T')$…

Combinatorics · Mathematics 2024-01-23 Qing Yang , Yingzhi Tian

Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…

Logic · Mathematics 2021-05-27 Predrag Tanović , Slavko Moconja , Dejan Ilić

Tate's theorem (Invent. Math. 1966)implies that the Tate conjecture holds for any abelian variety over a finite field whose Q_l-algebra of Tate classes is generated by those of degree 1. We construct families of abelian varieties over…

Number Theory · Mathematics 2021-01-27 J. S. Milne

A well-known conjecture of Orlov asks whether the existence of a full exceptional collection implies rationality of the underlying variety. We prove this conjecture for arithmetic toric varieties over general fields. We also investigate a…

Algebraic Geometry · Mathematics 2024-09-27 Matthew R. Ballard , Alexander Duncan , Alicia Lamarche , Patrick K. McFaddin

Watkins's conjecture suggests that for an elliptic curve $E/\mathbb{Q}$, the rank of the group $E(\mathbb{Q})$ of rational points is bounded above by $\nu_2 (m_E)$, where $m_E$ is the modular degree associated with $E$. It is known that…

Number Theory · Mathematics 2024-07-26 Subham Bhakta , Srilakshmi Krishnamoorthy

The Bar\'at-Thomassen conjecture asserts that for every tree $T$ on $m$ edges, there exists a constant $k_T$ such that every $k_T$-edge-connected graph with size divisible by $m$ can be edge-decomposed into copies of $T$. So far this…

Combinatorics · Mathematics 2016-11-09 Julien Bensmail , Ararat Harutyunyan , Tien-Nam Le , Martin Merker , Stéphan Thomassé