English
Related papers

Related papers: Diamonds on trees

200 papers

The evolution of a closed bosonic string is envisaged in the time-dependent background of its massless modes. A duality transformation is implemented on the spatial component of string coordinates to obtain a dual string. It is shown that…

High Energy Physics - Theory · Physics 2009-10-22 Jnanadeva Maharana

In this paper we analyse some notions of amoeba for tree forcings. In particular we introduce an amoeba-Silver and prove that it satisfies quasi pure decision but not pure decision. Further we define an amoeba-Sacks and prove that it…

Logic · Mathematics 2020-08-13 Giorgio Laguzzi

We show that it is consistent to have an uncountable sequential group of intermediate sequential order while no countable such groups exist. This is proved by adding $\omega_2$ Cohen reals to a model of $\diamondsuit$.

General Topology · Mathematics 2016-11-16 Alexander Shibakov

Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below…

Logic in Computer Science · Computer Science 2024-02-14 Paolo Baldan , Richard Eggert , Barbara König , Tommaso Padoan

Given two non-empty graphs $H$ and $T$, write $H\succcurlyeq T$ to mean that $t(H,G)^{|E(T)|}\geq t(T,G)^{|E(H)|}$ for every graph $G$, where $t(\cdot,\cdot)$ is the homomorphism density function. We obtain various necessary and sufficient…

Combinatorics · Mathematics 2025-01-08 Natalie Behague , Gabriel Crudele , Jonathan A. Noel , Lina M. Simbaqueba

We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…

Combinatorics · Mathematics 2019-03-14 Felix Joos , Jaehoon Kim , Daniela Kühn , Deryk Osthus

In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…

Logic · Mathematics 2019-08-29 Fedor Pakhomov

In the paper "Uniformity of Mordell-Lang" by Vesselin Dimitrov, Philipp Habegger and Ziyang Gao (arXiv:2001.10276), they use Silverman-Tate's Height Inequality and they give a proof of the same which makes use of Cartier divisors and hence…

Number Theory · Mathematics 2024-04-04 Debam Biswas , Zhelun Chen

We introduce and examine some special classes of invariant types$\unicode{x2014}$bi-invariant, strongly bi-invariant, extendibly invariant, and reliably invariant types$\unicode{x2014}$and show that they are related to certain…

Logic · Mathematics 2025-07-30 James E. Hanson

When a Hamiltonian density is bounded by below, we know that the lowest-energy state must be stable. One is often tempted to reverse the theorem and therefore believe that an unbounded Hamiltonian density always implies an instability. The…

General Relativity and Quantum Cosmology · Physics 2023-12-08 Gilles Esposito-Farese

Viale \cite{Viale_GuessingModel} introduced the notion of Generic Laver Diamond at $\kappa$---which we denote $\Diamond_{\text{Lav}}(\kappa)$---asserting the existence of a single function from $\kappa \to H_\kappa$ that behaves much like a…

Logic · Mathematics 2014-05-13 Sean D. Cox

We extend Forester's rigidity theorem so as to give a complete characterization of rigid group actions on trees (an action is rigid if it is the only reduced action in its deformation space, in particular it is invariant under automorphisms…

Group Theory · Mathematics 2008-01-31 Gilbert Levitt

In the first part of the paper, we show that if $\omega \le \kappa < \lambda$ are cardinals, $\kappa^{<\kappa} = \kappa$, and $\lambda$ is weakly compact, then in $V[\M(\kappa,\lambda)]$ the tree property at $\lambda =…

Logic · Mathematics 2020-04-22 Radek Honzik , Sarka Stejskalova

This paper gives a generic form of the diamond lemma, which includes support for additive and topological structures of the base set, and which does not require any further structure (e.g. an associative multiplication operation) to be…

Rings and Algebras · Mathematics 2007-12-10 Lars Hellström

We obtain sufficient conditions for the emergence of spanning and almost-spanning bounded-degree {\sl rainbow} trees in various host graphs, having their edges coloured independently and uniformly at random, using a predetermined palette.…

Combinatorics · Mathematics 2021-05-25 Elad Aigner-Horev , Dan Hefetz , Abhiruk Lahiri

In a previous paper we developed the notions of th-independence and \th-ranks which define a geometric independence relation in a class of theories which we called ``rosy''. We proved that rosy theories include simple and o-minimal theories…

Logic · Mathematics 2007-05-23 Alf Onshuus

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

We initiate a search for non-perturbative consistency conditions in M theory. Some non-perturbative conditions are already known in Type I theories; we review these and search for others. We focus principally on possible anomalies in…

High Energy Physics - Theory · Physics 2009-11-10 Michael Dine , Michael Graesser

A systematic theory of structural limits for finite models has been developed by Nesetril and Ossona de Mendez. It is based on the insight that the collection of finite structures can be embedded, via a map they call the Stone pairing, in a…

Logic in Computer Science · Computer Science 2022-09-05 Mai Gehrke , Tomáš Jakl , Luca Reggio

Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we know: Any property of finite structures, which is expressible by…

Databases · Computer Science 2008-09-19 Georg Gottlob , Reinhard Pichler , Fang Wei
‹ Prev 1 8 9 10 Next ›