Related papers: Square-bracket operations clubs
Let $\mbox{TFAG}$ be the theory of torsion-free abelian groups. We show that if there is no countable transitive model of $ZFC^- + \kappa(\omega)$ exists, then $\mbox{TFAG}$ is $a \Delta^1_2$-complete; in particular, this is consistent with…
In this paper we aim to compare Kurepa trees and Aronszajn trees. Moreover, we analyze the affect of large cardinal assumptions on this comparison. Using the the method of walks on ordinals, we will show it is consistent with ZFC that there…
We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…
In this paper, we look at an unambiguous version of Simon's forest factorization theorem, a very deep result which has wide connections in algebra, logic and automata. Given a morphism $\varphi$ from $\Sigma^+$ to a finite semigroup $S$, we…
Let $Y$ be a subspace of a topological vector space $X$, and $A\subset X$ an open convex set that intersects $Y$. We say that the property $(QE)$ [property $(CE)$] holds if every continuous quasiconvex [continuous convex] function on $A\cap…
We formulate a property strengthening the Disjoint Amalgamation Property and prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees…
A bracket is a function that assigns a number to each monomial in variables \tau_0, \tau_1, ... We show that any bracket satisfying the string and the dilaton relations gives rise to a power series lying in the algebra A generated by the…
In this note the long standing problem of the definition of a Poisson bracket in the framework of a multisymplectic formulation of classical field theory is solved. The new bracket operation can be applied to forms of arbitary degree.…
An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in…
We consider 2-player zero-sum stochastic games where each player controls his own state variable living in a compact metric space. The terminology comes from gambling problems where the state of a player represents its wealth in a casino.…
In 1992, David Wright proved a remarkable theorem about which contractible open manifolds are covering spaces. He showed that if a one-ended open manifold M has pro-monomorphic fundamental group at infinity which is not pro-trivial and is…
We consider the modality "$\varphi$ is true in every $\sigma$-centered forcing extension", denoted $\square\varphi$, and its dual "$\varphi$ is true in some $\sigma$-centered forcing extension", denoted $\lozenge\varphi$ (where $\varphi$ is…
We prove that finite partial orders with a linear extension form a Ramsey class. Our proof is based on the fact that class of acyclic graphs has the Ramsey property and uses the partite construction.
A recurrent graph $G$ has the infinite collision property if two independent random walks on $G$, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this…
We study resolvent estimates and maximal regularity of the Stokes operator in $L^q$-spaces with exponential weights in the axial directions of unbounded cylinders of $\R^n,n\geq 3$. For a straight cylinder we use exponential weights in the…
Let $G$ be a semisimple, simply connected algebraic group defined and split over a prime field ${\mathbb F}_p$ of positive characteristic. For a positive integer $r$, let $G_r$ be the $r$th Frobenius kernel of $G$. Let $Q$ be a projective…
The primary goal of this paper is to establish a model of $ZFC$ wherein the definable tree property is affirmed for all uncountable regular cardinals. This endeavor commences with the utilization of both a supercompact cardinal and a…
We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
In this work, we develop a unified framework for establishing sharp threshold results for various Ramsey properties. To achieve this, we view such properties as non-colourability of auxiliary hypergraphs. Our main technical result gives…